Lazy updates for distributed search structure
Authors:
Open Access
- 1 June 1993
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 22 (2) , 337-346
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Lazy replication: exploiting the semantics of distributed services1990
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- A framework for the performance analysis of concurrent B-tree algorithms1990
- A methodology for implementing highly concurrent data structures1990
- Concurrent search structure algorithmsACM Transactions on Database Systems, 1988
- Concurrent Maintenance of Data Structures in a Distributed EnvironmentThe Computer Journal, 1988
- Distributed data structures: A case studyIEEE Transactions on Computers, 1985
- Concurrent operations on B-trees with overtaking1985
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- Ubiquitous B-TreeACM Computing Surveys, 1979