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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Galanis, L., Wang, Y., Jeffery, S. R., & DeWitt, D. J. (2003). Processing queries in a large peer-to-peer system. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2681, 273–288. https://doi.org/10.1007/3-540-45017-3_20
Mendeley helps you to discover research relevant for your work.