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
Incrementally distributed B+ trees: approaches and challenges
Proceedings of the 47th Annual Southeast Regional Conference
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
| Hi-index | 0.00 |
B-trees are a commonly used data structure to associate symbols with related information, as in a symbol table or file index. The performance of B-tree algorithms is 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 concurrent B-trees on a network of message-passing multicomputers. Such algorithms must distribute and possibly replicate pieces of the B-tree data structure. Prior work has shown that replicating parts of the B-tree structure does increase throughput. Our work addresses the further questions: which B-tree nodes should be copied, and how many copies of each node should be made? The answer for a particular tree can change over time. We explore the characteristics of optimal replication for a tree given a static pattern of accesses and techniques for dynamically creating near-optimal replication from observed access patterns.