Incomplete Information in Relational Databases
Journal of the ACM (JACM)
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)
A temporal relational algebra as a basis for temporal relational completeness
Proceedings of the sixteenth international conference on Very large databases
Temporal databases status and research directions
ACM SIGMOD Record - Directions for future database research & development
Evaluation of relational algebras incorporating the time dimension in databases
ACM Computing Surveys (CSUR)
Algebraic optimization of recursive queries
Data & Knowledge Engineering
An update of the temporal database bibliography
ACM SIGMOD Record
On the power of algebras with recursion
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On completeness of historical relational query languages
ACM Transactions on Database Systems (TODS)
Database models for infinite and indefinite temporal information
Information Systems
A relational model of data for large shared data banks
Communications of the ACM
Extensions to SQL for Historical Databases
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the Ninth International Conference on Data Engineering
Temporal Query Languages: A Survey
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Temporal Logic & Historical Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Incomplete Information in Relational Temporal Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Infinite Relations in Paraconsistent Databases
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
We construct a framework for natural handling of incomplete and inconsistent information in temporal databases. Central to this framework are structures that we call time-varying paraconsistent relations, which are essentially 4-valued relations that vary over time. For such structures, we present an algebra based on temporal semantics in which there is no explicit manipulation of time indices, yet it is rich enough to express recursive equations as queries. The algebra is a consistent extension of the relational algebra; it supports basic algebraic equivalences, and has a well-defined formal semantics. We also provide many examples of queries expressed in this algebra. To our knowledge, our framework is the first treatment of inconsistent information in the context of temporal databases.