Issue No. 12 - December (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.737680
<p><b>Abstract</b>—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.</p>
Partial-sum query, covering code, error-correcting code, on-line analytical processing, data cube, multidimensional database, precomputation, query algorithm.
Rakesh Agrawal, Ching-Tien Ho, Jehoshua Bruck, "Partial-Sum Queries in OLAP Data Cubes Using Covering Codes", IEEE Transactions on Computers, vol. 47, no. , pp. 1326-1340, December 1998, doi:10.1109/12.737680