ACM Home Page
Please provide us with feedback. Feedback
P2P systems with transactional semantics
Full text PdfPdf (266 KB)
Source ACM International Conference Proceeding Series; Vol. 261 archive
Proceedings of the 11th international conference on Extending database technology: Advances in database technology table of contents
Nantes, France
SESSION: Research sessions: P2P table of contents
Pages 4-15  
Year of Publication: 2008
ISBN:978-1-59593-926-5
Authors
Shyam Antony  University of California, Santa Barbara, CA
Divyakant Agrawal  University of California, Santa Barbara, CA
Amr El Abbadi  University of California, Santa Barbara, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 92,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1353343.1353349
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Amazon simple storage service. http://www.amazon.com/gp/browse.html?node=16427261.
 
3
4
5
 
6
7
 
8
9
 
10
F. Dabek. Cooperative File System. PhD thesis, Massachusetts Institute of Technology, September 2001.
11
 
12
 
13
Google alerts. http://www.google.com/alerts.
 
14
 
15
R. Huebsch, B. Chun, J. Hellerstein, B. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. Yumerefendi. The architecture of pier: an internet-scale query processor. In CIDR, 2005.
16
17
 
18
 
19
 
20
21
 
22
23
 
24
25
 
26
C. Türker, K. Haller, C. Schuler, and H. Schek. How can we support grid transactions? towards peer-to-peer transaction processing. In CIDR, 2005.
 
27

Collaborative Colleagues:
Shyam Antony: colleagues
Divyakant Agrawal: colleagues
Amr El Abbadi: colleagues