Computation migration: enhancing locality for distributed-memory parallel systems
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Lazy updates for distributed search structure
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
View Serializable Updates of Concurrent Index Structures
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Guaranteeing correctness and availability in P2P range indices
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A practical scalable distributed B-tree
Proceedings of the VLDB Endowment
An efficient multi-dimensional index for cloud data management
Proceedings of the first international workshop on Cloud data management
Shepherdable indexes and persistent search services for mobile users
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Minuet: a scalable distributed multiversion B-tree
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. The paper presents an algorithm for a concurrent distributed B-tree that can be implemented on message passing parallel computers. This distributed B-tree (the dB-tree) replicates the interior nodes in order to improve parallelism and reduce message passing. It is shown how the dB-tree algorithm can be used to build an efficient, highly parallel, data-balanced distributed dictionary, the dE-tree.