Transparent Gif

Department of Computer Science

University of California, Santa Barbara

Abstract

Approximate Range Selection Queries in Peer-to-Peer Systems

by: Abhishek Gupta, Divyakant Agrawal, and Amr El Abbadi

Abstract:

We present an architecture for a data sharing peer-to-peer system where thedata is shared in the form of database relations. In general, peer-to-peersystems try to locate exact-match data objects to simple user queries. Sincepeer-to-peer users generally tend to submit broad queries in order to finddata of their interest, we develop a P2P data sharing architecture for computing approximate answers for the complex queries by finding data rangesthat are similar to the user query. Thus this paper represents the first steptowards solving the general range lookup problem over P2P systems instead ofexact lookup operations.

Keywords:

Peer-to-Peer Systems, Distributed Databases, Distributed Querying

Date:

August 2002

Document: 2002-23

XHTML Validation | CSS Validation
Updated 14-Nov-2005
Questions should be directed to: webmaster@cs.ucsb.edu