Abstract
A previous method supported partial-sum queries using a Covering Code (CCode) method with a seed table and an index look-up table. However, this approach suffers a major drawback in the excessive memory space requirement associated with the index look-up table. Accordingly, this work proposes an efficient method, called the Hamming-Based Code (HBC). The HBC method uses Hamming-based codes to establish a seed table and locate the nearest seed to a user’s partial-sum query. The total partial-sum can be determined by calculating the seed value and original cell value via plus or minus operations. For dynamic environments, the seed table only needs to change half of the seeds, and complete reconstruction is unnecessary. In the present analysis, the HBC method requires less storage than the CCode method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Gupta, A., Sarawagi, S.: Modeling multidimensional databases. In: Proc. 13th Intl. Conf. on Data Engineering (ICDE), pp. 232–243 (1997)
Chan, C.Y., Ioannidis, Y.E.: Hierarchical cubes for range-sum queries. In: Proc. 25th Intl. Conf. on Very Large Databases (VLDB), pp. 675–686 (1999)
Codd, E.F., Codd, S.B., Salley, C.T.: Providing OLAP (On-Line Analytical Processing) to user-analysts: An IT mandate. Technical Report (1993)
Cohen, G.D., Karpovsky, M.R., Mattson Jr, H.F., Schatz, J.R.: Covering radius: Survey and recent results. IEEE Trans. Information Theory 31(3), 328–343 (1985)
Cohen, G.D., Lobstein, A.C., Sloane, N.J.A.: Further results on the covering radius of codes. IEEE Trans. Information Theory 32(5), 680–694 (1986)
Geffer, S., Agrawal, D., El Abbadi, A.: The dynamic data cube. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 237–253. Springer, Heidelberg (2000)
Geffer, S., Agrawal, D., El Abbadi, A., Smith, T.: Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes. In: Proc. 15th Intl. Conf. on Data Engineering (ICDE), pp. 328–335 (1999)
Graham, R.L., Sloane, N.J.A.: On the covering radius of codes. IEEE Trans. Information Theory 31(3), 385–401 (1985)
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining and Knowledge Discovery 1(1), 29–53 (1997)
Hamming, R.W.: Error detecting and error correcting codes. The Bell System Technical Journal 26(2), 147–160 (1950)
Ho, C.T., Agrawal, R., Megiddo, N., Srikant, R.: Range queries in OLAP data cubes. In: Proc. Intl. Conf. on Management of Data (SIGMOD), pp. 77–88 (1997)
Ho, C.T., Bruck, J., Agrawal, R.: Partial-sum queries in OLAP data cubes using covering codes. IEEE Trans. Computers 47(12), 1326–1340 (1998)
Johnson, T., Shasha, D.: Some approaches to index design for cube forest. IEEE Data Engineering Bulletin 20(1), 27–35 (1997)
Kotidis, Y., Roussopoulos, N.: An Alternalitive Storage Organization for ROLAP: Aggregate Views Based on Cubetrees. In: Proc. Intl. Conf. on Management of Data (SIGMOD), pp. 249–258 (1998)
Lee, C.I., Li, Y.C.: Flexible data cube for range-sum queries in dynamic OLAP data cubes. In: Proc. 2002 Intl. Computer Symposium, ICS (2002)
Liang, W., Wang, H., Orlowska, M.E.: Range queries in dynamic OLAP data cubes. Data & Knowledge Engineering 34(1), 21–38 (2000)
Moerkotte, G.: Small Materialized aggregates: A light weight index structure for data warehouseing. In: Proc. 24th Intl. Conf. on Very Large Databases (VLDB), pp. 476–487 (1998)
The OLAP Council. MD-API the OLAP application program interface version 2.0 specification (1998)
O’Neil, P., Quass, D.: Improved query performance with variant indexes. In: Proc. Intl. Conf. on Management of Data (SIGMOD), pp. 38–49 (1997)
Riedewald, M., Agrawal, D., El Abbadi, A.: Flexible data cubes for online aggregation. In: Proc. 8th Intl. Conf. on Database Theory (ICDT), pp. 159–173 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, CI., Li, YC., Tseng, SM. (2004). An Efficient Approach for Partial-Sum Queries in Data Cubes Using Hamming-Based Codes. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive