ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Efficient concurrency control for broadcast environments
Full text PdfPdf (1.58 MB)
Source International Conference on Management of Data archive
Proceedings of the 1999 ACM SIGMOD international conference on Management of data table of contents
Philadelphia, Pennsylvania, United States
Pages: 85 - 96  
Year of Publication: 1999
ISBN:1-58113-084-8
Also published in ...
Authors
Jayavel Shanmugasundaram  University of Wisconsin-Madison and University of Massachusetts, Amherst
Arvind Nithrakashyap  University of Massachusetts, Amherst
Rajendran Sivasankaran  University of Massachusetts, Amherst
Krithi Ramamritham  University of Massachusetts, Amherst and Indian Institute of Technology, Bombay
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 26,   Citation Count: 28
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

A crucial consideration in environments where data is broadcast to clients is the low bandwidth available for clients to communicate with servers. Advanced applications in such environments do need to read data that is mutually consistent as well as current. However, given the asymmetric communication capabilities and the needs of clients in mobile environments, traditional serializability-based approaches are too restrictive, unnecessary, and impractical. We thus propose the use of a weaker correctness criterion called update consistency and outline mechanisms based on this criterion that ensure (1) the mutual consistency of data maintained by the server and read by clients, and (2) the currency of data read by clients. Using these mechanisms, clients can obtain data that is current and mutually consistent “off the air”, i.e., without contacting the server to, say, obtain locks. Experimental results show a substantial reduction in response times as compared to existing (serializability-based) approaches. A further attractive feature of the approach is that if caching is possible at a client, weaker forms of currency can be obtained while still satisfying the mutual consistency of data.


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.

Ach95
 
Ach96
Alo90
 
Ber87
 
Bob92
 
Bob93
P.M. Bober and M.J. Carey. Multiversion Query Locking. Computer Science Technical Report TR 1160, University of Wisconsin-Madison, 1993.
Car91
 
Fra93
 
Guk96
Her87
Imi94
 
Kum97
Mol82
Oki93
 
Pap88
 
Pit99
 
Ram96
 
Sha99
J. Shanmugasundaram, et. al. Efficiellt Concurrency Control for Broadcast Environmqmts Univ. of Massachusetts Technical Report 199g.
 
She94
S. Shekar and D. Liu. Genesis and Advanced Traveler Information Systems (ATIS): Killer App}tications for Mobile Computing. MOBID.~.TA Workshop, New Jersey, 1994.
 
Vit
White Paper, http://www.vitria.com.
Wan91
 
Wei87
 
Wil90
 
Xua97

CITED BY  28

Collaborative Colleagues:
Jayavel Shanmugasundaram: colleagues
Arvind Nithrakashyap: colleagues
Rajendran Sivasankaran: colleagues
Krithi Ramamritham: colleagues