Reverse nearest neighbor search in peer-to-peer systems

Authors:
Dehua Chen;Jingjing Zhou;Jiajin Le
Affiliations:
Col. of Computer Science, University of Donghua, Shanghai, PRC;Col. of Computer Science, University of Donghua, Shanghai, PRC;Col. of Computer Science, University of Donghua, Shanghai, PRC
Venue:
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Year:
2006

Citing 26
Cited 1

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Influence sets based on reverse nearest neighbor queries

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Multidimensional binary search trees used for associative searching

Communications of the ACM
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
An Index Structure for Efficient Reverse Nearest Neighbor Queries

Proceedings of the 17th International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Discovery of Influence Sets in Frequently Updated Databases

Proceedings of the 27th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects

IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Peer-to-peer information retrieval using self-organizing semantic overlay networks

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Peer-to-Peer Spatial Queries in Sensor Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
High dimensional reverse nearest neighbor queries

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
A Peer-to-peer Framework for Caching Range Queries

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
On computing top-t most influential spatial sites

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
Reverse Nearest Neighbors Search in Ad-hoc Subspaces

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Reverse nearest neighbor aggregates over data streams

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Reverse kNN search in arbitrary dimensionality

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks

AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Adapting the content native space for load balanced indexing

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
CISS: an efficient object clustering framework for DHT-Based peer-to-peer applications

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

P2P-based multidimensional indexing methods: A survey

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a query point Q, a Reverse Nearest Neighbor (RNN) Query returns all points in the database having Q as their nearest neighbor. The problem of RNN query has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peer-to-Peer (P2P) systems. In this paper, we shall do pioneering work on supporting distributed RNN query in large distributed and dynamic P2P networks. Our proposed RNN query algorithms are based on a distributed multi-dimensional index structure, called P2PRdNN-tree, which is relying on a super-peer-based P2P overlay. The results of our performance evaluation with real spatial data sets show that our proposed algorithms are indeed practically feasible for answering distributed RNN query in P2P systems.