No pane, no gain

ACM SIGMOD RecordPublished 1 March 2005

Jin Li, David Maier, Kristin Tufte, Vassilis Papadimos, Peter Tucker

DOI10.1145/1058150.1058158

Source URL

Citations269

SJR quartileQ2

SJR score0.69

SNIP0.92

TL;DR

This paper presents an approach for evaluating sliding-window aggregate queries that reduces both space and computation time for query execution that divides overlapping windows into disjoint panes, computes sub-aggregates over each pane, and "rolls up" the pane-aggRegates to computer window-agg Regates.

Abstract

Windows queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and computation time for query execution. Our approach divides overlapping windows into disjoint panes, computes sub-aggregates over each pane, and "rolls up" the pane-aggregates to computer window-aggregates. Our experimental study shows that using panes has significant performance benefits.

Keywords

Computer Science

IEEE ExpertData mining and knowledge discovery: making sense out of data

4,643 Citations1996U.M. Feyyad

Find loads of the data mining and knowledge discovery making sense out of data book catalogues in this site as the choice of you visiting this page.

Models and issues in data stream systems

2,517 Citations2002Brian Babcock, Shivnath Babu +3 more

The need for and research issues arising from a new model of data processing, where data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying data streams are motivated.

Data Mining and Knowledge DiscoveryData Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals

2,134 Citations1997Jim Gray, Surajit Chaudhuri +6 more

This paper explains the cube and roll-up operators, shows how they fit in SQL, explains how users can define new aggregatefunctions for cubes, and discusses efficient techniques to compute the cube.

The VLDB JournalThe CQL continuous query language: semantic foundations and query execution

1,187 Citations2005Arvind Arasu, Shivnath Babu +1 more

This paper presents 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.

Conference on Innovative Data Systems ResearchTelegraphCQ: Continuous Dataflow Processing for an Uncertain World.

966 Citations2003Sirish Chandrasekaran, Owen Cooper +9 more

The next generation Telegraph system, called TelegraphCQ, is focused on meeting the challenges that arise in handling large streams of continuous queries over high-volume, highly-variable data streams and leverages the PostgreSQL open source code base.

Elsevier eBooksMonitoring Streams — A New Class of Data Management Applications

838 Citations2002Don Carney, Uğur Çetintemel +7 more

This paper presents Aurora, a new DBMS that is currently under construction at Brandeis University, Brown University, and M.I.T. and describes the basic system architecture, a stream-oriented set of operators, optimization tactics, and support for real-time operation.

Gigascope

690 Citations2003Charles D. Cranor, Theodore Johnson +2 more

The motivation for and constraints in developing Gigascope, the GigASCope architecture and query language, and performance issues are described, as well as a discussion of stream database research problems the authors have found in the application.

Flexible time management in data stream systems

277 Citations2004Utkarsh Srivastava, Jennifer Widom

The heartbeat generation algorithm is based on parameters capturing skew between streams, unordering within streams, and latency in streams reaching the DSMS, and it is discussed how heartbeats can be used for processing continuous queries.

The Niagara Internet Query System.

196 Citations2001Jeffrey F. Naughton, David J. DeWitt +18 more

To handle infinite streams and data sources with unpredictable rates, the Niagara Internet Query System supports a “get partial” operation on blocking operators in order to produce partial query results, and inserts synchronization packets at critical points in the operator tree to guarantee the consistency of (partial) results.

Elsevier eBooksResource Sharing in Continuous Sliding-Window Aggregates

172 Citations2004Arvind Arasu, Jennifer Widom

This work addresses sliding-window aggregates over data streams, an important class of continuous operators for which sharing has not been addressed, and provides precise theoretical performance guarantees for its techniques.