Abstract
While current search engines seem to easily handle the size of the data available on the Internet, they cannot provide fresh results. The most up-to-date data always resides on the data sources. Efficiently interconnecting data providers, however, is not an easy problem. Peer-to-peer computing is the latest technology to address this problem. However, efficient query processing in peer-to-peer networks remains an open research area. In this paper, we present a performance study of a system that facilitates efficient searches of large numbers of independent data providers on the Internet. In our scenario, each data provider becomes an autonomous node in a large peer-to-peer system. Using small indices on each node, we can efficiently direct queries submitted on any node to the relevant sources. Experiments with a large peer-to-peer network demonstrate the feasibility of our approach.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
BerkeleyDB. http://www.sleepycat.com .
R. Braumandl, M. Keidl, A. Kemper, D. Kossmann, A. Kreutz, S. Seltzsam, K. Stocker. ObjectGlobe: Ubiquitous query processing on the Internet. VLDB Journal 10(1): 48–71 (2001)
J. Callan, M. Connell, A. Du. Automatic Discovery of Language Models for Text Databases. SIGMOD 1999 Conference.
J. Chen, D. J. DeWitt, F. Tian, Y. Wang. NiagaraCQ: A Scalable Continuous Query System for Internet Databases. SIGMOD 2000 Conference.
A. Crespo, H. Garcia-Molina. Routing Indices For Peer-to-Peer Systems. Tech Report http://dbpubs.stanford.edu:8090/pub/2001-48
F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica. Wide-area cooperative storage with CFS. SOSP 2001
eBay. http://www.ebay.com
Gnutella Resources. http://gnutella.wego.com/ .
GoXML. http://www.goxml.com
Google. http://www.google.com
S. Gribble, A. Halevy, Z. Ives, M. Rodrig, D. Suciu. What Can Databases Do for Peer-to-Peer. WebDB Workshop 2001.
P.G. Ipeirotis, L. Gravano, M. Sahami. Probe, Count, and Classify: Categorizing Hidden-Web Databases. SIGMOD 2001 Conference.
J. Kubiatowicz et al. OceanStore: An Architecture for Global-Scale Persistent Storage. In Proc. ASPLOS 2000.
J.F. Naughton, D.J. DeWitt et al. The Niagara Internet Query System. IEEE Data Engineering Bulletin 24(2): 27–33(2001)
Napster. http://www.napster.com
B. Nguyen, S. Abiteboul, G. Cobena, M. Preda. Monitoring XML Data on the Web. SIGMOD 2001 Conference
OpenNap Project. http://opennap.sourceforge.net
M. T. Özsu, P. Valduriez. Principles of Distributed Database Systems, Second Edition. Prentice-Hall 1999
A. Rowstron, P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. SOSP 2001
A. R. Schmidt, F. Waas, M. L. Kersten, D. Florescu, I. Manolescu, M. J. Carey, R. Busse. The XML Benchmark Project. Technical Report INS-R0103, CWI, Amsterdam, The Netherlands, April 2001.
I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc. SIGCOMM 2001.
TPC-C Benchmark Standard Specification Revision 5.0.
S. Waterhouse. JXTA Search: Distributed Search for Distributed Networks. White Paper http://search.jxta.org
R. Williams, D. Daniels, L. Haas, G. Lapis, B. Linsey, P. Ng, R. Obermarck, P. Selinger, A. Walker, P. Wilms, R. Yost. R*: An Overview of the Architecture. IBM Research Report RJ3325.
XML Path Language (XPath) 2.0 http://www.w3.org/TR/xpath20/
B. Yang, H. Garcia-Molina. Efficient Search in peer-to-peer networks. In Proc. ICDCS 2002.
B. Yang, H. Garcia-Molina. Comparing Hybrid Peer-to-Peer Systems. In Proc. VLDB 2001.
B. Yang, H. Garcia-Molina. Designing a Super-Peer Network, In Proc. ICDE 2003.
C. Zhang, J.F. Naughton, D.J. DeWitt, Q. Luo, G. Lohman. On Supporting Containment Queries in Relational Database Management Systems. SIGMOD 2001 Conference.
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
Galanis, L., Wang, Y., Jeffery, S.R., DeWitt, D.J. (2003). Processing Queries in a Large Peer-to-Peer System. In: Eder, J., Missikoff, M. (eds) Advanced Information Systems Engineering. CAiSE 2003. Lecture Notes in Computer Science, vol 2681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45017-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-45017-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40442-2
Online ISBN: 978-3-540-45017-7
eBook Packages: Springer Book Archive