CategoryValue
Available viahttp://dbpubs.stanford.edu/pub/2003-67
Previous version2002-57
Submitted on 22nd of October 2003
Author Arasu, Arvind; Babu, Shivnath; Widom, Jennifer
Title The CQL Continuous Query Language: Semantic Foundations and Query Execution
Date of publication 2003
Citation Arasu, Arvind; Babu, Shivnath; Widom, Jennifer. The CQL Continuous Query Language: Semantic Foundations and Query Execution
Number of pages 32
Language English
Project STREAM
Type Technical Report
Subject group Data Streams; Miscellaneous
Abstract CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and updatable relations. We begin by presenting an abstract semantics that relies only on ``black box'' mappings among streams and relations. From these mappings we define a precise and general interpretation for continuous queries. CQL is an instantiation of our abstract semantics using SQL to map from relations to relations, window specifications derived from SQL-99 to map from streams to relations, and three new operators to map from relations to streams. Most of the CQL language is operational in the STREAM system. We present the structure of CQL's query execution plans as well as details of the most important components: operators, inter-operator queues, synopses, and sharing of components among multiple operators and queries. Examples throughout the paper are drawn from the Linear Road benchmark recently proposed for Data Stream Management Systems. We also curate a public repository of data stream applications that includes a wide variety of queries expressed in CQL.
Contact address shivnath@stanford.edu
Sponsored by This work was supported by the National Science
Foundation under grants IIS-0118173 and IIS-9817799, and by a 3Com
Stanford Graduate Fellowship.
Notes An earlier version this technical report, titled "An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations", appears on this publications server as technical report number 2002-57. A short version of technical report 2002-57 also appears in the proceedings of the 9th International Conference on Data Base Programming Languages (DBPL 2003).
Fulltext source
  • Postscript (ps, ps.gz, ps.zip)
  • PDF (pdf, pdf.gz, pdf.zip)
  • Management of the document byrwesley@stanford.edu


    Stanford InfoLab Publication Server