Key-sequence data sets on indelible storage
IBM Journal of Research and Development
Logical modeling of temporal data
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Partitioned storage for temporal databases
Information Systems
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Optimal placement of high-probability randomly retrieved blocks on CLV optical discs
ACM Transactions on Information Systems (TOIS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Historical queries along multiple lines of time evolution
The VLDB Journal — The International Journal on Very Large Data Bases
Temporal Specialization and Generalization
IEEE Transactions on Knowledge and Data Engineering
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Efficient Differential Timeslice Computation
IEEE Transactions on Knowledge and Data Engineering
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The BT-tree: A Branched and Temporal Access Method
VLDB '00 Proceedings of the 26th 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
Query Processing Techniques for Multiversion Access Methods
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
The LHAM log-structured history data access method
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
Benchmarking access methods for time-evolving regional data
Data & Knowledge Engineering
Close pair queries in moving object databases
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Skippy: a new snapshot indexing method for time travel in the storage manager
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Read-Optimized, Cache-Conscious, Page Layouts for Temporal Relational Data
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
Avoiding version redundancy for high performance reads in temporal databases
Proceedings of the 4th international workshop on Data management on new hardware
Concurrency control and recovery for multiversion database structures
Proceedings of the 2nd PhD workshop on Information and knowledge management
Concurrent updating transactions on versioned data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
x-RDF-3X: fast querying, high update rates, and consistency for RDF databases
Proceedings of the VLDB Endowment
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The Time-Split B-tree is an integrated index structure for a versioned timestamped database. It gradually migrates data from a current database to an historical database, records migrating when nodes split. Records valid at the split time are placed in both an historical node and a current node. This implies some redundancy. Using both analysis and simulation, we characterise the amount of redundancy, the space utilization, and the record addition (insert or update) performance for a spectrum of different rates of insertion versus update. Three splitting policies are studied which alter the conditions under which either time splits or key space splits are performed.