LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The interpolation-based grid file
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD 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
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th 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
ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
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
Agents and peer-to-peer computing: a promising combination of paradigms
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Proceedings of the 4th ACM international workshop on Data engineering for wireless and mobile access
Privacy-preserving agent-based distributed data clustering
Web Intelligence and Agent Systems
Scalable multi-dimensional range queries and routing in data-centric sensor networks
Proceedings of the 3rd international conference on Scalable information systems
Multi-dimensional data density estimation in P2P networks
Distributed and Parallel Databases
Distributed data clustering in multi-dimensional peer-to-peer networks
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 0.00 |
Peer-to-Peer (P2P) technologies promise to provide efficient distribution, sharing and management of resources, such as storage, processing, routing and other sundry service capabilities, over autonomous and heterogeneous peers. Yet, most current P2P systems only support rudimentary query and content routing over a single data attribute, such as the file-sharing applications popularized in Napster, Gnutella and so forth. Full-fledged applications in distributed data management and grid computing demand more complex functionality, including querying and content routing over multiple attributes. In this paper we present a class of scalable and self-organizing multi-dimensional distributed data structures able to efficiently perform range queries in totally decentralized dynamic P2P environments. These structures are not imposed a priori over the network of peers. Rather, they emerge from the independent interactions of autonomous peers. They are also adaptive to unanticipated changes in the network topology. This robustness property expands their range of usefulness to many application areas such as mobile ad-hoc networks.