(Enter summary)
Abstract: . Queries over temporal databases involve references to time.
We study differences between two approaches of including such references
into a first-order query language (e.g., relational calculus): explicit (using
typed variables and quantifiers) vs. implicit (using a finite set of modal
connectives). We also show that though the latter approach---a firstorder
query language with implicit references to time---is appealing by
its simplicity and ease of use, it cannot express all queries... (Update)
Context of citations to this paper: More
.... temporal dimension FO complete query languages can not avoid arbitrarily large dimensionality in queries [Abiteboul et al. 1996, Toman and Niwinski, 1996] queries depend on the representation = non . generic queries ,OlCllng ancl untolcllng Definition Let R be a concrete...
...and de Rijke, 1997 ] use various kinds of bisimulations to characterize temporal logics with Since and Until . Also, Toman and Niwi nski, 1997 ] use similar methods to separate query languages. One of the principle advantages shared by these methods is their explicit...
Cited by: More
On Incompleteness of Multi-dimensional - First-Order Temporal Logics
(Correct)
Logics for Emerging Applications of Databases - Chomicki, Saake, (eds.)
(Correct)
Logical Data Expiration - Toman (2003)
(Correct)
Similar documents (at the sentence level):
78.6%: Foundations Of Temporal Query Languages - Toman (1995)
(Correct)
Active bibliography (related documents): More All
0.4: Logics for Databases and Information Systems - Chomicki, (Eds.) (1998)
(Correct)
0.4: Temporal Logic in Information Systems - Chomicki, Toman (1997)
(Correct)
0.3: Equivalence in Finite-Variable Logics Is Complete for Polynomial.. - Grohe (1996)
(Correct)
Similar documents based on text: More All
0.8: A Mini-course on Temporal Databases - Chomicki, Toman
(Correct)
0.1: Temporal Databases - Chomicki, Toman
(Correct)
0.1: Embedded Finite Models, Stability, and the Impact of Order - Baldwin, Benedikt (1998)
(Correct)
Related documents from co-citation: More All
12: Temporal versus First-Order Logic to Query Temporal Databases
- Abiteboul, Herr et al. - 1996
11: Point-based Temporal Extensions of SQL
- Toman - 1997
10: Monitoring Dynamic Integrity Constraints Based on Temporal Logic (context) - Lipeck, Saake - 1987
BibTeX entry: (Update)
D. Toman and D. Niwinski. First-Order Queries over Temporal Databases Inexpressible in Temporal Logic. In International Conference on Extending Database Technology, pages 307--324, Avignon, France, 1996. Springer-Verlag, LNCS 1057. http://citeseer.ist.psu.edu/toman96firstorder.html More
@inproceedings{ toman96firstorder,
author = "David Toman and Damian Niwinski",
title = "First-Order Queries over Temporal Databases Inexpressible in Temporal Logic",
booktitle = "Proceedings of the 5th International Conference on Extending Database Technology ({EDBT})",
volume = "1057",
publisher = "Springer-Verlag",
editor = "P. M. G. Apers and M. Bouzeghoub and G. Gardarin",
pages = "307--324",
year = "1996",
url = "citeseer.ist.psu.edu/toman96firstorder.html" }
Citations (may not include all citations):
981
Principles of Database and Knowledge-base Systems (context) - Ullman - 1989
162
The TSQL2 Temporal Query Language (context) - Snodgrass - 1995
141
ACM Transactions on Database Systems (context) - Temporal, TQuel - 1987
115
An application of games to the completeness problem for form.. (context) - Ehrenfeucht - 1961
89
Temporal Query Languages: a Survey
- Chomicki - 1994
66
A Temporal Fixpoint Calculus (context) - Vardi - 1988
61
The Historical Relational Data Model (context) - Clifford, Croker - 1987
51
The Declarative Past and Imperative Future: Executable Tempo.. (context) - Gabbay - 1989
48
Linear Orderings (context) - Rosenstein - 1982
46
Monitoring Dynamic Integrity Constraints Based on Temporal L.. (context) - Lipeck, Saake - 1987
45
On Completeness of Historical Relational Query Languages (context) - Clifford, Croker et al. - 1994
39
Efficient Checking of Temporal Integrity Constraints Using B..
- Chomicki - 1995
37
Implementing Temporal Integrity Constraints Using an Active ..
- Chomicki, Toman - 1995
36
Expressive Functional Completeness in Tense Logic (context) - Gabbay - 1981
30
the Feasibility of Checking Temporal Integrity Constraints
- Chomicki, iwinski et al. - 1993
24
the Formal Properties of `now (context) - On - 1971
24
Temporal Connectives versus Explicit Timestamps in Temporal ..
- Abiteboul, Herr et al.
16
Oxford Science Publications (context) - Gabbay, Hodkinson et al. - 1994
8
and Implementation (context) - Tansel, Clifford et al. - 1993
6
Functional Completeness over Rationals (context) - Stavi - 1979
4
ACM Symposium on Principles of Programming Languages (context) - Gabbay, Pnueli et al. - 1980
3
Definability with Bounded Number of Variables (context) - Immerman, Kozen - 1989
3
A Temporal Relational Algebra as a Basis for Temporal Comple.. (context) - Tuzhilin, Clifford - 1990
2
Sur les classifications des systemes de relations (context) - Fraisse - 1954
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://solo.uwaterloo.ca/~david/cv.html): More
Computing the Well-founded Semantics for Constraint Extensions of.. - Toman (1997)
(Correct)
Top-Down beats Bottom-Up for Constraint Extensions of Datalog - Toman (1995)
(Correct)
A Point-based Temporal Extension of SQL - Toman (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC