A mean value performance model for locking in databases

DOI10.1145/3828.3831zbMath0629.68099OpenAlexW2057597682MaRDI QIDQ3766894

Nathan Goodman, Y. C. Tay, Rajan Suri

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3828.3831

zbMATH Keywords

concurrency controlresource contentiontransaction processingshared datadata contentiondatabase lockingdynamic locking

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (10)

Probabilistic analysis of transaction blocking under arbitrary data access distribution in database systems ⋮ Stability and queueing time analysis of a reader-writer queue with alternating exhaustive priorities ⋮ Variance estimation of locking performance ⋮ Mathematical studies on a transaction's waits and deadlocks in a 2pl environment ⋮ Performance comparison of database concurrency control mechanisms based on two-phase locking, timestamping, and mixed approach ⋮ Performance analysis of two concurrency control schemes for design environments ⋮ Approximation for the mean value performance of locking algorithms for distributed database systems: A partitioned database ⋮ Queueing models of concurrency control in database with Poisson arrivals ⋮ A superior two-phase locking algorithm amd its performance ⋮ A reader-writer queue with reader preference

This page was built for publication: A mean value performance model for locking in databases