Skip to main content
Springer Nature Link
Log in

A Popularity-Driven Caching Scheme for Meta-search Engines: An Empirical Study+

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2001)

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

Included in the following conference series:

  • 536 Accesses

Abstract

Caching issues in meta-search engines are considered. We propose a popularity-driven cache algorithm that utilizes both popularities and reference counters of queries to determine cache data to be purged. We show how to calculate query popularity. Empirical evaluations and performance comparisons of popularity-driven caching with the least recently used (LRU) and least frequently used (LFU) schemes have been carried out on collections of real data. In almost all cases, the proposed replacement policy outperforms LRU and LFU.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 85.59
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 105.49
Price includes VAT (France)
  • 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.

Similar content being viewed by others

References

  1. J. Cheong, and S. Lee: A Boolean Query Processing with a Result Cache in Mediator Systems, Proceedings of Advances in Digital Libraries, IEEE (2000), 218–227

    Google Scholar 

  2. B. Chidlovskii, C. Roncancio, and M. Schneider: Semantic Cache Mechanism for Heterogeneous Web Querying, WWW8 (1999), 1347–1360

    Google Scholar 

  3. S. Dar, M. Franklin, B. Jonsson, D. Srivastava, and M. Tan: Semantic Data Caching and Replacement, Proceedings of the 22nd VLDB Conference (1996), 330–341

    Google Scholar 

  4. T. Johnson, and D. Shasha: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm, Proceedings of the 20th International Conference on VLDB (1994), 439–450

    Google Scholar 

  5. S. Lawrence, and C. Giles: Accessibility of Information on the Web, Nature, 400 (1999), 107–109

    Article  Google Scholar 

  6. D. Lee, and W. Chu: Semantic Caching via Query Matching for Web Sources, Proceedings of the 8th International Conference on Information Knowledge Management (1999), 77–85

    Google Scholar 

  7. E. O’Neil, P. O’Neil, and G. Weikum: The LRU-K Page Replacement Algorithm for Database Disk Buffering, Proceedings of the ACM SIGMOD (1993), 297–306

    Google Scholar 

  8. J. Robinson, and M. Devarakonda: Data Cache Management Using Frequency-Based Replacement, Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (1990), 134–142

    Google Scholar 

  9. Scime, and L. Kerschberg: WebSifter: An Ontology-based Personalizable Search Agent for the Web, Proceedings of the International Conference on Digital Libraries, Research and Practice (2000), 439–446

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Soongsil University, Korea

    Sang Ho Lee & Jin Seon Hong

  2. E-Center for E-Business, Department of Information and Software Engineering, George Mason University, USA

    Larry Kerschberg

Authors
  1. Sang Ho Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin Seon Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Larry Kerschberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Klagenfurt, IFI -IWAS Universitaetsstr. 65, 9020, Klagenfurt, Austria

    Heinrich C. Mayr

  2. Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague 6, Czech Republic

    Jiri Lazansky

  3. School of Computer and Information Science, University of South Australia, Mawson Lakes Campus, Mawson Lakes, SA, 5095

    Gerald Quirchmayr

  4. Department of Information Systems, Technical University of Munich, Orleanstr. 34, 81667, Munich, Germany

    Pavel Vogel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, S.H., Hong, J.S., Kerschberg, L. (2001). A Popularity-Driven Caching Scheme for Meta-search Engines: An Empirical Study+. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_85

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_85

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

  • Online ISBN: 978-3-540-44759-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation