A distributed data-balanced dictionary based on the B-link tree
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An In-Depth Analysis of Concurrent B-Tree AlgorithmsPublished by Defense Technical Information Center (DTIC) ,1991
- Compact deterministic distributed dictionaries (extended abstract)Published by Association for Computing Machinery (ACM) ,1991
- A framework for the performance analysis of concurrent B-tree algorithmsPublished by Association for Computing Machinery (ACM) ,1990
- Commutativity-based concurrency control for abstract data typesIEEE Transactions on Computers, 1988
- Concurrent operations on B∗-trees with overtakingJournal of Computer and System Sciences, 1986
- A quorum-consensus replication method for abstract data typesACM Transactions on Computer Systems, 1986
- Distributed data structures: A case studyIEEE Transactions on Computers, 1985
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972