Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
Version control in an object-oriented architecture
Object-oriented concepts, databases, and applications
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Bibliography on temporal databases
ACM SIGMOD Record
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
An update of the temporal database bibliography
ACM SIGMOD Record
The time index+: an incremental access structure for temporal databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Rdb (2nd ed.): a comprehensive guide
Rdb (2nd ed.): a comprehensive guide
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
Information Processing Letters
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
On the semantics of “now” in databases
ACM Transactions on Database Systems (TODS)
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing Methods for Temporal Relations
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases
Proceedings of the Tenth International Conference on Data Engineering
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Transaction Timestamping in (Temporal) Databases
Proceedings of the 27th International Conference on Very Large Data Bases
Exploiting A History Database for Backup
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
An Efficient Transient Versioning Method
BNCOD 13 Proceedings of the 13th British National Conference on Databases: Advances in Databases
VQL: A Query Language for Multiversion Databases
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
DEXA '98 Proceedings of the 9th International Conference on Database and Expert Systems Applications
Efficient Complex Query Support for Multiversion XML Documents
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Effective timestamping in databases
The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Temporal coalescing with now granularity, and incomplete information
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Immortal DB: transaction time support for SQL server
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Using the Lock Manager to Choose Timestamps
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Transaction Time Support Inside a Database Engine
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Recovery from "bad" user transactions
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Indexing multiversion databases
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Managing and querying versions of multiversion data warehouse
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
EverLast: a distributed architecture for preserving the web
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
An improved OLAP join and aggregate algorithm based on dimension hierarchy
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Scalable architecture and query optimization fortransaction-time DBs with evolving schemas
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Spatio-temporal database research at the University of Melbourne
ACM SIGMOD Record
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
Query retrieval enhancement based on Huffman index terms encoding
Proceedings of the 3rd International Conference on Information and Communication Systems
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Making updates disk-I/O friendly using SSDs
Proceedings of the VLDB Endowment
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
Journal of Intelligent Information Systems
Hi-index | 0.00 |
Immortal DB is a transaction time database system designed to enable high performance for temporal applications. It is built into a commercial database engine, Microsoft SQL Server. This paper describes how we integrated a temporal indexing technique, the TSB-tree, into Immortal DB to serve as the core access method. The TSB-tree provides high performance access and update for both current and historical data. A main challenge was integrating TSB-tree functionality while preserving original B+tree functionality, including concurrency control and recovery. We discuss the overall architecture, including our unique treatment of index terms, and practical issues such as uncommitted data and log management. Performance is a primary concern. To increase performance, versions are locally delta compressed, exploiting the commonality between adjacent versions of the same record. This technique is also applied to index terms in index pages. There is a tradeoff between query performance and storage space. We discuss optimizing performance regarding this tradeoff throughout the paper. The result of our efforts is a high-performance transaction time database system built into an RDBMS engine, which has not been achieved before. We include a thorough experimental study and analysis that confirms the very good performance that it achieves.