.png){kind=icon}
.png){kind=icon}
Return
Partial-sum queries in OLAP data cubes using covering codes
.png){kind=icon}
PRE
AI
DOI：10.1109/12.737680.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
partial-sum query
covering code
error-correcting code
on-line analytical processing
data cube
multidimensional database
precomputation
query algorithm
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available