Mini Search Engine

Presented at Department of Mathematics, Indian Institute of Technology Guwahati, 2015

We used data structures like Hash Tables, Balanced Trees in order to design a text search engine that gives the frequency of the searched word in a given folder of files.

We analyze and compare different data structures that can be used in search engines.

Project Link, Presentation Slides

Leave a Comment