skip to main content
10.1145/2348283.2348394acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
research-article

Reactive index replication for distributed search engines

Published: 12 August 2012 Publication History

Abstract

Distributed search engines comprise multiple sites deployed across geographically distant regions, each site being specialized to serve the queries of local users. When a search site cannot accurately compute the results of a query, it must forward the query to other sites. This paper considers the problem of selecting the documents indexed by each site focusing on replication to increase the fraction of queries processed locally. We propose RIP, an algorithm for replicating documents and posting lists that is practical and has two important features. RIP evaluates user interests in an online fashion and uses only local data of a site. Being an online approach simplifies the operational complexity, while locality enables higher performance when processing queries and documents. The decision procedure, on top of being online and local, incorporates document popularity and user queries, which is critical when assuming a replication budget for each site. Having a replication budget reflects the hardware constraints of any given site. We evaluate RIP against the approach of replicating popular documents statically, and show that we achieve significant gains, while having the additional benefit of supporting incremental indexes.

References

[1]
R. Baeza-Yates, A. Gionis, F. Junqueira, V. Murdock, V. Plachouras, and F. Silvestri. The impact of caching on search engines. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 183--190, 2007.
[2]
R. Baeza-Yates, A. Gionis, F. Junqueira, V. Plachouras, and L. Telloli. On the feasibility of multi-site web search engines. In Proceedings of the 18th ACM Conference on Information and Knowledge Management, pages 425--434, 2009.
[3]
R. Blanco, B. B. Cambazoglu, F. P. Junqueira, I. Kelly, and V. Leroy. Assigning documents to master sites in distributed search. In Proceedings of the 20th ACM Conference on Information and Knowledge Management, pages 67--76, 2011.
[4]
U. Brefeld, B. B. Cambazoglu, and F. P. Junqueira. Document assignment in multi-site search engines. In Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pages 575--584, 2011.
[5]
E. Brewer. Lessons from giant-scale services. Internet Computing, IEEE, 5(4):46--55, 2001.
[6]
B. B. Cambazoglu, V. Plachouras, and R. Baeza-Yates. Quantifying performance and quality gains in distributed web search engines. In Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 411--418, 2009.
[7]
B. B. Cambazoglu, V. Plachouras, F. Junqueira, and L. Telloli. On the feasibility of geographically distributed web crawling. In Proceedings of the 3rd International Conference on Scalable Information Systems, pages 31:1--31:10, 2008.
[8]
B. B. Cambazoglu, E. Varol, E. Kayaaslan, C. Aykanat, and R. Baeza-Yates. Query forwarding in geographically distributed search engines. In Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 90--97, 2010.
[9]
B. B. Cambazoglu, H. Zaragoza, O. Chapelle, J. Chen, C. Liao, Z. Zheng, and J. Degenhardt. Early exit optimizations for additive machine learned ranking systems. In Proceedings of the third ACM international conference on Web search and data mining, pages 411--420, 2010.
[10]
S. Ding and T. Suel. Faster top-k document retrieval using block-max indexes. In Proceedings of the 34nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 993--1002, 2011.
[11]
I. Ilyas, G. Beskales, and M. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys (CSUR), 40(4):11, 2008.
[12]
F. J. Provost, T. Fawcett, and R. Kohavi. The case against accuracy estimation for comparing induction algorithms. In ICML, pages 445--453, 1998.
[13]
I. Tatarinov. An efficient LFU-like policy for Web caches. Technical report, Computer Science Department, North Dakota State University, 1998.
[14]
S. Tatikonda, B. Cambazoglu, and F. Junqueira. Posting list intersection on multicore architectures. In Proceedings of the 34th international ACM SIGIR conference on Research and development in Information, pages 963--972, 2011.
[15]
J. Zhang and T. Suel. Optimized inverted list assignment in distributed search engine architectures. In Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International, pages 1--10. IEEE, 2007.

Cited By

View all
  • (2022)Scalability Challenges in Web Search EnginesundefinedOnline publication date: 10-Mar-2022
  • (2016)Exploiting Green Energy to Reduce the Operational Costs of Multi-Center Web Search EnginesProceedings of the 25th International Conference on World Wide Web10.1145/2872427.2883021(1237-1247)Online publication date: 11-Apr-2016
  • (2015)Distributed Information Retrieval: Developments and StrategiesInternational Journal of Engineering Research in Africa10.4028/www.scientific.net/JERA.16.11016(110-144)Online publication date: 22-Jun-2015
  • Show More Cited By

Index Terms

  1. Reactive index replication for distributed search engines

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
    August 2012
    1236 pages
    ISBN:9781450314725
    DOI:10.1145/2348283
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 August 2012

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. distributed index
    2. multi-site web search engine
    3. replication

    Qualifiers

    • Research-article

    Conference

    SIGIR '12
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 792 of 3,983 submissions, 20%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 25 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Scalability Challenges in Web Search EnginesundefinedOnline publication date: 10-Mar-2022
    • (2016)Exploiting Green Energy to Reduce the Operational Costs of Multi-Center Web Search EnginesProceedings of the 25th International Conference on World Wide Web10.1145/2872427.2883021(1237-1247)Online publication date: 11-Apr-2016
    • (2015)Distributed Information Retrieval: Developments and StrategiesInternational Journal of Engineering Research in Africa10.4028/www.scientific.net/JERA.16.11016(110-144)Online publication date: 22-Jun-2015
    • (2013)Rank-energy selective query forwarding for distributed search systemsProceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2505710(389-398)Online publication date: 27-Oct-2013

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media