Replication Control in Distributed B-Trees
P. R. Cosway · DSpace@MIT (Massachusetts Institute of Technology) · 1997
... in a symbol table or file index. The behavior and performance of B-tree algorithms are well understood for sequential processing and even concurrent processing on small-scale shared-memory multiprocessors. Few algorithms, however, have been proposed or carefully studied for the implementation of concurrent B-trees on networks of message-passing multicomputers. The distribution of memory across the several processors of such networks creates a challenge for building an efficient B-tree that does not exist when all memory is centralized -- distributing the pieces of the B-tree data structure. In this work we explore the use and control of replication of parts of a distributed data structure to create efficient distributed B-trees. Prior