Shifting timestamps for concurrency control in an information hierarchy

DOI10.1016/0020-0190(88)90216-5zbMATH Open0652.68021OpenAlexW2079305213MaRDI QIDQ1107300FDOQ1107300

Authors: Meichun Hsu, Stuart E. Madnick 

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90216-5

zbMATH Keywords

databaseacyclicityconcurrency controlinformation hierarchytimestamp algorithm

Mathematics Subject Classification ID

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

Cites Work

• The notions of consistency and predicate locks in a database system
• Concurrency of operations on B-trees
• Multiversion concurrency control—theory and algorithms
• On Concurrency Control by Multiple Versions
• Consistency in Hierarchical Database Systems
• Locking Protocols

Cited In (1)

• A graph transformation algorithm for concurrency control in a partitioned database

This page was built for publication: Shifting timestamps for concurrency control in an information hierarchy

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