Skip to content

Latest commit

 

History

History
54 lines (39 loc) · 1.35 KB

section_homework_inverted_index.md

File metadata and controls

54 lines (39 loc) · 1.35 KB

Homework

Implement boolean retrieval using inverted index

Notes:

Enter query, empty to quit:

? this text
['resources/1.txt', 'resources/2.txt', 'resources/3.txt']

Enter query, empty to quit:

? another Text
['resources/2.txt']

Enter query, empty to quit:

? Words
['resources/1.txt']

Enter query, empty to quit:

? blubbergurken
[]

Enter query, empty to quit:

? blubbergurken text
[]

Enter query, empty to quit:
?

Notes:

Homework

  • Build Inverted Index from text files
  • Use the provided setup, make sure to read README.md
  • Read resources/*.txt
    • Just once during start up, not for every query
  • Query using implicit AND (this textthis AND text)
  • Your application should be able to handle millions of files efficiently
    • Carefully think about what you can pre-calculate during indexing to save time while searching
  • Focus on correct implementation of the required algorithms and data structures
    • Avoid long iterations, lookups should be fast.
  • Use the provided CLI to manually test your application (see README.md)
  • Ensure that the provided test cases run successfully (see README.md)

Notes: