Answering constrained k-NN queries in unstructured P2P systems

Authors:
Bin Wang;Xiaochun Yang;Guoren Wang;Lei Chen;Sean X. Wang;Xuemin Lin;Ge Yu
Affiliations:
School of Information Sciences and Engineering, Northeastern University, China;School of Information Sciences and Engineering, Northeastern University, China;School of Information Sciences and Engineering, Northeastern University, China;Department of Computer Science, Hong Kong University of Science and Technology;Department of Computer Science, University of Vermont;School of Computer Sci. and Eng., The University of New South Wales, Australia;School of Information Sciences and Engineering, Northeastern University, China
Venue:
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Year:
2005

Citing 13
Cited 0

Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries

Proceedings of the 27th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
P-Grid: a self-organizing structured P2P system

ACM SIGMOD Record
Mercury: supporting scalable multi-attribute range queries

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
BATON: a balanced tree structure for peer-to-peer networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the system. In this paper, we investigate the problem of efficiently computing k-NN queries over unstructured P2P systems. We first propose a location-based domination model to determine a search space. We then present two types of probing strategies, radius-convergence and radius-expanding. A comprehensive performance study demonstrates that our techniques are efficient and scalable.