A lower bound on the probability of conflict under nonuniform access in database systems

DOI10.1007/BF01190508MaRDI QIDQ1346773zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 9 April 1995

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01190508

zbMATH Keywords

nonuniform accessresource contention problemsresource sharing systems

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Probabilistic analysis of transaction blocking under arbitrary data access distribution in database systems
• Accès non uniformément répartis dans une base de données : généralisation d'une approche probabiliste
• Probabilistic Models and Asymptotic Results for Concurrent Processing with Exclusive and Non-Exclusive Locks
• An urn model with applications to database performance evaluation
• Locking performance in centralized databases

Cites work

• A model of transaction blocking in databases
• Birthday Problem with Unlike Probabilities
• Implications of certain assumptions in database performance evauation
• Optimistic versus pessimistic concurrency control mechanisms in database management systems
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• The notions of consistency and predicate locks in a database system

Cited in

(2)

• Probabilistic analysis of transaction blocking under arbitrary data access distribution in database systems
• Accès non uniformément répartis dans une base de données : généralisation d'une approche probabiliste

This page was built for publication: A lower bound on the probability of conflict under nonuniform access in database systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346773)