Optimal Space and Time Complexity Analysis on the Lattice of Cuboids Using Galois Connections for Data Warehousing
暂无分享,去创建一个
[1] Jiawei Han,et al. High-Dimensional OLAP: A Minimal Cubing Approach , 2004, VLDB.
[2] Jiawei Han,et al. Data Mining: Concepts and Techniques , 2000 .
[3] Agostino Cortesi,et al. Abstract Interpretation-Based Verification of Non-functional Requirements , 2005, COORDINATION.
[4] Robert Meersman,et al. On the Complexity of Mining Quantitative Association Rules , 1998, Data Mining and Knowledge Discovery.
[5] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[6] Jeffrey F. Naughton,et al. On the Computation of Multidimensional Aggregates , 1996, VLDB.
[7] Patrick Cousot,et al. The Verification Grand Challenge and Abstract Interpretation , 2005, VSTTE.
[8] Min Wang,et al. E cient Roll-Up and Drill-Down Analysis in Relational Databases , .
[9] Agostino Cortesi. Widening Operators for Abstract Interpretation , 2008, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods.
[10] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[11] Panos Kalnis,et al. Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.
[12] Toon Calders,et al. Discovering roll-up dependencies , 1999, KDD '99.
[13] Agostino Cortesi,et al. A Distortion Free Watermark Framework for Relational Databases , 2009, ICSOFT.
[14] Yixin Chen,et al. Multi-Dimensional Regression Analysis of Time-Series Data Streams , 2002, VLDB.