Efficient Approximate OLAP Querying Over Time Series
暂无分享,去创建一个
[1] Jérôme Darmont,et al. Clustering-Based Materialized View Selection in Data Warehouses , 2006, ADBIS.
[2] Ion Stoica,et al. BlinkDB: queries with bounded errors and bounded response times on very large data , 2012, EuroSys '13.
[3] Surajit Chaudhuri,et al. Optimized stratified sampling for approximate query processing , 2007, TODS.
[4] Wolfgang Lehner,et al. Template-based Time Series Generation with Loom , 2016, EDBT/ICDT Workshops.
[5] Matteo Golfarelli,et al. View materialization for nested GPSJ queries , 2000, DMDW.
[6] Jeffrey D. Ullman,et al. Implementing data cubes efficiently , 1996, SIGMOD '96.
[7] Surajit Chaudhuri,et al. An overview of data warehousing and OLAP technology , 1997, SGMD.
[8] Surajit Chaudhuri,et al. Dynamic sample selection for approximate query processing , 2003, SIGMOD '03.
[9] Yixin Chen,et al. Multi-Dimensional Analysis of Data Streams Using Stream Cubes , 2007, Data Streams - Models and Algorithms.
[10] Ettore Saltarelli,et al. View Materialization vs. Indexing: Balancing Space Constraints in Data Warehouse Design , 2003, CAiSE.
[11] Jeffrey Sohl,et al. Disaggregation methods to expedite product line forecasting , 1990 .
[12] Wen-Syan Li,et al. Dynamic Materialization of Query Views for Data Warehouse Workloads , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[13] Sridhar Ramaswamy,et al. The Aqua approximate query answering system , 1999, SIGMOD '99.