Published December 1, 1998
| public
Journal Article
Open
Partial-sum queries in OLAP data cubes using covering codes
- Creators
- Ho, Ching-Tien
-
Bruck, Jehoshua
- Agrawal, Rakesh
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.
Additional Information
© Copyright 1998 IEEE. Reprinted with permission. Manuscript received 29 Sept. 1997. This research was supported in part by U.S. National Science Foundation Young Investigator Award CCR-9457811 and by the Sloan Research Fellowship.Files
HOCieeetc98.pdf
Files
(576.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:19e1da632f03ce9feb4af98f036b742d
|
576.8 kB | Preview Download |
Additional details
- Eprint ID
- 5583
- Resolver ID
- CaltechAUTHORS:HOCieeetc98
- Created
-
2006-10-25Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field