Skip to main content

A Three Level Search Engine Index Based in Query Log Distribution

  • Conference paper
String Processing and Information Retrieval (SPIRE 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2857))

Included in the following conference series:

Abstract

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.

We wish to thank the helpful comments of the reviewers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval, p. 513. ACM Press/Addison-Wesley, England (1999), http://sunsite.dcc.uchile.cl/irbook/

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeza-Yates, R., Saint-Jean, F. (2003). A Three Level Search Engine Index Based in Query Log Distribution. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds) String Processing and Information Retrieval. SPIRE 2003. Lecture Notes in Computer Science, vol 2857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39984-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39984-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20177-9

  • Online ISBN: 978-3-540-39984-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics