– Given a corpus of databases, made an efficient search engine using Tries, AVL Trees along with other data structures. – The pattern matching is done with the available information and fed into Open AI chatbot to give the desired output to the user. – Pattern Searching was made efficient by using the Boyer-Moore algorithm(bad-character heuristic).
-
Notifications
You must be signed in to change notification settings - Fork 0
kausvatsa/Search-Engine-based-on-the-Database-provided
About
Given a corpus of databases, made an efficient search engine using Tries, AVL Trees along with other data structures and implemented Boyer-Moore's Algorithm for Pattern Searching
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published