Partial-Sum Queries in OLAP Data Cubes Using Covering Codes

Ho, C-T. and Bruck, J. and Agrawal, R. (1997) Partial-Sum Queries in OLAP Data Cubes Using Covering Codes. Technical Report. California Institute of Technology. [CaltechPARADISE:1997.ETR018]

Full text available as:

	PDF (Adobe PDF (1.6MB)) - Requires Adobe Acrobat Reader or other PDF viewer.
	Postscript - Requires a viewer, such as GhostView

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

EPrint Type:	Monograph (Technical Report)
Additional Information:	[Alternate URL: http://www.paradise.caltech.edu/papers/etr018.ps]
Subjects:	All Records
ID Code:	37
Deposited By:	Jehoshua Bruck
Deposited On:	03 September 2002
Record Number:	CaltechPARADISE:1997.ETR018
Official 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.

Archive Staff Only: edit this record