Lazy data structure maintenance for main-memory analytics over sliding windows

Authors:
Chang Ge;Lukasz Golab
Affiliations:
University of Waterloo, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada
Venue:
Proceedings of the sixteenth international workshop on Data warehousing and OLAP
Year:
2013

Citing 10
Cited 1

Wave-indices: indexing evolving databases

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
C-store: a column-oriented DBMS

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Integrating compression and execution in column-oriented database systems

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Stream warehousing with DataDepot

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Data Stream Management

Data Stream Management
Efficient transaction processing in SAP HANA database: the end of a column store myth

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Processing a trillion cells per mouse click

Proceedings of the VLDB Endowment
The vertica analytic database: C-store 7 years later

Proceedings of the VLDB Endowment
MonetDB/DataCell: online analytics in a streaming column-store

Proceedings of the VLDB Endowment
An in-depth analysis of data aggregation cost factors in a columnar in-memory database

Proceedings of the fifteenth international workshop on Data warehousing and OLAP

DOLAP 2013 workshop summary

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of maintaining data structures used by memory-resident data warehouses that store sliding windows. We propose a framework that eagerly expires data from the sliding window to save space and/or satisfy data retention policies, but lazily maintains the associated data structures to reduce maintenance overhead. Using a dictionary as an example, we show that our framework enables maintenance algorithms that outperform existing approaches in terms of space overhead, maintenance overhead, and dictionary lookup overhead during query execution.