A characterization of database graphs admitting a simple locking protocol

DOI10.1007/BF00289586MaRDI QIDQ1145494zbMATH OpenFDO

Authors Abraham Silberschatz, Zvi Kedem

Publication date 1981

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

deadlock-freedomdatabase graphslocking protocol

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Theory of operating systems (68N25)

Cites work

• scientific article; zbMATH DE number 3359777 (Why is no real title available?)
• Consistency in Hierarchical Database Systems
• The notions of consistency and predicate locks in a database system

Cited in

(1)

• Introduction to the theory of nested transactions

This page was built for publication: A characterization of database graphs admitting a simple locking protocol

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