A distributed data-balanced dictionary based on the B-link tree

Publisher Website

2 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

https://doi.org/10.1109/ipps.1992.223026

Abstract

No abstract available

This publication has 11 references indexed in Scilit:

An In-Depth Analysis of Concurrent B-Tree Algorithms
Published 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 algorithms
Published by Association for Computing Machinery (ACM) ,1990
Commutativity-based concurrency control for abstract data types
IEEE Transactions on Computers, 1988
Concurrent operations on B∗-trees with overtaking
Journal of Computer and System Sciences, 1986
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems, 1986
Distributed data structures: A case study
IEEE Transactions on Computers, 1985
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems, 1981
Weighted voting for replicated data
Published by Association for Computing Machinery (ACM) ,1979
Symmetric binary B-Trees: Data structure and maintenance algorithms
Acta Informatica, 1972