article

Hybrid concurrency control for abstract data types

Authors:

Maurice P. Herlihy,

William E. WeihlAuthors Info & Claims

Journal of Computer and System Sciences, Volume 43, Issue 1

Pages 25 - 61

https://doi.org/10.1016/0022-0000(91)90031-Y

Published: 01 August 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Hegner S(2010)A model of independence and overlap for transactions on database schemataProceedings of the 14th east European conference on Advances in databases and information systems10.5555/1885872.1885891(204-218)Online publication date: 20-Sep-2010
https://dl.acm.org/doi/10.5555/1885872.1885891
Ray I(2005)Applying Semantic Knowledge to Real-Time Update of Access Control PoliciesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2005.8817:6(844-858)Online publication date: 1-Jun-2005
https://dl.acm.org/doi/10.1109/TKDE.2005.88
Ray I(2004)Real-time update of access control policiesData & Knowledge Engineering10.1016/j.datak.2003.09.00349:3(287-309)Online publication date: 1-Jun-2004
https://dl.acm.org/doi/10.1016/j.datak.2003.09.003
Show More Cited By

Index Terms

Hybrid concurrency control for abstract data types

Recommendations

Adaptable concurrency control for atomic data types

In many distributed systems concurrent access is required to a shared object, where abstract object servers may incorporate type-specific properties to define consistency requirements. Each operation and its outcome is treated as an event, and conflicts ...
Hybrid concurrency control for abstract data types
PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

We define a new locking protocol that permits more concurrency than existing commutativity-based protocols. The protocol uses timestamps generated when transactions commit to provide more information about the serialization order of transactions, and ...
Commutativity-Based Concurrency Control for Abstract Data Types

Two novel concurrency algorithms for abstract data types are presented that ensure serializability of transactions. It is proved that both algorithms ensure a local atomicity property called dynamic atomicity. The algorithms are quite general, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences

Journal of Computer and System Sciences Volume 43, Issue 1

Aug. 1991

266 pages

ISSN:0022-0000

Editor:
E. K. Blum
Univ. of Southern California, Los Angeles

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 August 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hegner S(2010)A model of independence and overlap for transactions on database schemataProceedings of the 14th east European conference on Advances in databases and information systems10.5555/1885872.1885891(204-218)Online publication date: 20-Sep-2010
Ray I(2005)Applying Semantic Knowledge to Real-Time Update of Access Control PoliciesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2005.8817:6(844-858)Online publication date: 1-Jun-2005
Ray I(2004)Real-time update of access control policiesData & Knowledge Engineering10.1016/j.datak.2003.09.00349:3(287-309)Online publication date: 1-Jun-2004
Weikum GVossen G(2001)Transactional Information SystemsundefinedOnline publication date: 30-May-2001
Pires PBenevides MMattoso MBryant B(2000)Mechanisms for specifying communication behavior in object oriented database systemsProceedings of the 2000 ACM symposium on Applied computing - Volume 110.1145/335603.335847(389-397)Online publication date: 19-Mar-2000
Arpinar ÏHalici UArpinar SDoğaç A(1999)Formalization of Workflows and Correctness Issues in the Presence of ConcurrencyDistributed and Parallel Databases10.1023/A:10087586122917:2(199-248)Online publication date: 1-Apr-1999
Ammann PJajodia SRay I(1997)Applying formal methods to semantic-based decomposition of transactionsACM Transactions on Database Systems10.1145/249978.24998122:2(215-254)Online publication date: 1-Jun-1997
Wong MAgrawal DMak H(1997)Bounded Inconsistency for Type-Specific Concurrency ControlDistributed and Parallel Databases10.1023/A:10086229219175:1(31-75)Online publication date: 1-Jan-1997
Wong MHull R(1996)Recovery for transaction failures in object-based databasesProceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/237661.237703(139-149)Online publication date: 3-Jun-1996
Yannakakis M(1996)Perspectives on database theoryACM SIGACT News10.1145/235666.23567027:3(25-49)Online publication date: 1-Sep-1996
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Adaptable concurrency control for atomic data types

Hybrid concurrency control for abstract data types

Commutativity-Based Concurrency Control for Abstract Data Types

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations