Optimized index construction for large text collections using blocked sort-based indexing

Indexes are the key technology corroborate efficient text search. This paper, present an optimized index construction strategies for file system search engine. Index construction can be done in two phase: apply analyzer rule and index compression respectively. For fast index construction in-memory blocked sort-based Index partitions approach is used. Inverted index data structure used to provide efficient query evaluation. Special attention is given to a particular case of desktop search system such as Windows Desktop Search and Apple spotlight. As one of the main result of this paper demonstrate the time complexity and space complexity of indexed file.