ACM Transactions on Computer Systems (TOCS)
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
ACM Computing Surveys (CSUR)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
IBM Storage Tank-- A heterogeneous scalable SAN file system
IBM Systems Journal
Metadata Efficiency in Versioning File Systems
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
ARC: A Self-Tuning, Low Overhead Replacement Cache
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
File system design for an NFS file server appliance
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Scalability in the XFS file system
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Concurrency control in B+-trees databases using preparatory operations
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The ANSI T10 object-based storage standard and current implementations
IBM Journal of Research and Development
Tracking back references in a write-anywhere file system
FAST'10 Proceedings of the 8th USENIX conference on File and storage technologies
BlobSeer: Next-generation data management for large scale infrastructures
Journal of Parallel and Distributed Computing
Intrusion recovery using selective re-execution
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Consistent and durable data structures for non-volatile byte-addressable memory
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Going back and forth: efficient multideployment and multisnapshotting on clouds
Proceedings of the 20th international symposium on High performance distributed computing
Stratified B-trees and versioned dictionaries
HotStorage'11 Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems
Minuet: a scalable distributed multiversion B-tree
Proceedings of the VLDB Endowment
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
An approach for indexing file names in a directory
Proceedings of the 13th International Conference on Computer Systems and Technologies
Leaplist: lessons learned in designing tm-supported range queries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
BTRFS: The Linux B-Tree Filesystem
ACM Transactions on Storage (TOS)
Secure data deletion from persistent media
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
TABLEFS: enhancing metadata efficiency in the local file system
USENIX ATC'13 Proceedings of the 2013 USENIX conference on Annual Technical Conference
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
Last block logging mechanism for improving performance and lifetime on SCM-based file system
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
B-trees are used by many file systems to represent files and directories. They provide guaranteed 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 article 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 better scale their on-disk data structures.