Inverted index is to allow fast full text searches, at a cost of increased processing when a document is added to the database. It is easy to develop. It is the most popular data structure used in document retrieval systems, used on a large scale for example in search engines.
using efficient implementations of tree data structures such as Binary Search tree (BST), AVL tree, TST tree, Balanced TST tree and Trie. Also used these data structures to index a dictionary passages and allow users to search, list and manipulate the data structures using a Modern userinterface (WPF).
