Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/2990
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Abiteboul, S. | - |
dc.contributor.author | Herr, L. | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2007-11-23T09:53:41Z | - |
dc.date.available | 2007-11-23T09:53:41Z | - |
dc.date.issued | 1999 | - |
dc.identifier.citation | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 58(1). p. 54-68 | - |
dc.identifier.issn | 0022-0000 | - |
dc.identifier.uri | http://hdl.handle.net/1942/2990 | - |
dc.description.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 are not expressible in extended temporal logic. Our proof technique is novel and based on communication complexity. Then, we consider extensions of first-order logic with fixpoints or while-loops. Again the explicit temporal version of these languages, using timestamps, is compared with an implicit one, using instructions for moving in time. We also compare the temporal versions of the fixpoint language with those of the while language. (C) 1999 Academic Press. | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC | - |
dc.title | Temporal connectives versus explicit timestamps to query temporal databases | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 68 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 54 | - |
dc.identifier.volume | 58 | - |
local.format.pages | 15 | - |
dc.description.notes | INRIA Rocquencourt, F-78153 Le Chesnay, France. Limburgs Univ Ctr, B-3590 Diepenbeek, Belgium.Abiteboul, S, INRIA Rocquencourt, Domaine de Voluceau,BP 105, F-78153 Le Chesnay, France. | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1006/jcss.1998.1598 | - |
dc.identifier.isi | 000078783100005 | - |
item.validation | ecoom 2000 | - |
item.fulltext | No Fulltext | - |
item.contributor | Abiteboul, S. | - |
item.contributor | Herr, L. | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.accessRights | Closed Access | - |
item.fullcitation | Abiteboul, S.; Herr, L. & VAN DEN BUSSCHE, Jan (1999) Temporal connectives versus explicit timestamps to query temporal databases. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 58(1). p. 54-68. | - |
Appears in Collections: | Research publications |
SCOPUSTM
Citations
16
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
13
checked on Sep 28, 2024
Page view(s)
62
checked on Nov 1, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.