Skip to content

Basic data structure underlying search Engines :inverted Index

Notifications You must be signed in to change notification settings

rupeshcash/Java_Based_Search_Engine

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Java_Based_Search_Engine

Basic data structure underlying search Engines is called inverted Index. This program Uses this inverted index to answer some simple search queries.

�> queryFindPagesWhichContainAllWords x1 x2 .. xn: Print the name of the webpages which contain all the words x1, x2, .. xn. The words are separated by a space.

�> queryFindPagesWhichContainAnyOfTheseWords x1 x2 .. xn: Print the name of the webpages which contain at least one word from this set f x1, x2, .. xn g.

�> queryFindPagesWhichContainPhrase x1 x2 .. xn: Print the name of the webpages which contain the phrase x1 x2 .. xn.

�> queryFindPositionsOfWordInAPage x y Print the word indice's where the word x is found in the document y. The word indices should be separated by a comma. If the word x is not found in webpage y, then print \Webpage y does not contain word x".

About

Basic data structure underlying search Engines :inverted Index

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages