Conference paper
On optimal placements of processors in Tori networks
M. Blaum, J. Bruck, et al.
IPDPS 1996
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% additional storage, the query response time can be improved by about 12%; by roughly doubling the storage requirement, the query response time can be improved by about 34%.
M. Blaum, J. Bruck, et al.
IPDPS 1996
R. Agrawal, J. Kiernan
ICDE 1993
R. Agrawal, Shaul Dar, et al.
ICDE 1993
J. Bruck, Robert E. Cypher, et al.
FTCS 1992