(Enter summary)
Abstract: Temporal databases can be queried either by query languages working
directly on a timestamp representation, or by languages using an
implicit access to time via temporal connectives. We study the differences
in expressive power between these two approaches. First, we
consider temporal and first-order logic. We show that future temporal
logic is strictly less powerful than past-future temporal logic,
and also that there are queries expressible in first-order logic with explicit
timestamps that... (Update)
Context of citations to this paper: More
...new communications depend on previous ones. Communication complexity was rst applied in databases by Abiteboul, Herr, and Van den Bussche [2]. The only other applications we are aware of are [6] and [20] The used protocols are mostly similar. The main diculty is actually the...
...we then have to consider more deeply nested hypersets. Our proof technique is inspired by a proof of Abiteboul, Herr, and Van den Bussche [2] separating the temporal query languages ETL from TS FO. To this end, they show that every query in ETL on a special sort of databases can...
Cited by: More
Point- Versus Interval-based Temporal Data Models - Bohlen Busatto Jensen (1998)
(Correct)
Monodic fragments of first-order temporal logics.. - Hodkinson, Wolter..
(Correct)
Finite State Machines for Strings over Infinite Alphabets - Neven, Schwentick, Vianu (2002)
(Correct)
Similar documents (at the sentence level):
29.5%: Temporal versus First-Order Logic to Query Temporal.. - Abiteboul, Herr, Van den .. (1996)
(Correct)
17.9%: Temporal Connectives Versus Explicit Timestamps in.. - Abiteboul, Herr..
(Correct)
Active bibliography (related documents): More All
0.2: Temporal Query Languages: a Survey - Chomicki (1995)
(Correct)
0.1: Temporal Logic in Information Systems - Chomicki, Toman (1997)
(Correct)
0.1: Logics for Databases and Information Systems - Chomicki, (Eds.) (1998)
(Correct)
Similar documents based on text: More All
0.2: Bibliography - Abadi Abadi The
(Correct)
0.2: Expressiveness of Structured Document Query Languages.. - Neven, Van den Bussche (1998)
(Correct)
0.2: ASCII Timestamp Format for Grid Computing - Gunter, Tierney (2001)
(Correct)
Related documents from co-citation: More All
16: Temporal Query Languages: a Survey
- Chomicki - 1994
10: The TSQL2 Temporal Query Language (context) - Snodgrass - 1995
10: Tense logic and the theory of linear order (context) - Kamp - 1968
BibTeX entry: (Update)
S. Abiteboul, L. Herr, and J. Van den Bussche. Temporal Connectives versus Explicit Timestamps in Temporal Query Languages (unpublished manuscript). http://citeseer.ist.psu.edu/article/abiteboul96temporal.html More
@inproceedings{ abiteboul95temporal,
author = "Serge Abiteboul and Laurent Herr and Jan Van den Bussche",
title = "Temporal Connectives versus Explicit Timestamps in Temporal Query Languages",
booktitle = "Proceedings of the {VLDB} International Workshop on Temporal Databases",
publisher = "Springer Verlag",
address = "Zurich, Switzerland",
editor = "J. Clifford and A. Tuzhilin",
pages = "43--57",
year = "1995",
url = "citeseer.ist.psu.edu/article/abiteboul96temporal.html" }
Citations (may not include all citations):
1911
Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
951
Computational Complexity (context) - Papadimitriou - 1994
775
Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
725
Temporal and modal logic (context) - Emerson - 1990
177
Temporal logic can be more expressive (context) - Wolper - 1983
166
Some complexity questions related to distributive computing (context) - Yao - 1979
163
the temporal analysis of fairness (context) - Gabby, Pnueli et al. - 1980
140
Tense Logic and the Theory of Linear Order (context) - Kamp - 1968
89
Temporal query languages: a survey
- Chomicki - 1994
80
Finite automata (context) - Perrin - 1990
66
A temporal fixpoint calculus (context) - Vardi - 1988
60
Temporal deductive databases
- Baudinet, Chomicki et al. - 1993
43
Computing with first-order logic
- Abiteboul, Vianu - 1995
32
A temporal relational algebra as a basis for temporal relati.. (context) - Tuzhilin, Clifford - 1990
30
Finite representation of infinite query answers
- Chomicki, Imieli'nski - 1993
24
Formal properties of `now (context) - Kamp - 1971
21
Temporal logic and historical databases (context) - Gabbay, McBrien - 1991
18
First-order queries over temporal databases inexpressible in..
- Toman, Niwinski - 1996
16
Fundamental properties of deterministic and nondeterministic..
- Abiteboul, Simon - 1991
11
volume 1 of Oxford Logic Guides (context) - Gabbay, Hodkinson et al. - 1994
2
Temporal logic and games (context) - Segoufin - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-rocq.inria.fr/~abitebou/pub/bup.INDEX): More
Evolving Databases: An Application to Electronic Commerce - Fordham, Abiteboul, Yesha (1997)
(Correct)
Virtual Schemas and Bases - Santos, Abiteboul, Delobel (1994)
(Correct)
Querying the File - Abiteboul, Cluet, Milo (1993)
(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