TEMPORAL QUERY LANGUAGE TQUEL.

Research output: Contribution to journalArticle

296 Citations (Scopus)

Abstract

Recently, attention has been focused on temporal databases, representing an enterprise over time. We have developed a new language, TQuel, to query a temporal database. TQuel was designed to be a minimal extension, both syntactically and semantically, of Quel, the query language in the Ingres relational database management system. This paper discusses the language informally, then provides a tuple relational calculus semantics for the TQuel statements that differ from their Quel counterparts, including the modification statements. The three additional temporal constructs defined in TQuel are shown to be direct semantic analogues of Quel's where clause and target list. We also discuss reducibility of the semantics to Quel's semantics when applied to a static database. TQuel is compared with ten other query languages supporting time.

Original languageEnglish (US)
Pages (from-to)247-298
Number of pages52
JournalACM Transactions on Database Systems
Volume12
Issue number2
DOIs
StatePublished - Jun 1987
Externally publishedYes

Fingerprint

Query languages
Semantics
Industry

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Information Systems
  • Software

Cite this

TEMPORAL QUERY LANGUAGE TQUEL. / Snodgrass, Richard Thomas.

In: ACM Transactions on Database Systems, Vol. 12, No. 2, 06.1987, p. 247-298.

Research output: Contribution to journalArticle

@article{bd77680d2d9147de854ee611de878969,
title = "TEMPORAL QUERY LANGUAGE TQUEL.",
abstract = "Recently, attention has been focused on temporal databases, representing an enterprise over time. We have developed a new language, TQuel, to query a temporal database. TQuel was designed to be a minimal extension, both syntactically and semantically, of Quel, the query language in the Ingres relational database management system. This paper discusses the language informally, then provides a tuple relational calculus semantics for the TQuel statements that differ from their Quel counterparts, including the modification statements. The three additional temporal constructs defined in TQuel are shown to be direct semantic analogues of Quel's where clause and target list. We also discuss reducibility of the semantics to Quel's semantics when applied to a static database. TQuel is compared with ten other query languages supporting time.",
author = "Snodgrass, {Richard Thomas}",
year = "1987",
month = "6",
doi = "10.1145/22952.22956",
language = "English (US)",
volume = "12",
pages = "247--298",
journal = "ACM Transactions on Database Systems",
issn = "0362-5915",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - TEMPORAL QUERY LANGUAGE TQUEL.

AU - Snodgrass, Richard Thomas

PY - 1987/6

Y1 - 1987/6

N2 - Recently, attention has been focused on temporal databases, representing an enterprise over time. We have developed a new language, TQuel, to query a temporal database. TQuel was designed to be a minimal extension, both syntactically and semantically, of Quel, the query language in the Ingres relational database management system. This paper discusses the language informally, then provides a tuple relational calculus semantics for the TQuel statements that differ from their Quel counterparts, including the modification statements. The three additional temporal constructs defined in TQuel are shown to be direct semantic analogues of Quel's where clause and target list. We also discuss reducibility of the semantics to Quel's semantics when applied to a static database. TQuel is compared with ten other query languages supporting time.

AB - Recently, attention has been focused on temporal databases, representing an enterprise over time. We have developed a new language, TQuel, to query a temporal database. TQuel was designed to be a minimal extension, both syntactically and semantically, of Quel, the query language in the Ingres relational database management system. This paper discusses the language informally, then provides a tuple relational calculus semantics for the TQuel statements that differ from their Quel counterparts, including the modification statements. The three additional temporal constructs defined in TQuel are shown to be direct semantic analogues of Quel's where clause and target list. We also discuss reducibility of the semantics to Quel's semantics when applied to a static database. TQuel is compared with ten other query languages supporting time.

UR - http://www.scopus.com/inward/record.url?scp=0023366818&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023366818&partnerID=8YFLogxK

U2 - 10.1145/22952.22956

DO - 10.1145/22952.22956

M3 - Article

AN - SCOPUS:0023366818

VL - 12

SP - 247

EP - 298

JO - ACM Transactions on Database Systems

JF - ACM Transactions on Database Systems

SN - 0362-5915

IS - 2

ER -