Abstract
A novel top-down compression technique for data cubes is introduced and experimentally assessed in this paper. This technique considers the previously unrecognized case in which multiple Hierarchical Range Queries (HRQ), a very useful class of OLAP queries, must be evaluated against the target data cube simultaneously. This scenario makes traditional data cube compression techniques ineffective, as, contrarily to the aim of our work, these techniques take into consideration one constraint only (e.g., a given space bound). The result of our study consists in introducing an innovative multiple-objective OLAP computational paradigm, and a hierarchical multidimensional histogram, whose main benefit is meaningfully implementing an intermediate compression of the input data cube able to simultaneously accommodate an even large family of different-in-nature HRQ. A complementary contribution of our work is represen-ted by a wide experimental evaluation of the query performance of our technique against both benchmark and real-life data cubes, also in comparison with state-of-the-art histogram-based compression techniques.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Acharya, S., Poosala, V., Ramaswamy, S.: Selectivity Estimation in Spatial Databases. ACM SIGMOD (1999)
Agrawal, R., Wimmers, E.L.: A Framework for Expressing and Combining Preferences. ACM SIGMOD (2000)
Balke, W.-T., Güntzer, U.: Multi-Objective Query Processing for Database Systems. VLDB (2004)
Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. IEEE ICDE (2001)
Bowman, I.T., Salem, K.: Optimization of Query Streams using Semantic Prefetching. ACM TODSÂ 30(4) (2005)
Bruno, N., Chaudhuri, S., Gravano, L.: STHoles: A Multidimensional Workload-Aware Histogram. ACM SIGMOD (2001)
Buccafurri, F., et al.: A Quad-Tree based Multiresolution Approach for Two-Dimensional Summary Data. IEEE SSDBM (2003)
Chaudhuri, S., et al.: Overcoming Limitations of Sampling for Aggregation Queries. IEEE ICDE (2001)
Chen, Z., Narasayya, V.: Efficient Computation of Multiple Group By Queries. ACM SIGMOD (2005)
Colliat, G.: OLAP, Relational, and Multidimensional Database Systems. ACM SIGMOD Record 25(3) (1996)
Cuzzocrea, A.: Overcoming Limitations of Approximate Query Answering in OLAP. IEEE IDEAS (2005)
Cuzzocrea, A.: Providing Probabilistically-Bounded Approximate Answers to Non-Holistic Aggregate Range Queries in OLAP. ACM DOLAP (2005)
Cuzzocrea, A.: Improving Range-Sum Query Evaluation on Data Cubes via Polynomial Approximation. Data & Knowledge Engineering 56(2) (2006)
Cuzzocrea, A.: Accuracy Control in Compressed Multidimensional Data Cubes for Quality of Answer-based OLAP Tools. IEEE SSDBM (2006)
Cuzzocrea, A., et al.: Semantics-aware Advanced OLAP Visualization of Multidimensional Data Cubes. International Journal of Data Warehousing and Mining 3(4) (2007)
Cuzzocrea, A., Wang, W.: Approximate Range-Sum Query Answering on Data Cubes with Probabilistic Guarantees. Journal of Intelligent Information Systems 28(2) (2007)
Doan, A., Levy, A.Y.: Efficiently Ordering Plans for Data Integration. IEEE ICDE (2002)
Fan, J., Kambhampati, S.: Multi-Objective Query Processing for Data Aggregation. ASU CSE TR (2006)
Fang, M., et al.: Computing Iceberg Queries Efficiently. VLDB (1998)
Garofalakis, M.N., Gibbons, P.B.: Wavelet Synopses with Error Guarantees. ACM SIGMOD (2002)
Garofalakis, M.N., Kumar, A.: Deterministic Wavelet Thresholding for Maximum-Error Metrics. ACM PODS (2004)
Gunopulos, D., et al.: Approximating Multi-Dimensional Aggregate Range Queries over Real Attributes. ACM SIGMOD (2000)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kauffmann Publishers, San Francisco (2000)
Ho, C.-T., et al.: Range Queries in OLAP Data Cubes. ACM SIGMOD (1997)
Ioannidis, Y., Poosala, V.: Histogram-based Approximation of Set-Valued Query Answers. VLDB (1999)
Ives, Z.G., et al.: An Adaptive Query Execution System for Data Integration. ACM SIGMOD (1999)
Jin, R., et al.: A Framework to Support Multiple Query Optimization for Complex Mining Tasks. MMDM (2005)
Jin, R., et al.: Simultaneous Optimization of Complex Mining Tasks with a Knowledgeable Cache. ACM SIGKDD (2005)
Kalnis, P., Papadias, D.: Multi-Query Optimization for On-Line Analytical Processing. Information Systems 28(5) (2003)
Koudas, N., et al.: Optimal Histograms for Hierarchical Range Queries. ACM PODS (2000)
Mistry, H., et al.: Materialized View Selection and Maintenance using Multi-Query Optimization. ACM SIGMOD (2001)
Nie, Z., Kambhampati, S.: Joint Optimization of Cost and Coverage of Query Plans in Data Integration. ACM CIKM, 223–230 (2001)
Papadias, D., et al.: An Optimal and Progressive Algorithm for Skyline Queries. ACM SIGMOD (2003)
Poosala, V., Ganti, V.: Fast Approximate Answers to Aggregate Queries on a Data Cube. IEEE SSDBM (1999)
Poosala, V., Ioannidis, Y.: Selectivity Estimation Without the Attribute Value Independence Assumption. VLDB (1997)
Roy, P., et al.: Efficient and Extensible Algorithms for Multi-Query Optimization. ACM SIGMOD (2000)
Sellis, T., Ghosh, S.: On the Multiple-Query Optimization Problem. IEEE TKDEÂ 2(2) (1990)
Sellis, T.: Multiple-Query Optimization. ACM TODSÂ 13(1) (1988)
Transaction Processing Council: TPC Benchmark H. (2006), http://www.tpc.org/tpch/
University of California, Irvine: 1990 US Census Data (2001), http://kdd.ics.uci.edu/databases/census1990/USCensus1990.html
Wang, S., et al.: State-Slice: A New Paradigm of Multi-Query Optimization of Window-Based Stream Queries. VLDB (2006)
Xin, D., et al.: Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach. VLDB (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cuzzocrea, A. (2008). Top-Down Compression of Data Cubes in the Presence of Simultaneous Multiple Hierarchical Range Queries. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds) Foundations of Intelligent Systems. ISMIS 2008. Lecture Notes in Computer Science(), vol 4994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68123-6_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-68123-6_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68122-9
Online ISBN: 978-3-540-68123-6
eBook Packages: Computer ScienceComputer Science (R0)