Reimplementing the Cedar file system using logging and group commit
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
ACM Transactions on Database Systems (TODS)
The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
Cache write policies and performance
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
I/O-efficient algorithms and environments
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Efficient distributed algorithms to build inverted files
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
The term vector database: fast access to indexing terms for Web pages
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
WebBase: a repository of Web pages
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Soft updates: a solution to the metadata update problem in file systems
ACM Transactions on Computer Systems (TOCS)
A history and evaluation of System R
Communications of the ACM
Building a distributed full-text index for the Web
Proceedings of the 10th international conference on World Wide Web
I/O-efficient techniques for computing pagerank
Proceedings of the eleventh international conference on Information and knowledge management
Freeblock Scheduling Outside of Disk Firmware
FAST '02 Proceedings of the Conference on File and Storage Technologies
Write-Only Disk Cache Experiments on Multiple Surface Disks
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Evaluation of SCSI over TCP/IP and SCSI over Fibre Channel Connections
HOTI '01 Proceedings of the The Ninth Symposium on High Performance Interconnects
The Cost of Cache-Oblivious Searching
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
X-RAY: A Non-Invasive Exclusive Caching Mechanism for RAIDs
Proceedings of the 31st annual international symposium on Computer architecture
Decentralized Authentication Mechanisms for Object-based Storage Devices
SISW '03 Proceedings of the Second IEEE International Security in Storage Workshop
Reliability and security of RAID storage systems and D2D archives using SATA disk drives
ACM Transactions on Storage (TOS)
Empirical evaluation of multi-level buffer cache collaboration for storage systems
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Configuring and Scheduling an Eager-Writing Disk Array for a Transaction Processing Workload
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
SIAM Journal on Computing
HyLog: A High Performance Approach to Managing Disk Layout
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
A Unified Multiple-Level Cache for High Performance Storage Systems
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
B-tree indexes for high update rates
ACM SIGMOD Record
Trustworthy keyword search for regulatory-compliant records retention
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Soft updates: a technique for eliminating most synchronous writes in the fast filesystem
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
I/O-conscious data preparation for large-scale web search engines
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Efficient Logging and Replication Techniques for Comprehensive Data Protection
MSST '07 Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies
Attribute Storage Design for Object-based Storage Devices
MSST '07 Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Main-memory operation buffering for efficient R-tree update
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A scalable deduplication and garbage collection engine for incremental backup
Proceedings of the 6th International Systems and Storage Conference
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
X-Stream: edge-centric graph processing using streaming partitions
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
| Hi-index | 0.00 |
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibility and results in inefficient use of buffer memory and raw disk bandwidth. This paper describes an update-aware disk access interface that allows applications to explicitly specify disk update requests and associate with such requests call-back functions that will be invoked when the requested disk blocks are brought into memory. Because call-back functions offer a continuation mechanism after retrieval of requested blocks, storage systems supporting this interface are given more flexibility in scheduling pending disk update requests. In particular, this interface enables a simple but effective technique called Batching mOdifications with Sequential Commit (BOSC), which greatly improves the sustained throughput of a storage system under low-locality update-intensive workloads. In addition, together with a space-efficient low-latency disk logging technique, BOSC is able to deliver the same durability guarantee as synchronous disk updates. Empirical measurements show that the random update throughput of a BOSC-based B+ tree is more than an order of magnitude higher than that of the same B+ tree implementation on a traditional storage system.