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)

DOI10.1016/0166-218X(92)90267-EzbMath0683.68088MaRDI QIDQ1825050

Didier G. Arquès

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

serializabilitytransaction processingtwo-phase lockingconcurrent access

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20)

Related Items (1)

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal serializability of iterated transactions
• 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)
• Concurrency Control by Locking
• Une approche quantitative de l'exclusion mutuelle
• Probabilistic Models of Database Locking
• The serializability of concurrent database updates
• A theorem in database concurrency control
• Limitations of concurrency in transaction processing

This page was built for publication: 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)