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

A conservative multiversion locking-graph scheduler algorithm

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

DOI10.1007/BF02945367zbMath0722.68034OpenAlexW2034835948MaRDI QIDQ756411

Baile Shi, Fang Chen

Publication date: 1991

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

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


zbMATH Keywords

concurrencylocking-graph schedularmultiversion database systems


Mathematics Subject Classification ID

Database theory (68P15) Deterministic scheduling theory in operations research (90B35)





Cites Work

  • Unnamed Item
  • Algorithmic aspects of multiversion concurrency control
  • Multi-version concurrency control scheme for a database system
  • Formal aspects of optimistic concurrency control in a multiple version database system
  • Multiversion concurrency control—theory and algorithms
  • On Concurrency Control by Multiple Versions




This page was built for publication: A conservative multiversion locking-graph scheduler algorithm

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