CaltechAUTHORS
  A Caltech Library Service

Partial-Sum Queries in OLAP Data Cubes Using Covering Codes

Ho, Ching-Tien and Bruck, Jehoshua and Agrawal, Rakesh (1997) Partial-Sum Queries in OLAP Data Cubes Using Covering Codes. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:1997.ETR018

[img]
Preview
PDF (Adobe PDF (1.6MB))
See Usage Policy.

1556Kb
[img]
Preview
Postscript
See Usage Policy.

227Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:1997.ETR018

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 covering 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%.


Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
http://www.paradise.caltech.edu/papers/etr018.psPublisherUNSPECIFIED
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:1997.ETR018
Persistent URL:http://resolver.caltech.edu/CaltechPARADISE:1997.ETR018
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26056
Collection:CaltechPARADISE
Deposited By: Imported from CaltechPARADISE
Deposited On:03 Sep 2002
Last Modified:26 Dec 2012 13:52

Repository Staff Only: item control page