A Three Level Search Engine Index Based in Query Log Distribution
- 520 Downloads
Queries to a search engine follow a power-law distribution, which is far from uniform. Hence, it is natural to adapt a search engine index to the query distribution. In this paper we present a three level memory organization for a search engine inverted file index that includes main and secondary memory, as well as precomputed answers, such that the use of main memory and the answer time are significantly improved. We include experimental results as well as an analytical model.
KeywordsMain Memory Answer Time Secondary Memory Inverted List Query Word
Unable to display preview. Download preview PDF.
- 2.Beeferman, D., Berger, A.: Agglomerative clustering of a search engine query log. In: Proceedings on the 2000 Conference on Knowledge Discovery and Data Mining, Boston, MA, August 2000, pp. 407–416 (2000)Google Scholar
- 3.Markatos, E.P.: On Caching Search Engine Query Results. In: Proceedings of the 5th International Web Caching and Content Delivery Workshop (May 2000)Google Scholar
- 4.Saraiva, P.C., de Moura, E.S., Ziviani, N., Meira, W., Fonseca, R., Ribeiro-Neto, B.: Rank-preserving two-level caching for scalable search engines. In: Proceedings of the 24th annual international ACM SIGIR on Research and development in information retrieval, New Orleans, LA, September 2001, pp. 51–58 (2001)Google Scholar
- 5.Silverstein, C., Henzinger, M., Marais, H., Moricz, M.: Analysis of a Very Large AltaVista Query Log. SIGIR Forum 33(3) (1999)Google Scholar
- 6.Spink, A., Jansen, B.J., Wolfram, D., Saracevic, T.: From E-Sex to E-Commerce: Web Search Changes. IEEE Computer 35(3), 107–109 (2002)Google Scholar
- 7.Xie, Y., O’Hallaron, D.: Locality in Search Engine Queries and Its Implications for Caching. In: Infocom 2002 (2002)Google Scholar
- 8.Zhang, D., Dong, Y.: A Novel Web Usage Mining Approach For Search Engine. Computer Networks (2003)Google Scholar
- 9.Zipf, G.: Selective Studies and the Principle of Relative Frequency in Language. Harvard University Press, Cambridge (1932)Google Scholar