The design and analysis of spatial data structures
The design and analysis of spatial data structures
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Filter Trees for Managing Spatial Data over a Range of Size Granularities
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Depth-First K-Nearest Neighbor Finding Using the MaxNearestDist Estimator
ICIAP '03 Proceedings of the 12th International Conference on Image Analysis and Processing
Peer-to-Peer Spatial Queries in Sensor Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Content-based similarity search over peer-to-peer systems
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
A scalable nearest neighbor search in p2p systems
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
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing
IEEE Transactions on Computers
Ranking factors in peer-to-peer overlay networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
A distributed incremental nearest neighbor algorithm
Proceedings of the 2nd international conference on Scalable information systems
Distance browsing in distributed multimedia databases
Future Generation Computer Systems
P2P case storage and retrieval with an unspecified ontology
Artificial Intelligence Review
Semantic information retrieval in the COMPASS location system
UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
| Hi-index | 0.00 |
New Peer-to-Peer (P2P) applications like P2P job-employee seeker networks and P2P virtual cities, for application domains such as collaborative urban planning and forming virtual communities, are about to emerge. An important component in these applications is spatial data, i.e., data with locational components. Many requests initiated on spatial data involve finding the spatial objects that are nearest to a query location. In this paper, we propose an efficient algorithm that finds the spatial objects that are nearest to a given query location on a P2P network in the order of their minimum distance to the query point. The proposed algorithm makes use of a distributed spatial index that does not rely on the use of a central server. The algorithm is designed to be more efficient by utilizing the parallel nature of the P2P network. A demonstration of the proposed algorithm was implemented as a prototype P2P application that finds events and places of interest in a city.