This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Partial-Sum Queries in OLAP Data Cubes Using Covering Codes
December 1998 (vol. 47 no. 12)
pp. 1326-1340

Abstract—A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish a connection between the covering problem in the theory of error-correcting codes and the partial-sum problem and use this connection to devise algorithms for the partial-sum problem with efficient space-time trade-offs. For example, using our algorithms, with 44 percent additional storage, the query response time can be improved by about 12 percent; by roughly doubling the storage requirement, the query response time can be improved by about 34 percent.

[1] S. Agrawal, R. Agrawal, P.M. Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, and S. Sarawagi, "On the Computation of Multidimensional Aggregates," Proc. 22nd Int'l Conf. Very Large Databases, pp. 506-521,Mumbai (Bombay), India, Sept. 1996.
[2] L.S. Colby, R.L. Cole, E. Haslam, N. Jazayeri, G. Johnson, W.J. McKenna, L. Schumacher, and D. Wilhite, "Red Brick Vista: Aggregate Computation and Management," Proc. 14th Int'l Conf. Data Eng., pp. 174-177, 1998.
[3] G.D. Cohen, I. Honkala, S. Litsyn, and A.C. Lobstein, Covering Codes. Elsevier, 1977.
[4] G.D. Cohen, S. Litsyn, A.C. Lobstein, and H.F. Mattson Jr., "Covering Radius 1985-1994," J. Applicable Algebra in Eng., Comm., and Computing, special issue, vol. 8, no. 3, 1997.
[5] G.D. Cohen, A.C. Lobstein, and N.J.A. Sloane, "Further Results on the Covering Radius of Codes," IEEE Trans. Information Theory, vol. 32, no. 5, pp. 680-694, Sept. 1986.
[6] M.C. Chen and L.P. McNamee, "The Data Model and Access Method of Summary Data Management," IEEE Trans. Knowledge and Data Eng., vol. 1, no. 4, pp. 519-529, 1989.
[7] E.F. Codd, "Providing OLAP (On-Line Analytical Processing) to User-Analysts: An IT Mandate," technical report, E.F. Codd and Assoc., 1993.
[8] S. Chaudhuri and K. Shim, “Including Group by in Query Optimization,” Proc. 20th Very Large Database Conf., pp. 354-366, Sept. 1994.
[9] J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals Proc. Int'l Conf. Database Eng. (ICDE), pp. 152-159, 1996.
[10] A. Gupta, V. Harinarayan, and D. Quass, "Aggregate-Query Processing in Data Warehousing Environments," Proc. Eighth Int'l Conf. Very Large Databases (VLDB), pp. 358-369,Zurich, Switzerland, Sept. 1995.
[11] H. Gupta, V. Harinarayan, A. Rajaramana, and J. Ullman, Index Selection for OLAP Proc. 13th Int'l Conf. Data Eng., 1997.
[12] R.L. Graham and N.J.A. Sloane, "On the Covering Radius of Codes," IEEE Trans. Information Theory, vol. 31, no. 3, pp. 385-401, May 1985.
[13] C.-T. Ho, R. Agrawal, N. Megiddo, and R. Srikant, "Range Queries in OLAP Data Cubes," Proc. ACM SIGMOD Conf. Management of Data,Tucson, Ariz., May 1997.
[14] V. Harinarayan, A. Rajaraman, and J. D. Ullman, “Implementing Data Cubes Efficiently,” Proc. ACM SIGMOD, pp. 205-216, June 1996
[15] T. Johnson and D. Shasha, "Hierarchically Split Cube Forests for Decision Support: Description and Tuned Design," working paper, 1996.
[16] Special issue on materialized views and data warehousing, D. Lomet, ed., IEEE Data Eng. Bulletin, vol. 18, no. 2, June 1995.
[17] Z. Michalewicz, Statistical and Scientific Databases. Ellis Horwood, 1992.
[18] The OLAP Council, MD-API the OLAP Application Program Interface Version 0.5 Specification, Sept. 1996.
[19] A. Shukla, P.M. Deshpande, J.F. Naughton, and K. Ramasamy, "Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies," Proc. 22nd Int'l Conf. Very Large Databases, pp. 522-531,Mumbai (Bombay), India, Sept. 1996.
[20] B. Salzberg and A. Reuter, "Indexing for Aggregation," working paper, 1996.
[21] J. Srivastava, J.S.E. Tan, and V.Y. Lum, "TBSAM: An Access Method for Efficient Processing of Statistical Queries," IEEE Trans. Knowledge and Date Eng., vol. 1, no. 4, 1989.
[22] W.P. Yan and P. Larson, "Eager Aggregation and Lazy Aggregation," Proc. Eighth Int'l Conf. Very Large Databases (VLDB), pp. 345-357,Zurich, Switzerland, Sept. 1995.

Index Terms:
Partial-sum query, covering code, error-correcting code, on-line analytical processing, data cube, multidimensional database, precomputation, query algorithm.
Citation:
Ching-Tien Ho, Jehoshua Bruck, Rakesh Agrawal, "Partial-Sum Queries in OLAP Data Cubes Using Covering Codes," IEEE Transactions on Computers, vol. 47, no. 12, pp. 1326-1340, Dec. 1998, doi:10.1109/12.737680
Usage of this product signifies your acceptance of the Terms of Use.