Guaranteeing correctness of lock-free range queries over P2P data

Stacy Patterson, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages123-134
Number of pages12
Volume4125 LNCS
Publication statusPublished - 1 Dec 2007
Externally publishedYes
EventInternational Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006 - Seoul, Korea, Republic of
Duration: 11 Sep 200611 Sep 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4125 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006
CountryKorea, Republic of
CitySeoul
Period11/9/0611/9/06

Fingerprint

Database Management Systems
Computer Communication Networks
Range Query
Correctness
P2P Systems
Query
Distributed Databases
Redistribution
Deletion
Insertion
caN protocol
Demonstrate

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Patterson, S., Agrawal, D., & El Abbadi, A. (2007). Guaranteeing correctness of lock-free range queries over P2P data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4125 LNCS, pp. 123-134). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4125 LNCS).

Guaranteeing correctness of lock-free range queries over P2P data. / Patterson, Stacy; Agrawal, Divyakant; El Abbadi, Amr.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4125 LNCS 2007. p. 123-134 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4125 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Patterson, S, Agrawal, D & El Abbadi, A 2007, Guaranteeing correctness of lock-free range queries over P2P data. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4125 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4125 LNCS, pp. 123-134, International Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006, Seoul, Korea, Republic of, 11/9/06.
Patterson S, Agrawal D, El Abbadi A. Guaranteeing correctness of lock-free range queries over P2P data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4125 LNCS. 2007. p. 123-134. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Patterson, Stacy ; Agrawal, Divyakant ; El Abbadi, Amr. / Guaranteeing correctness of lock-free range queries over P2P data. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4125 LNCS 2007. pp. 123-134 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2e69c37af6e44e348c99e5ccf73df151,
title = "Guaranteeing correctness of lock-free range queries over P2P data",
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.",
author = "Stacy Patterson and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540716600",
volume = "4125 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "123--134",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Guaranteeing correctness of lock-free range queries over P2P data

AU - Patterson, Stacy

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38149054108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149054108&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540716600

VL - 4125 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 123

EP - 134

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -