PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
Adding time dimension to relational model and extending relational algebra
Information Systems
A homogeneous relational model and query languages for temporal databases
ACM Transactions on Database Systems (TODS)
A generalized model for a relational temporal database
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Extending relational algebra to manipulate temporal data
Information Systems
A temporal relational model and a query language
Information Sciences: an International Journal
Algebra and query language for a historical data model
The Computer Journal - Special issue on databases
The time index—an access structure for temporal data
Proceedings of the sixteenth international conference on Very large databases
Inadequacy of interval timestamps in temporal databases
Information Sciences: an International Journal
Evaluation of relational algebras incorporating the time dimension in databases
ACM Computing Surveys (CSUR)
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
Hypergraph based reorderings of outer join queries with complex predicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A query language for a homogeneous temporal database
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimizing the performance of a relational algebra database interface
Communications of the ACM
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Discrete Mathematical Structures with Applications to Computer Science
Discrete Mathematical Structures with Applications to Computer Science
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Relational Database Systems with Zero Information Loss
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing Methods for Temporal Relations
IEEE Transactions on Knowledge and Data Engineering
Indexing Techniques for Historical Databases
Proceedings of the Fifth International Conference on Data Engineering
Toward a Multihomogeneous Model for a Temporal Database
Proceedings of the Second International Conference on Data Engineering
Theoretical Foundation of Algebraic Optimization Utilizing Unnormalized Relations
ICDT '86 Proceedings of the International Conference on Database Theory
Incomplete Information in Relational Temporal Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Query Processing for Temporal Databases
Proceedings of the Sixth International Conference on Data Engineering
A Foundation for Conventional and Temporal Query Optimization Addressing Duplicates and Ordering
IEEE Transactions on Knowledge and Data Engineering
A generalised temporal algebra
Data & Knowledge Engineering
An XML-based methodology for parametric temporal database model implementation
Journal of Systems and Software
| Hi-index | 0.00 |
This paper presents algebraic identities and algebraic query optimization for a parametric model for temporal databases. The parametric model has several features not present in the classical model. In this model, a key is explicitly designated with a relation, and an operator is available to change the key. The algebra for the parametric model is three-sorted; it includes 1) relational expressions that evaluate to relations, 2) domain expressions that evaluate to time domains, and 3) Boolean expressions that evaluate to TRUE or FALSE. The identities in the parametric model are classified as weak identities and strong identities. Weak identities in this model are largely counterparts of the identities in classical relational databases. Rather than establishing weak identities from scratch, a meta inference mechanism, introduced in the paper, allows weak identities to be induced from their respective classical counterpart. On the other hand, the strong identities will be established from scratch. An algorithm is presented for algebraic optimization to transform a query to an equivalent query that will execute more efficiently.