Issue No. 05 - October (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.243512
<p>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.</p>
temporal query language; TQuel; temporal database; formal semantics; tuple relational calculus; nested aggregation; unique variants; statistical functions; historical algebra; temporal partitioning; valid time; query languages; relational databases; temporal databases
S. Gomez, R. Snodgrass and E. McKenzie, "Aggregates in the Temporal Query Language TQuel," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 826-842, 1993.