An efficient I/O interface for optical disks
ACM Transactions on Database Systems (TODS)
Planar point location using persistent search trees
Communications of the ACM
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
Analysis of retrieval performance for records and objects using optical disk technology
ACM Transactions on Database Systems (TODS)
Logical modeling of temporal data
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
File structures: an analytic approach
File structures: an analytic approach
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Dynamic Data Structures on Optical Disks
Proceedings of the First 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
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Optimal placement of high-probability randomly retrieved blocks on CLV optical discs
ACM Transactions on Information Systems (TOIS)
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
A review of recent work on multi-attribute access methods
ACM SIGMOD Record
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Overlapping linear quadtrees: a spatio-temporal access method
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Intensive Data Management in Parallel Systems: A Survey
Distributed and Parallel Databases
Efficient computation of temporal aggregates with range predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient declustering techniques for temporal access structures
ADC '01 Proceedings of the 12th Australasian database conference
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Supporting Temporal Views in a ManagementInformation Base
Journal of Network and Systems Management
ACM SIGMOD Record
Using differential techniques to efficiently support transaction time
The VLDB Journal — The International Journal on Very Large Data Bases
Historical queries along multiple lines of time evolution
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental Implementation Model for Relational Databases with Transaction Time
IEEE Transactions on Knowledge and Data Engineering
Temporal Specialization and Generalization
IEEE Transactions on Knowledge and Data Engineering
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
Indexing for Multiversion Locking: Alternatives and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
The Indispensability of Dispensable Indexes
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
Hashing Methods for Temporal Data
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
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
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 Time Index: An Access Structure for Temporal Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Efficient Management of Multiversion Documents by Object Referencing
Proceedings of the 27th International Conference on Very Large Data Bases
A Uniform Approach to Processing Temporal Queries
VLDB '92 Proceedings of the 18th 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
A New Presumed Commit Optimization for Two Phase Commit
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
Efficient Use of Signatures in Object-Oriented Database Systems
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Computational Indexes for Time Series
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Efficient Complex Query Support for Multiversion XML Documents
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
The Persistent Cache: Improving OID Indexing in Temporal Object-Oriented Database Systems
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient schemes for managing multiversionXML documents
The VLDB Journal — The International Journal on Very Large Data Bases
The LHAM log-structured history data access method
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency and recovery for index trees
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
Copy-Based versus Edit-Based Version Management Schemes for Structured Documents
RIDE '01 Proceedings of the 11th International Workshop on research Issues in Data Engineering
The Vagabond Approach to Logging and Recovery in Transaction-Time Temporal Object Database Systems
IEEE Transactions on Knowledge and Data Engineering
Supporting temporal text-containment queries in temporal document databases
Data & Knowledge Engineering
Benchmarking access methods for time-evolving regional data
Data & Knowledge Engineering
Multiversion-based view maintenance over distributed data sources
ACM Transactions on Database Systems (TODS)
Immortal DB: transaction time support for SQL server
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Supporting complex queries on multiversion XML documents
ACM Transactions on Internet Technology (TOIT)
Recovery from "bad" user transactions
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
On past-time indexing of moving objects
Journal of Systems and Software
An effective indexing model to manage versioned objects in a digital library
Journal of Information Science
The partitioned exponential file for database storage management
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
Concurrency control and recovery for multiversion database structures
Proceedings of the 2nd PhD workshop on Information and knowledge management
Multiversion join index for multiversion data warehouse
Information and Software Technology
Transactions on the multiversion B+-tree
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Searching for similar trajectories in spatial networks
Journal of Systems and Software
Indexing Moving Objects for Trajectory Retrieval on Location-Based Services
IEICE - Transactions on Information and Systems
EverLast: a distributed architecture for preserving the web
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Concurrent updating transactions on versioned data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Logging every footstep: quantile summaries for the entire history
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
Efficient maintenance of ephemeral data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
A unified index for moving-objects databases
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Data structures for multiversion data warehouse
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Minuet: a scalable distributed multiversion B-tree
Proceedings of the VLDB Endowment
LogBase: a scalable log-structured database system in the cloud
Proceedings of the VLDB Endowment
Timeline index: a unified data structure for processing queries on temporal data in SAP HANA
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
DeltaNI: an efficient labeling scheme for versioned hierarchical data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Generalizing database forensics
ACM Transactions on Database Systems (TODS)
Temporal and multi-versioned XML documents: A survey
Information Processing and Management: an International Journal
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
Resolving journaling of journal anomaly in android I/O: multi-version B-tree with lazy split
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Hi-index | 0.00 |
We present an access method designed to provide a single integrated index structure for a versioned timestamped database with a non-deletion policy. Historical data (superceded versions) is stored separately from current data. Our access method is called the Time-Split B-tree. It is an index structure based on Malcolm Easton's Write Once B-tree.The Write Once B-tree was developed for data stored entirely on a Write-Once Read-Many or WORM optical disk. The Time-Split B-tree differs from the Write Once B-tree in the following ways:Current data must be stored on an erasable random-access device.Historical data may be stored on any random-access device, including WORMs, erasable optical disks, and magnetic disks. The point is to use a faster and more expensive device for the current data and a slower cheaper device for the historical data.The splitting policies have been changed to reduce redundancy in the structure—the option of pure key splits as in B+-trees and a choice of split times for time-based splits enable this performance enhancement.When data is migrated from the current to the historical database, it is consolidated and appended to the end of the historical database, allowing for high space utilization in WORM disk sectors.