Probabilistic Models of Database Locking
From MaRDI portal
Cited in
(16)- Performance issues in database systems
- Queueing models of concurrency control in database with Poisson arrivals
- Computational complexity of loss networks
- A reader-writer queue with reader preference
- Probabilistic analysis of transaction blocking under arbitrary data access distribution in database systems
- Exponential penalty function control of loss networks
- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
- Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases
- 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)
- Stability and queueing time analysis of a reader-writer queue with alternating exhaustive priorities
- Variance estimation of locking performance
- Optimal admission to reader-writer systems with no queueing
- Improved approximations for the Erlang loss model
- Stationary waiting time in parallel queues with synchronization
- Revisiting stochastic loss networks: structures and approximations
- Mathematical theory of queueing networks
This page was built for publication: Probabilistic Models of Database Locking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765275)
