Guaranteeing correctness and availability in P2P range indices

Linga, Prakash; Crainiceanu, Adina; Gehrke, Johannes; Shanmugasudaram, Jayavel

doi:10.1145/1066157.1066195

Cited by 16 publications

(19 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section presents our algorithms for handling data skew. All our algorithms guarantee correctness in face of concurrent operations, as we can apply the techniques introduced by Linga et al [2005].…”

Section: P-ring Data Storementioning

confidence: 99%

Load Balancing and Range Queries in P2P Systems Using P-Ring

Crainiceanu

Linga²,

Machanavajjhala

et al. 2011

ACM Trans. Internet Technol.

Self Cite

View full text Add to dashboard Cite

In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems make them appealing to a wide range of applications.This paper introduces P-Ring, a new peer-to-peer index structure. P-Ring is fully distributed, faulttolerant, provides load balancing and logarithmic search performance, while supporting both equality and range queries. Our theoretical analysis as well as experimental results obtained both in a simulated environment and on PlanetLab, show the performance of our system.

show abstract

Section: P-ring Data Storementioning

confidence: 99%

Load Balancing and Range Queries in P2P Systems Using P-Ring

Crainiceanu

Linga²,

Machanavajjhala

et al. 2011

ACM Trans. Internet Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our network model is semi-synchronous (falls between asynchronous and synchronous model), similar to the ones proposed in [1] [12][13] and we assume no network partitions.…”

Section: A Main Concepts and Assumptionsmentioning

confidence: 99%

Scalable P2P Reconciliation Infrastructure for Collaborative Text Editing

Tlili

Akbarinia

Pacitti

et al. 2010

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications

View full text Add to dashboard Cite

We address the problem of optimistic replication for collaborative text editing in Peer-to-Peer (P2P) systems. This problem is challenging because of concurrent updating at multiple peers and dynamic behavior of peers. Operational transformation (OT) is a typical approach used for handling optimistic replication in the context of distributed text editing. However, most of OT solutions are neither scalable nor suited for P2P networks due to the dynamic behavior of peers. In this paper, we propose a scalable P2P reconciliation infrastructure for OT that assures eventual consistency and liveness despite dynamicity and failures. We propose a P2P logging and timestamping service called P2P-LTR (P2P Logging and Timestamping for Reconciliation) which exploits a distributed hash table (DHT) for reconciliation. While updating replica copies at collaborating peer editors, updates are stored in a highly available P2P log. To enforce eventual consistency, these updates must be retrieved in a specific total order to be reconciled at the peer editors. P2P-LTR provides an efficient mechanism for determining the total order of updates. It also deals with the case of peers that may join and leave the system during the update operation. We evaluated the performance of P2P-LTR through simulation; the results show the efficiency and the scalability of our solution.

show abstract

“…This scheme has been the only one considered in some works on range queries when comparing with the skip graph structure [28,29]. The sequential search has a cost of O(r) messages and hops, where r is the number of nodes in the interval.…”

Section: Skip Graph Schemesmentioning

confidence: 99%

“…As regards concurrency issues related to guaranteeing the correctness of the range-query results, Linga et al [28] have developed techniques to guarantee accuracy and availability of P2P range indices. Their work only considers that the range search is performed sequentially, by finding the lower bound and then scanning along the bottom list to retrieve the items in the range [28], with skip graph being one of their examples.…”

Section: Lemma 4 the Expected Value Of Cmentioning

confidence: 99%

“…Their work only considers that the range search is performed sequentially, by finding the lower bound and then scanning along the bottom list to retrieve the items in the range [28], with skip graph being one of their examples. Their analysis focuses on maintaining consistency of the bottom level and adapting to changes in the ranges maintained by the peers.…”

Section: Lemma 4 the Expected Value Of Cmentioning

confidence: 99%

See 1 more Smart Citation