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
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
GeoPeer: A Location-Aware Peer-to-Peer System
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
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 study for the parameters of a distributed framework that handles spatial areas
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
PRoBe: multi-dimensional range queries in p2p networks
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
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
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Handling spatial data in distributed environments is an intriguing issue. We consider autonomous sites of an overlay network that are bound to specific spatial information. We assume that each site has partial knowledge of the overlay. Actually, the sites are aware of and can communicate with some other sites, according to the spatial data to which they are bound to. We are interested in routing queries about spatial data in such overlays, solely by exploiting local knowledge on sites, i.e. based on locality and directionality in space. For such a system, we explore the parameters that can make search for any spatial information realizable and efficient. In this work we focus on the management of grid-partitioned space. In such a system there is a necessity for a mechanism that provides even knowledge of space to each site of the overlay. We investigate two different ways to define the directions of grid knowledge on each site and we propose a new distance metric. Moreover, we consider a new locality function that is specifically constructed in order to achieve even knowledge of space towards all directions. Furthermore, we present an experimental study that evaluates the theoretical propositions and verifies the theoretical results.