TY - BOOK
T1 - SyncSQL: A Language to Express Views over Data Streams
AU - Ghanem, Thanaa M.
AU - Larson, Per-Ake
AU - Aref, Walid G.
AU - Elmagarmid, Ahmed Khalifa
PY - 2006/7
Y1 - 2006/7
N2 - Prior work on languages to express continuous queries over streams has defined a stream as a sequence of tuples that represents an infinite append-only relation. In this paper, we show that composition of queries is not possible in the append-only model. Query composition is a fundamental property of any query language - composition makes it possible to build up complex queries from simpler queries. We then propose a query language, termed Synchronized SQL (or SyncSQL), that defines a stream as a sequence of modify operations (i.e., insert, up-date, and delete) against a relation with a specified schema. Inputs and outputs in any SyncSQL query are interpreted in the same way and, hence. SyncSQL expressions can be composed. Coarser periodic refresh requirements are typically expressed as sliding-window queries. We generalize this approach by introducing the synchronization principle that empowers SyncSQL with a formal mechanism to express queries with arbitrary refresh conditions. After introducing the semantics and syntax, we lay the algebraic foundation for SyncSQL and propose a query matching algorithm for deciding containment of SyncSQL expressions.
AB - Prior work on languages to express continuous queries over streams has defined a stream as a sequence of tuples that represents an infinite append-only relation. In this paper, we show that composition of queries is not possible in the append-only model. Query composition is a fundamental property of any query language - composition makes it possible to build up complex queries from simpler queries. We then propose a query language, termed Synchronized SQL (or SyncSQL), that defines a stream as a sequence of modify operations (i.e., insert, up-date, and delete) against a relation with a specified schema. Inputs and outputs in any SyncSQL query are interpreted in the same way and, hence. SyncSQL expressions can be composed. Coarser periodic refresh requirements are typically expressed as sliding-window queries. We generalize this approach by introducing the synchronization principle that empowers SyncSQL with a formal mechanism to express queries with arbitrary refresh conditions. After introducing the semantics and syntax, we lay the algebraic foundation for SyncSQL and propose a query matching algorithm for deciding containment of SyncSQL expressions.
M3 - Commissioned report
BT - SyncSQL: A Language to Express Views over Data Streams
ER -