Sciweavers

Share
CAISE
2003
Springer

Processing Queries in a Large Peer-to-Peer System

9 years 3 months ago
Processing Queries in a Large Peer-to-Peer System
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.
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, Dav
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where CAISE
Authors Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, David J. DeWitt
Comments (0)
books