Guaranteeing correctness of lock-free range queries over P2P data

Authors:
Stacy Patterson;Divyakant Agrawal;Amr El Abbadi
Affiliations:
Department of Computer Science, University of California Santa Barbara, Santa Barbara, CA;Department of Computer Science, University of California Santa Barbara, Santa Barbara, CA;Department of Computer Science, University of California Santa Barbara, Santa Barbara, CA
Venue:
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Year:
2005

Citing 10
Cited 1

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Wide-area cooperative storage with CFS

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
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
A Peer-to-peer Framework for Caching Range Queries

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Mercury: supporting scalable multi-attribute range queries

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Guaranteeing correctness and availability in P2P range indices

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Online balancing of range-partitioned data with applications to peer-to-peer systems

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Supporting asynchronous update for distributed data cubes

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

As P2P systems evolve into a platform for full-fledged distributed database management systems, the need arises for sophisticated query support and guarantees on query correctness.While there has been recent work addressing range queries in P2P systems, the work on query correctness is just beginning. Linga et al.[1] provided the first formal definition of correctness for range queries in P2P systems and described a lock-based range query technique that is provably correct. A natural question that arises is whether it is possible to develop a lock-free protocol that can meet the same guarantee of correctness. In this paper, we demonstrate the feasibility of lock-free correct protocols by first developing a simple, proof-of-concept query protocol and verifying that this protocol meets the correctness conditions. We then describe a more robust extended protocol and prove that for stable systems with only item insertions, item deletions, and item redistributions, this extension insures that every range query can be satisfied correctly.