research-article

Reactive index replication for distributed search engines

Authors:

Flavio P. Junqueira,

Matthieu MorelAuthors Info & Claims

SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval

Pages 831 - 840

https://doi.org/10.1145/2348283.2348394

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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[5]

E. Brewer. Lessons from giant-scale services. Internet Computing, IEEE, 5(4):46--55, 2001.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[12]

F. J. Provost, T. Fawcett, and R. Kohavi. The case against accuracy estimation for comparing induction algorithms. In ICML, pages 445--453, 1998.

Digital Library

[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.

Digital Library

[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

Cambazoglu BBaeza-Yates R(2022)Scalability Challenges in Web Search EnginesundefinedOnline publication date: 10-Mar-2022
Blanco RCatena MTonellotto NBourdeau JHendler JNkambou RHorrocks IZhao B(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
Ghansah BWu S(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

Reactive index replication for distributed search engines
1. Information systems
  1. Information retrieval

Recommendations

Assigning documents to master sites in distributed search
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management

An appealing solution to scale Web search with the growth of the Internet is the use of distributed architectures. Distributed search engines rely on multiple sites deployed in distant regions across the world, where each site is specialized to serve ...
Branch replication scheme: A new model for data replication in large scale data grids

Data replication is a practical and effective method to achieve efficient and fault-tolerant data access in grids. Traditionally, data replication schemes maintain an entire replica in each site where a file is replicated, providing a read-only model. ...
Overlap Among Major Web Search Engines
ITNG '06: Proceedings of the Third International Conference on Information Technology: New Generations

Our study examined the overlap among results retrieved by three major Web search engines for a large set of more than 10,316 queries. Previous smaller studies have discussed the lack of overlap in results returned by Web search engines for the same ...

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

General Chair:
William Hersh
Oregon Health & Science University, USA
,
Program Chairs:
Jamie Callan
Carnegie Mellon University, USA
,
Yoelle Maarek
Yahoo! Research, Israel
,
Mark Sanderson
Royal Melbourne Institute of Technology, Australia

Copyright © 2012 ACM.

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

SIGIR: ACM Special Interest Group on Information Retrieval

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGIR '12

Sponsor:

SIGIR

SIGIR '12: The 35th International ACM SIGIR conference on research and development in Information Retrieval

August 12 - 16, 2012

Oregon, Portland, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
352
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cambazoglu BBaeza-Yates R(2022)Scalability Challenges in Web Search EnginesundefinedOnline publication date: 10-Mar-2022
Blanco RCatena MTonellotto NBourdeau JHendler JNkambou RHorrocks IZhao B(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
Ghansah BWu S(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
Teymorian AFrieder OMaloof MHe QIyengar ANejdl WPei JRastogi R(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

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten