Analysis of a deferred and incremental update strategy for secondary indexes
Information Systems
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
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Building the Operational Data Store
Building the Operational Data Store
Automating Statistics Management for Query Optimizers
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing Methods for Temporal Relations
IEEE Transactions on Knowledge and Data Engineering
The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases
Proceedings of the Tenth International Conference on Data Engineering
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Immortal DB: transaction time support for SQL server
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
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 efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
Indexing multiversion databases
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficient bulk deletes for multi dimensional clustered tables in DB2
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Communications of the ACM - Web science
Database Systems: The Complete Book
Database Systems: The Complete Book
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
Real-Time Querying of Historical Data in Flash-Equipped Sensor Devices
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
An object placement advisor for DB2 using solid state storage
Proceedings of the VLDB Endowment
Efficient index compression in DB2 LUW
Proceedings of the VLDB Endowment
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Information Processing Letters
SSD bufferpool extensions for database systems
Proceedings of the VLDB Endowment
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
MaSM: efficient online updates in data warehouses
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Turbocharging DBMS buffer pool using SSDs
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Enhancing recovery using an SSD buffer pool extension
Proceedings of the Seventh International Workshop on Data Management on New Hardware
High-performance concurrency control mechanisms for main-memory databases
Proceedings of the VLDB Endowment
bLSM: a general purpose log structured merge tree
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
LogBase: a scalable log-structured database system in the cloud
Proceedings of the VLDB Endowment
Flash-based extended cache for higher throughput and faster recovery
Proceedings of the VLDB Endowment
The Bw-Tree: A B-tree for new hardware platforms
ICDE '13 Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)
Hi-index | 0.00 |
Multiversion databases store both current and historical data. Rows are typically annotated with timestamps representing the period when the row is/was valid. We develop novel techniques for reducing index maintenance in multiversion databases, so that indexes can be used effectively for analytical queries over current data without being a heavy burden on transaction throughput. To achieve this end, we re-design persistent index data structures in the storage hierarchy to employ an extra level of indirection. The indirection level is stored on solid state disks that can support very fast random I/Os, so that traversing the extra level of indirection incurs a relatively small overhead. The extra level of indirection dramatically reduces the number of magnetic disk I/Os that are needed for index updates, and localizes maintenance to indexes on updated attributes. Further, we batch insertions within the indirection layer in order to reduce physical disk I/Os for indexing new records. By reducing the index maintenance overhead on transactions, we enable operational data stores to create more indexes to support queries. We have developed a prototype of our indirection proposal by extending the widely used Generalized Search Tree (GiST) open-source project, which is also employed in PostgreSQL. Our working implementation demonstrates that we can significantly reduce index maintenance and/or query processing cost, by a factor of 3. For insertions of new records, our novel batching technique can save up to 90% of the insertion time.