The CQL continuous query language: semantic foundations and query execution

被引:459
作者
Arasu, A [1 ]
Babu, S [1 ]
Widom, J [1 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
关键词
data streams; continuous queries; query language; query processing;
D O I
10.1007/s00778-004-0147-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
CQL, a contintious query language, is supported by the STREAM prototype data stream management system (DSMS) at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and stored 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, interoperator 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 DSMSs. We also curate a public repository of data stream applications that includes a wide variety of queries expressed in CQL. The relative ease of capturing these applications in CQL is one indicator that the language contains an appropriate set of constructs for data stream processing.
引用
收藏
页码:121 / 142
页数:22
相关论文
共 45 条
[11]  
BABU S, 2004, P 2004 ACM SIGMOD IN
[12]  
BABU S, 2005, P 21 INT C DAT ENG
[13]  
BABU S, 2004, ACM T DATABASE SYST, V31
[14]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[15]  
Carney D., 2002, Proceedings of the Twenty-eighth International Conference on Very Large Data Bases, P215
[16]  
CARNEY D, 2003, P 29 INT C VER LARG, P838
[17]  
CHANDRASEKARAN S, 2003, P 1 BIENN C INN DAT, P269
[18]  
Chen J., 2000, SIGMOD 00, P379, DOI DOI 10.1145/342009.335432
[19]  
DANIEL B, 1999, INT J COOP INF SYST, V8, P295
[20]  
DAS A, 2003, P 2003 ACM SIGMOD IN, P40