The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
A homogeneous relational model and query languages for temporal databases
ACM Transactions on Database Systems (TODS)
Point vs. interval-based query languages for temporal databases (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A query language for a homogeneous temporal database
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Point-Based Temporal Extension of Temporal SQL
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
Point-Versus Interval-Based Temporal Data Models
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Efficient Evaluation of the Valid-Time Natural Join
Proceedings of the Tenth International Conference on Data Engineering
A Relational Model and SQL-like Query Language for Spatial Databases
Advanced Database Systems
Toward a Unifying View of Point and Interval Temporal Data Models
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Join operations in temporal databases
The VLDB Journal — The International Journal on Very Large Data Bases
An XML-Based Framework for Temporal Database Implementation
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
An XML-based methodology for parametric temporal database model implementation
Journal of Systems and Software
| Hi-index | 0.00 |
Starting from mid 1980s, there has been a debate about what data model is most appropriate for temporal databases. A fundamental choice one has to make is whether to use intervals of time or temporal elements to timestamp objects and events with the periods of validity. The advantage of using interval timestamps is that Start and End columns can be added to relations for treating them within the framework of classical databases, leading to quick implementation. Temporal elements are finite unions of intervals. The advantage of temporal elements is that timestamps become implicitly associated with values, tuples, and relations. Furthermore, since temporal elements, by design, are closed under set theoretical operations such as union, intersection and complementation, they lead to query languages that are natural. Here, we investigate the ease of use as well as system performance for the two approaches to help settle the debate.