Aggregates in the temporary query language TQuel

Richard Thomas Snodgrass, Santiago Gomez, L. Edwin McKenzie

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

This paper defines new constructs to support aggregation in the temporal query language TQuel and presents their formal semantics in the tuple relational calculus. A formal semantics for Quel aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, and valid clauses; nested aggregation; and instantaneous, cumulative, moving window, and unique variants are supported. These aggregates provide a rich set of statistical functions that range over time, while requiring minimal additions to TQuel and its semantics. We show how the aggregates may be supported in an historical algebra, both in a batch and in an incremental fashion, demonstrating that implementation is straightforward and efficient.

Original languageEnglish (US)
Pages (from-to)826-842
Number of pages17
JournalIEEE Transactions on Knowledge and Data Engineering
Volume5
Issue number5
DOIs
StatePublished - Oct 1993

Fingerprint

Query languages
Semantics
Agglomeration
Algebra

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Aggregates in the temporary query language TQuel. / Snodgrass, Richard Thomas; Gomez, Santiago; McKenzie, L. Edwin.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 5, No. 5, 10.1993, p. 826-842.

Research output: Contribution to journalArticle

Snodgrass, Richard Thomas ; Gomez, Santiago ; McKenzie, L. Edwin. / Aggregates in the temporary query language TQuel. In: IEEE Transactions on Knowledge and Data Engineering. 1993 ; Vol. 5, No. 5. pp. 826-842.
@article{7b6002e1fa6e4e82ba18336d7af515de,
title = "Aggregates in the temporary query language TQuel",
abstract = "This paper defines new constructs to support aggregation in the temporal query language TQuel and presents their formal semantics in the tuple relational calculus. A formal semantics for Quel aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, and valid clauses; nested aggregation; and instantaneous, cumulative, moving window, and unique variants are supported. These aggregates provide a rich set of statistical functions that range over time, while requiring minimal additions to TQuel and its semantics. We show how the aggregates may be supported in an historical algebra, both in a batch and in an incremental fashion, demonstrating that implementation is straightforward and efficient.",
author = "Snodgrass, {Richard Thomas} and Santiago Gomez and McKenzie, {L. Edwin}",
year = "1993",
month = "10",
doi = "10.1109/69.243512",
language = "English (US)",
volume = "5",
pages = "826--842",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - Aggregates in the temporary query language TQuel

AU - Snodgrass, Richard Thomas

AU - Gomez, Santiago

AU - McKenzie, L. Edwin

PY - 1993/10

Y1 - 1993/10

N2 - This paper defines new constructs to support aggregation in the temporal query language TQuel and presents their formal semantics in the tuple relational calculus. A formal semantics for Quel aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, and valid clauses; nested aggregation; and instantaneous, cumulative, moving window, and unique variants are supported. These aggregates provide a rich set of statistical functions that range over time, while requiring minimal additions to TQuel and its semantics. We show how the aggregates may be supported in an historical algebra, both in a batch and in an incremental fashion, demonstrating that implementation is straightforward and efficient.

AB - This paper defines new constructs to support aggregation in the temporal query language TQuel and presents their formal semantics in the tuple relational calculus. A formal semantics for Quel aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, and valid clauses; nested aggregation; and instantaneous, cumulative, moving window, and unique variants are supported. These aggregates provide a rich set of statistical functions that range over time, while requiring minimal additions to TQuel and its semantics. We show how the aggregates may be supported in an historical algebra, both in a batch and in an incremental fashion, demonstrating that implementation is straightforward and efficient.

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

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

U2 - 10.1109/69.243512

DO - 10.1109/69.243512

M3 - Article

AN - SCOPUS:0027683515

VL - 5

SP - 826

EP - 842

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 5

ER -