On the complexity of concurrency control using semantic information

DOI10.1007/BF01178262zbMath0826.68039OpenAlexW4252355038MaRDI QIDQ1892718

John L. Bruno, Vasudha Krishnaswamy

Publication date: 27 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01178262

zbMATH Keywords

conflict-correct schedules

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55)

Cites Work

• Unnamed Item
• Unnamed Item
• General purpose schedulers for database systems
• Multilevel atomicity—a new correctness criterion for database concurrency control
• The serializability of concurrent database updates
• The notions of consistency and predicate locks in a database system
• Using semantic knowledge for transaction processing in a distributed database

This page was built for publication: On the complexity of concurrency control using semantic information