A framework for the performance analysis of concurrent B-tree algorithms
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 273-287
- https://doi.org/10.1145/298514.298580
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Approximate analysis of reader and writer access to a shared resourcePublished by Association for Computing Machinery (ACM) ,1990
- Utilization of B-trees with inserts, deletes and modifiesPublished by Association for Computing Machinery (ACM) ,1989
- Performance analysis of centralized databases with optimistic concurrency controlPerformance Evaluation, 1987
- Locking performance in centralized databasesACM Transactions on Database Systems, 1985
- Concurrent operations on B-trees with overtakingPublished by Association for Computing Machinery (ACM) ,1985
- Principles of transaction-oriented database recoveryACM Computing Surveys, 1983
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- Concurrent manipulation of binary search treesACM Transactions on Database Systems, 1980
- Concurrent search and insertion in 2?3 treesActa Informatica, 1980
- Organization and maintenance of large ordered indexesActa Informatica, 1972