&lt;title&gt;Query routing in the TerraDir distributed directory&lt;/title&gt;

Silaghi, Bujor D.; Bhattacharjee, Samrat; Keleher, Peter J.

doi:10.1117/12.475281

Cited by 15 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TerraDir [SBK02] is a recent system that provides locality and maintains a hierarchical data structure using caching and replication. There are as yet no provable guarantees on load balancing and fault tolerance for this system.…”

Section: Introductionmentioning

confidence: 99%

Skip graphs

Aspnes

Shah

2007

ACM Trans. Algorithms

390

435

View full text Add to dashboard Cite

Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer systems, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality. Unlike skip lists or other tree data structures, skip graphs are highly resilient, tolerating a large fraction of failed nodes without losing connectivity. In addition, constructing, inserting new nodes into, searching a skip graph, and detecting and repairing errors in the data structure introduced by node failures can be done using simple and straightforward algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%

Skip graphs

Aspnes

Shah

2007

ACM Trans. Algorithms

390

435

View full text Add to dashboard Cite

show abstract

“…From the requirement of a prior semantic hierarchy, PSON is quite similar to some hierarchical directory service systems such as DNS [11,12] and TerraDir [19,20]. DNS is one of the most important services widely deployed in the Internet.…”

Section: Hierarchical Directory Service Systemsmentioning

confidence: 99%

PSON: A scalable P2P file sharing system with efficient complex query support

Ahuja²,

Lao

et al. 2010

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

A desired P2P file sharing system is expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose a powerful P2P file sharing system, PSON, which can satisfy all the three desired properties. PSON is essentially a semantic overlay network of logical nodes. Each logical node represents a cluster of peers that are close to each other. A powerful peer is selected in each cluster to support query routing on the overlay network while the less powerful peers are responsible for the maintenance of shared contents. To facilitate query routing, super peers are organized in form of a balanced binary search tree. By exploiting the concept of semantics, PSON can support complex queries in a scalable and efficient way. In this paper, we present the basic system design such as the semantic overlay construction, query routing and system dynamics. A load balancing scheme is proposed to further enhance the system performance. By simulation experiments, we show that PSON is scalable, efficient and is able to support complex queries.

show abstract

“…TerraDir [20] is a tree-based structured P2P system. It organizes nodes in a hierarchical fashion according to the underlying data hierarchy.…”

Section: Related Workmentioning

confidence: 99%

MAAN: A Multi-Attribute Addressable Network for Grid Information Services

et al. 2004

View full text Add to dashboard Cite

Recent structured Peer-to-Peer (P2P) systems such as Distributed Hash Tables (DHTs) offer scalable key-based lookup for distributed resources. However, they cannot be simply applied to grid information services because grid resources need to be registered and searched using multiple attributes. This paper proposes a Multi-Attribute Addressable Network (MAAN) that extends Chord to support multi-attribute and range queries. MAAN addresses range queries by mapping attribute values to the Chord identifier space via uniform locality preserving hashing. It uses an iterative or single attribute dominated query routing algorithm to resolve multi-attribute based queries. Each node in MAAN only has O(log N) neighbors for N nodes. The number of routing hops to resolve a multiattribute range query is O(log N + N × s min ), where s min is the minimum range selectivity on all attributes. When s min = ε, it is logarithmic to the number of nodes, which is scalable to a large number of nodes and attributes. We also measured the performance of our MAAN implementation and the experimental results are consistent with our theoretical analysis.

show abstract

<title>Query routing in the TerraDir distributed directory</title>

Cited by 15 publications

References 8 publications

Skip graphs

Skip graphs

PSON: A scalable P2P file sharing system with efficient complex query support

MAAN: A Multi-Attribute Addressable Network for Grid Information Services

Contact Info

Product

Resources

About