Skip to main content
Article thumbnail
Location of Repository

B-trees, Shadowing, and Clones

By Ohad Rodeh


B-trees are used by many file-systems to represent files and directories. They provide guarantied logarithmic time key-search, insert, and remove. File systems like WAFL and ZFS use shadowing, or copy-on-write, to implement snapshots, crash-recovery, write-batching and RAID. Serious difficulties arise when trying to use b-trees and shadowing in a single system. This paper is about a set of b-tree algorithms that respects shadowing, achieves good concurrency, and implements cloning (writeable-snapshots). Our cloning algorithm is efficient and allows the creation of a large number of clones. We believe that using our b-trees would allow shadowing file-systems to scale their on-disk data structures better

Topics: Categories and Subject Descriptors, D.4.2 [Operating Systems, Storage Management [D.4.3 [Operating Systems, File-system management, D.4.8 [Operating Systems, Performance General Terms, Algorithms, Performance Additional Key Words and Phrases, shadowing, copy-on-write, b-trees, concurrency, snapshots
Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.