Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
From MaRDI portal
(Redirected from Publication:1823735)
Recommendations
- scientific article; zbMATH DE number 3961017
- Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access)
- Performance comparison of database concurrency control mechanisms based on two-phase locking, timestamping, and mixed approach
- Problems in transaction concurrency control algorithms
- Multiversion concurrency control—theory and algorithms
Cites work
- scientific article; zbMATH DE number 3652066 (Why is no real title available?)
- scientific article; zbMATH DE number 3349815 (Why is no real title available?)
- A theorem in database concurrency control
- Concurrency Control by Locking
- Limitations of concurrency in transaction processing
- Maximal serializability of iterated transactions
- Probabilistic Models of Database Locking
- The serializability of concurrent database updates
- Une approche quantitative de l'exclusion mutuelle
Cited in
(4)- Comparative study of concurrency control on bulk-synchronous parallel search engines
- Hierarchical timestamping algorithm
- Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access)
- scientific article; zbMATH DE number 3961017 (Why is no real title available?)
This page was built for publication: Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823735)