Incrementally distributed B+ trees: approaches and challenges

Authors:
Pallavi Tadepalli;H. Conrad Cunningham
Affiliations:
Overstock.com, East Salt Lake City, UT;University of Mississippi, University, MS
Venue:
Proceedings of the 47th Annual Southeast Regional Conference
Year:
2009

Citing 14
Cited 0

Persistent Caching: An Implementation Technique for Complex Objects with Object Identity

IEEE Transactions on Software Engineering
Lazy updates for distributed search structure

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Distributing a search tree among a growing number of processors

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Restructuring the concurrent B+-tree with non-blocked search operations

Information Sciences—Informatics and Computer Science: An International Journal
Chimera: AVirtual Data System for Representing, Querying, and Automating Data Derivation

SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Replication Control in Distributed B-Trees

Replication Control in Distributed B-Trees
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Brief announcement: prefix hash tree

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal

CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.