The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
The log-structured merge-tree (LSM-tree)
Acta Informatica
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Venti: A New Approach to Archival Storage
FAST '02 Proceedings of the Conference on File and Storage Technologies
Incremental Organization for Data Recording and Warehousing
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
New NFS Tracing Tools and Techniques for System Analysis
LISA '03 Proceedings of the 17th USENIX conference on System administration
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Integrating compression and execution in column-oriented database systems
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
On multidimensional data and modern disks
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
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
An implementation of a log-structured file system for UNIX
USENIX'93 Proceedings of the USENIX Winter 1993 Conference Proceedings on USENIX Winter 1993 Conference Proceedings
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
B-trees, shadowing, and clones
ACM Transactions on Storage (TOS)
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
FlexVol: flexible, efficient file volume virtualization in WAFL
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Decentralized deduplication in SAN cluster file systems
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Differentiated storage services
ACM SIGOPS Operating Systems Review
Differentiated storage services
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
De-indirection for flash-based SSDs with nameless writes
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
Systems research and innovation in data ONTAP
ACM SIGOPS Operating Systems Review
BTRFS: The Linux B-Tree Filesystem
ACM Transactions on Storage (TOS)
Improving restore speed for backup systems that use inline chunk-based deduplication
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
Extending the lifetime of flash-based storage through reducing write amplification from file systems
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
ReconFS: a reconstructable file system on flash storage
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Checking the integrity of transactional mechanisms
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Hi-index | 0.00 |
Many file systems reorganize data on disk, for example to defragment storage, shrink volumes, or migrate data between different classes of storage. Advanced file system features such as snapshots, writable clones, and deduplication make these tasks complicated, as moving a single block may require finding and updating dozens, or even hundreds, of pointers to it. We present Backlog, an efficient implementation of explicit back references, to address this problem. Back references are file system meta-data that map physical block numbers to the data objects that use them. We show that by using LSM-Trees and exploiting the write-anywhere behavior of modern file systems such as NetApp® WAFL® or btrfs, we can maintain back reference meta-data with minimal overhead (one extra disk I/O per 102 block operations) and provide excellent query performance for the common case of queries covering ranges of physically adjacent blocks.