Skip to content

System Programming. Implementation of Search Engine using a Trie structure

Notifications You must be signed in to change notification settings

taggelos/MiniSearch

Repository files navigation

MiniSearch

Mini search engine for keywords in files. Sentences are considered as documents (big in size). Each document has the appropriate number starting from 0.

Arguments:
./minisearch -i docfile -k K
./minisearch -i docfile (default value 10 gia to K)
./minisearch -k K -i docfile

Commands:
/search q1, q2 .. q10 (search 1 to 10 words)
/df (document frequency of all words)
/df q1 (document frequency of specific word)
/tf (term frequency)

The score of each document was calculated using bm25

The trie structure can be seen in the image below

Image

About

System Programming. Implementation of Search Engine using a Trie structure

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published