Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A characterization of database graphs admitting a simple locking protocol

From MaRDI portal
Publication:1145494
Jump to:navigation, search

DOI10.1007/BF00289586zbMath0445.68019MaRDI QIDQ1145494

Abraham Silberschatz, Zvi M. Kedem

Publication date: 1981

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


zbMATH Keywords

deadlock-freedomdatabase graphslocking protocol


Mathematics Subject Classification ID

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


Related Items (1)

Introduction to the theory of nested transactions



Cites Work

  • Unnamed Item
  • Consistency in Hierarchical Database Systems
  • The notions of consistency and predicate locks in a database system


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1145494&oldid=13201273"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki