Efficient indexing methods for temporal relations
- 1 June 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 5 (3) , 496-509
- https://doi.org/10.1109/69.224200
Abstract
The size of temporal databases and the semantics of temporal queries pose challenges for the design of efhcient indexing methods. The primary issues that affect the design of indexing methods are examined, and propose several structures and algorithms for specific cases. Indexing methods for time- based queries are developed, queries on the surrogate or time- invariant key and time, and temporal attribute and time. In the latter case, several methods are presented that partition the time- line, in order to balance the distribution of tuple-pointers within the index. The methods are analyzed against alternatives, and present appropriate empirical results.Keywords
This publication has 14 references indexed in Scilit:
- The representation of a temporal data model in the relational environmentPublished by Springer Nature ,2005
- A framework for query optimization in temporal databasesPublished by Springer Nature ,1990
- Partitioned storage for temporal databasesInformation Systems, 1988
- The temporal query language TQuelACM Transactions on Database Systems, 1987
- A temporally oriented data modelACM Transactions on Database Systems, 1986
- The design of POSTGRESACM SIGMOD Record, 1986
- A taxonomy of time databasesACM SIGMOD Record, 1985
- Performance comparison of index structures for multi-key retrievalACM SIGMOD Record, 1984
- Designing DBMS support for the temporal dimensionPublished by Association for Computing Machinery (ACM) ,1984
- R-treesPublished by Association for Computing Machinery (ACM) ,1984