P2P systems with transactional semantics

Shyam Antony, Divyakant Agrawal, Amr El Abbadi

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

6 Citations (Scopus)

Abstract

Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalability and self-maintenance. We argue that such systems when augmented with well defined consistency semantics provide an attractive building block for many large scale data processing applications in cluster environments. Towards this end, we study the problem of providing transactional semantics to P-Ring a P2P system which supports efficient range queries. We first extend a commonly used replication protocol in P2P systems to provide well defined guarantees in the presence of concurrent updates and under well defined failure assumptions. A multi-version concurrency control protocol called LSTP which leverages the guarantees of the replication protocol to provide transactional semantics is proposed. LSTP is designed to provide useful consistency semantics over P-Ring for read intensive workloads without sacrificing the scalability and other desirable properties inherent to the system. Under LSTP, read-only transactions are abort-free and non-blocking and the index stores no state for such transactions. We show that LSTP ensures no missed dependencies between transactions and guarantees basic consistency for read-only transactions when update transactions are serializable. The design of LSTP and its provable properties is a proof of concept that P2P systems can be augmented with transactional semantics. Results from a preliminary simulation study are also presented.

Original languageEnglish
Title of host publicationAdvances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings
Pages4-15
Number of pages12
DOIs
Publication statusPublished - 16 May 2008
Externally publishedYes
Event11th International Conference on Extending Database Technology, EDBT 2008 - Nantes, France
Duration: 25 Mar 200829 Mar 2008

Other

Other11th International Conference on Extending Database Technology, EDBT 2008
CountryFrance
CityNantes
Period25/3/0829/3/08

Fingerprint

Semantics
Network protocols
Scalability
Concurrency control
Internet

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Antony, S., Agrawal, D., & El Abbadi, A. (2008). P2P systems with transactional semantics. In Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings (pp. 4-15) https://doi.org/10.1145/1353343.1353349

P2P systems with transactional semantics. / Antony, Shyam; Agrawal, Divyakant; El Abbadi, Amr.

Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings. 2008. p. 4-15.

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

Antony, S, Agrawal, D & El Abbadi, A 2008, P2P systems with transactional semantics. in Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings. pp. 4-15, 11th International Conference on Extending Database Technology, EDBT 2008, Nantes, France, 25/3/08. https://doi.org/10.1145/1353343.1353349
Antony S, Agrawal D, El Abbadi A. P2P systems with transactional semantics. In Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings. 2008. p. 4-15 https://doi.org/10.1145/1353343.1353349
Antony, Shyam ; Agrawal, Divyakant ; El Abbadi, Amr. / P2P systems with transactional semantics. Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings. 2008. pp. 4-15
@inproceedings{8e33e1ff15aa49e8b5ce6af71f0aefe1,
title = "P2P systems with transactional semantics",
abstract = "Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalability and self-maintenance. We argue that such systems when augmented with well defined consistency semantics provide an attractive building block for many large scale data processing applications in cluster environments. Towards this end, we study the problem of providing transactional semantics to P-Ring a P2P system which supports efficient range queries. We first extend a commonly used replication protocol in P2P systems to provide well defined guarantees in the presence of concurrent updates and under well defined failure assumptions. A multi-version concurrency control protocol called LSTP which leverages the guarantees of the replication protocol to provide transactional semantics is proposed. LSTP is designed to provide useful consistency semantics over P-Ring for read intensive workloads without sacrificing the scalability and other desirable properties inherent to the system. Under LSTP, read-only transactions are abort-free and non-blocking and the index stores no state for such transactions. We show that LSTP ensures no missed dependencies between transactions and guarantees basic consistency for read-only transactions when update transactions are serializable. The design of LSTP and its provable properties is a proof of concept that P2P systems can be augmented with transactional semantics. Results from a preliminary simulation study are also presented.",
author = "Shyam Antony and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2008",
month = "5",
day = "16",
doi = "10.1145/1353343.1353349",
language = "English",
isbn = "9781595939265",
pages = "4--15",
booktitle = "Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings",

}

TY - GEN

T1 - P2P systems with transactional semantics

AU - Antony, Shyam

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2008/5/16

Y1 - 2008/5/16

N2 - Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalability and self-maintenance. We argue that such systems when augmented with well defined consistency semantics provide an attractive building block for many large scale data processing applications in cluster environments. Towards this end, we study the problem of providing transactional semantics to P-Ring a P2P system which supports efficient range queries. We first extend a commonly used replication protocol in P2P systems to provide well defined guarantees in the presence of concurrent updates and under well defined failure assumptions. A multi-version concurrency control protocol called LSTP which leverages the guarantees of the replication protocol to provide transactional semantics is proposed. LSTP is designed to provide useful consistency semantics over P-Ring for read intensive workloads without sacrificing the scalability and other desirable properties inherent to the system. Under LSTP, read-only transactions are abort-free and non-blocking and the index stores no state for such transactions. We show that LSTP ensures no missed dependencies between transactions and guarantees basic consistency for read-only transactions when update transactions are serializable. The design of LSTP and its provable properties is a proof of concept that P2P systems can be augmented with transactional semantics. Results from a preliminary simulation study are also presented.

AB - Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalability and self-maintenance. We argue that such systems when augmented with well defined consistency semantics provide an attractive building block for many large scale data processing applications in cluster environments. Towards this end, we study the problem of providing transactional semantics to P-Ring a P2P system which supports efficient range queries. We first extend a commonly used replication protocol in P2P systems to provide well defined guarantees in the presence of concurrent updates and under well defined failure assumptions. A multi-version concurrency control protocol called LSTP which leverages the guarantees of the replication protocol to provide transactional semantics is proposed. LSTP is designed to provide useful consistency semantics over P-Ring for read intensive workloads without sacrificing the scalability and other desirable properties inherent to the system. Under LSTP, read-only transactions are abort-free and non-blocking and the index stores no state for such transactions. We show that LSTP ensures no missed dependencies between transactions and guarantees basic consistency for read-only transactions when update transactions are serializable. The design of LSTP and its provable properties is a proof of concept that P2P systems can be augmented with transactional semantics. Results from a preliminary simulation study are also presented.

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

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

U2 - 10.1145/1353343.1353349

DO - 10.1145/1353343.1353349

M3 - Conference contribution

SN - 9781595939265

SP - 4

EP - 15

BT - Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings

ER -