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
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
pSearch: information retrieval in structured overlays
ACM SIGCOMM Computer Communication Review
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
In many distributed applications, each participating node can be characterized by one single set of attributes. The problem is to support complex queries, such as range and k-nearest-neighbor (KNN) queries, on this set of multidimensional attributes. Traditional peer-to-peer (P2P) systems either adopt an unstructured interconnection and use flooding to search for matching nodes, or implement a distributed hash table (DHT) to serve as a directory for indexing the attributes. The former suffers from excessive flooding traffic, while the latter has the overhead of updating and maintaining the directory. This paper introduces an attribute-based P2P interconnection strategy that uses the attributes to interconnect the peers instead of hash keys. Under the condition that each node is characterized by one set of attributes, the attribute-based networks can support range and KNN queries, guarantee lookup efficiency, and eliminate the need to maintain a directory.