Stratified B-trees and versioning dictionaries

Details Stratified B-trees and versioning dictionaries Stratified B-trees and versioning dictionaries

2011-03-22

arxiv.org/abs/1103.4282v2

Computer Science

Data Structures and Algorithms

Scientific paper

A classic versioned data structure in storage and computer science is the copy-on-write (CoW) B-tree -- it underlies many of today's file systems and databases, including WAFL, ZFS, Btrfs and more. Unfortunately, it doesn't inherit the B-tree's optimality properties; it has poor space utilization, cannot offer fast updates, and relies on random IO to scale. Yet, nothing better has been developed since. We describe the `stratified B-tree', which beats all known semi-external memory versioned B-trees, including the CoW B-tree. In particular, it is the first versioned dictionary to achieve optimal tradeoffs between space, query and update performance.

Affiliated with

Also associated with

No associations

Rating

Stratified B-trees and versioning dictionaries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stratified B-trees and versioning dictionaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stratified B-trees and versioning dictionaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49189