Search engine indexing storage optimisation using Hamming distance. (1st January 2012)

• Record Type: Journal Article
• Authors: Kundu, Anirban; Sett, Siddhartha; Kumar, Subhajit; Sengupta, Shruti; Chaudhury, Srayan
• Is Part Of: International journal of intelligent information and database systems. Volume 6:Number 2(2012)
• Page Start: 113
• Page End: 128
• Publication Date: 2012-01-01
• Subjects: search engine -- forward indexing -- inverted indexing -- Hamming distance -- indexing storage minimisation; Database management -- Computer programs -- Periodicals; Information retrieval -- Computer programs -- Periodicals; Information storage and retrieval systems -- Computer programs -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligent agents (Computer software) -- Periodicals; 006.33
• Languages: English
• ISSNs: 1751-5858

Abstract

We are going to propose indexing algorithm of search engine aiming to decrease time and space complexity. Existing indexing algorithms have greater space requirements due to the fact that all the words of the web pages are being stored except the stop words. In this paper, we present a theory on indexing mechanism of a search engine. Time complexity is the time taken by the search engine to retrieve information and space complexity is the space required to store the indices in the hard disk. Decreasing the time complexity will lead to faster retrieval of information and decreasing the space complexity leads to efficient utilisation of space. We have only dealt with textual part of the web pages. Hamming distance concept frames approach to achieve better result in space complexity.