Incrementally distributed B+ trees
Pallavi Tadepalli, H. Conrad Cunningham · 2009
B+ trees have proven efficient and effective in the role of indexes for data stored in databases. With the explosion in the number of datasets being stored in a distributed manner, a scalable and efficient index is needed to locate data. In this paper, the issues in designing a distributed B+ tree are examined with a specific emphasis on incrementally distributing the tree across a network.