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
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
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
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
Handling spatial data in distributed environments
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
| Hi-index | 0.00 |
In this work we study the construction of a framework for autonomous sites that are bound to spatial information and that form an overlay network; we investigate the parameters of such a distributed system in order to perform search guided by locality and directionality in space. We present the main parameters of the framework and propose appropriate values for them. A theoretical study discusses the overall search efficiency limits for two approaches concerning the main framework parameter, i.e. the distance metric. Furthermore, the behavior of the rest of the framework parameters is examined based on an experimental study.