Abstract
Search engines are among the most important applications or services on the web. Most existing successful search engines use global ranking algorithms to generate the ranking of documents crawled in their databases. However, global ranking of documents has two potential problems: high computation cost and potentially poor rankings. Both of the problems are related to the centralized computation paradigm. We propose to decentralize the task of ranking. This requires two things: a decentralized architecture and a logical framework for ranking computation. In the paper we introduce a ranking algebra providing such a formal framework. Through partitioning and combining rankings, we manage to compute document rankings of large-scale web data sets in a localized fashion. We provide initial results, demonstrating that the use of such an approach can ameliorate the above-mentioned problems. The approach presents a step towards P2P Web search engines.1
The work presented in this paper was supported (in part) by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sergey Brin, Lawrence Page, “The Anatomy of a Large-Scale Hypertextual Web Search Engine”, 2000.
Larry Page, Sergey Brin, R. Motwani, T. Winograd, “The PageRank Citation Ranking: Bringing Order to the Web”, 1998.
Jon Kleinberg, “Authoritative Sources in a Hyperlinked Environment”, 1998.
Danny Sullivan, “New AllTheWeb.com Goes Live”, http://searchenginewatch.com/sereport/01/08-alltheweb.html, 2001.
Chris Sherman, “It’s Fresher at FAST”, http://www.searchenginewatch.com/searchday/01/sd0725-fast.html, 2001.
Mitch Wagner, “Google Bets The Farm On Linux”, http://www.internetwk.com/lead/lead060100.htm, 2000.
UC Berkeley SIMS, “How Much Information — Internet Summary”, http://www.sims.berkeley.edu/research/projects/how-much-info/internet.html, 2000.
Keith A. Baggerly, “Visual Estimation of Structure in Ranked Data”, PhD thesis, Rice University, 1995.
K. Bharat, M. R. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment”, in Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR), pages 104–111, Melbourne, Australia, August 1998. ACM Press, New York.
Danny Sullivan, “Google Adds More “Fresh” Pages, Changes Robots.txt & 403 Errors, Gains iWon”, http://searchenginewatch.com/sereport/02/08-google.html, Aug. 5, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aberer, K., Wu, J. (2003). A Framework for Decentralized Ranking in Web Information Retrieval. In: Zhou, X., Orlowska, M.E., Zhang, Y. (eds) Web Technologies and Applications. APWeb 2003. Lecture Notes in Computer Science, vol 2642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36901-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-36901-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-02354-8
Online ISBN: 978-3-540-36901-1
eBook Packages: Springer Book Archive