A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
B-tree is a widely used data-structure indexing data for efficient retrieval. Highly parallel operations are desired by modern-day cloud computing platforms on high-volume and highly dynamic sets of data. This motivates decentralized indexing structures for data-organization that avoid any performance bottleneck. In a decentralized B-tree, parts of the structure are distributed among different processors and some parts are replicated. Maintaining strong consistency among the replicated statesdoi:10.1007/978-3-642-40148-0_12 fatcat:l5cst2i5uzhvjou4bexgtjnagq