Relative serializability: An approach for relaxing the atomicity of transactions

DOI10.1006/JCSS.1997.1527zbMATH Open0887.68026OpenAlexW2037438990MaRDI QIDQ1376414FDOQ1376414

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

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

zbMATH Keywords

serializability

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• The serializability of concurrent database updates
• The notions of consistency and predicate locks in a database system
• Formal Aspects of Serializability in Database Concurrency Control
• Locking Primitives in a Database System
• Multilevel atomicity—a new correctness criterion for database concurrency control
• Using semantic knowledge for transaction processing in a distributed database

Cited In (4)

• Relaxing consistency requirement for read-only transactions
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)