Search engine indexing storage optimisation using Hamming distance
by Anirban Kundu; Siddhartha Sett; Subhajit Kumar; Shruti Sengupta; Srayan Chaudhury
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 6, No. 2, 2012

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.

Online publication date: Sat, 16-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com