A temporally oriented data model
ACM Transactions on Database Systems (TODS)
Performance evaluation of a temporal database management system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The temporal query language TQuel
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
Partitioned storage for temporal databases
Information Systems
A framework for query optimization in temporal databases
SSDBM V Proceedings of the fifth international conference on Statistical and scientific database management
Event-join optimization in temporal relational databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
On an algebra for historical relational databases: two views
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Design of Database Structures
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Designing DBMS support for the temporal dimension
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance comparison of index structures for multi-key retrieval
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Physical Organization of Temporal Data
Proceedings of the Third International Conference on Data Engineering
The Historical Relational Data Model (HRDM) and Algebra Based on Lifespans
Proceedings of the Third International Conference on Data Engineering
Indexing Techniques for Historical Databases
Proceedings of the Fifth International Conference on Data Engineering
Towards An Implementation of Database Management Systems with Temporal Support
Proceedings of the Second International Conference on Data Engineering
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Representation of a Temporal Data Model in the Relational Environment
Proceedings of the 4th International Working Conference SSDBM on Statistical and Scientific Database Management
On temporal modeling in the context of object databases
ACM SIGMOD Record
Separating semantics from representation in a temporal object database domain
CIKM '93 Proceedings of the second international conference on Information and knowledge management
The time index+: an incremental access structure for temporal databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Experimenting with temporal relational databases
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Indexing values of time sequences
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Wave-indices: indexing evolving databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Indexing a transaction-decision time database
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Historical queries along multiple lines of time evolution
The VLDB Journal — The International Journal on Very Large Data Bases
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Efficient Differential Timeslice Computation
IEEE Transactions on Knowledge and Data Engineering
Algebraic Identities and Query Optimization in a Parametric Model for Relational Temporal Databases
IEEE Transactions on Knowledge and Data Engineering
Indexing Valid Time Databases via B+-Trees
IEEE Transactions on Knowledge and Data Engineering
The Time Index: An Access Structure for Temporal Data
VLDB '90 Proceedings of the 16th 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
A Scientific Multimedia Database System for Polymer Science Experiments
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Fast image retrieval using color-spatial information
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently processing queries on interval-and-value tuples in relational databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
The TI/R--Tree: a temporal--spatial access structure
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Indexing moving objects based on 2 n index tree
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
A proposal for indexing bitemporal databases via cooperative B+-trees
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Making updates disk-I/O friendly using SSDs
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The primary issues that affect the design of indexing methods are examined, and several structures and algorithms for specific cases are proposed. The append-only tree (AP-tree) structure indexes data for append-only databases to help event-join optimization and queries that can exploit the inherent time ordering of such databases. Two variable indexing for the surrogate and time is discussed. It is shown that a nested index could be a very efficient structure in this context and is preferable to a composite B-tree or an index that involves linear lists of historical tuples. The problems of indexing time intervals, as related to nonsurrogate joint-indexing, are discussed. Several algorithms to partition the time line are introduced. A two-variable AT index based on nested indexing is outlined.