Clustered Distributed Index for Efficient Text Retrieval Using Threads

In this research paper, a novel method of improving the clustered distributed indices for efficient textretrieval using threads is presented. In text retrieval, text search refers to a technique of searching storeddocument or database. In a full text search, the search engine examines all the words in every storeddocument as it tries to match search words supplied by the user. When dealing with a small number ofdocuments, the full-text search engine performs a serial scan, where it directly scans the contents of thedocuments with each query. When the number of documents to search is potentially large or the quantityof search queries to perform is substantial, the problem of full text search is often divided into two tasks,viz., indexing and searching. The indexing stage scans for text of all the documents and builds a list ofsearch terms, often called an index. In the search stage, when performing a specific query, only the indexis referenced rather than the text of the original documents. Considering all the above mentionedcriterias, this paper aims at improving the search time on the index, by clustering the index. Threads areused to perform a parallel search on each of these clusters. The algorithm developed in C has beentested on various sizes of data and queries and compared with the sequential search method. Thedepicted results shown in the result section clearly show that this approach improves the search timesignificantly & the method proposed shows the efficacy, effectiveness, which can be further implementedfor real time applications.