A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Beating the I/O bottleneck: a case for log-structured file systems
ACM SIGOPS Operating Systems Review
The log-structured merge-tree (LSM-tree)
Acta Informatica
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
The implementation and performance of compressed databases
ACM SIGMOD Record
Efficient Bulk Deletes in Relational Databases
Proceedings of the 17th International Conference on Data Engineering
Incremental Organization for Data Recording and Warehousing
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Efficient Search of Multi-Dimensional B-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The LHAM log-structured history data access method
The VLDB Journal — The International Journal on Very Large Data Bases
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
More Than an Interface---SCSI vs. ATA
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage 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
Efficient bulk insertion into a distributed ordered table
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Replay-based approaches to revision processing in stream query engines
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
Efficient online index construction for text databases
ACM Transactions on Database Systems (TODS)
Rose: compressed, log-structured replication
Proceedings of the VLDB Endowment
Towards efficient main-memory use for optimum tree index update
Proceedings of the VLDB Endowment
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Asynchronous view maintenance for VLSD databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Indexing Moving Objects Using Short-Lived Throwaway Indexes
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Adaptive indexing of moving objects with highly variable update frequencies
Journal of Computer Science and Technology
Feeding frenzy: selectively materializing users' event feeds
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
YCSB++: benchmarking and performance debugging advanced features in scalable table stores
Proceedings of the 2nd ACM Symposium on Cloud Computing
MOVIES: indexing moving objects by shooting index images
Geoinformatica
Searching web data: An entity retrieval and high-performance indexing model
Web Semantics: Science, Services and Agents on the World Wide Web
An update-aware storage system for low-locality update-intensive workloads
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
A node indexing scheme for web entity retrieval
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
LazyBase: trading freshness for performance in a scalable database
Proceedings of the 7th ACM european conference on Computer Systems
Spatial indexing for massively update intensive applications
Information Sciences: an International Journal
An efficient B+-tree design for main-memory database systems with strong access locality
Information Sciences: an International Journal
Instant loading for main memory databases
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering using automated sensors often exhibits this imbalance. More generally, indexing streams is considered an unsolved problem.For those applications, B-tree indexes are good choices if some trade-off decisions are tilted towards optimization of updates rather than towards optimization of queries. This paper surveys some techniques that let B-trees sustain very high update rates, up to multiple orders of magnitude higher than traditional B-trees, at the expense of query processing performance. Not surprisingly, some of these techniques are reminiscent of those employed during index creation, index rebuild, etc., while other techniques are derived from well known technologies such as differential files and log-structured file systems.