Relative serializability: An approach for relaxing the atomicity of transactions

DOI10.1006/JCSS.1997.1527MaRDI QIDQ1376414zbMATH OpenOpenAlexFDO

Authors Vasudha Krishnaswamy, Divyakant Agrawal, John Bruno, Amr El Abbadi

Publication date 1 June 1998

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1997.1527

zbMATH Keywords

serializability

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Semantic serializability: A correctness criterion for processing transactions in advanced database applications
• On relaxing serializability by constraining transaction readsets
• Conceptual level concurrency control of relational update transactions
• On serializability

Cites work

• scientific article; zbMATH DE number 3986679 (Why is no real title available?)
• Formal Aspects of Serializability in Database Concurrency Control
• Locking Primitives in a Database System
• Multilevel atomicity—a new correctness criterion for database concurrency control
• The notions of consistency and predicate locks in a database system
• The serializability of concurrent database updates
• Using semantic knowledge for transaction processing in a distributed database

Cited in

(6)

• Relaxing consistency requirement for read-only transactions
• scientific article; zbMATH DE number 2001223 (Why is no real title available?)
• Tolerant constraint-preserving snapshot isolation: extended concurrency for interactive transactions
• Reducing conflict graph of multi-step transactions accessing ordered data with gaps
• scientific article; zbMATH DE number 3896285 (Why is no real title available?)
• On relaxing serializability by constraining transaction readsets

This page was built for publication: Relative serializability: An approach for relaxing the atomicity of transactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376414)