Comparison of algorithms controlling concurrent access to a database: A combinatorial approach

DOI10.1016/0304-3975(88)90016-3zbMATH Open0681.68119OpenAlexW1984590900MaRDI QIDQ1823735FDOQ1823735

Authors: P. Guichet, Didier G. Arquès, Jean Francon, M. Th. Guichet 

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90016-3

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

zbMATH Keywords

serializabilitycombinatorics of wordsconcurrency control algorithmsconcurrent access

Mathematics Subject Classification ID

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

Cites Work

• The serializability of concurrent database updates
• Title not available (Why is that?)
• Concurrency Control by Locking
• Maximal serializability of iterated transactions
• Limitations of concurrency in transaction processing
• Probabilistic Models of Database Locking
• A theorem in database concurrency control
• Une approche quantitative de l'exclusion mutuelle
• Title not available (Why is that?)

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)
• Title not available (Why is that?)

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)