Sciweavers

23 search results - page 2 / 5
» On the q-Analogue of the Sum of Cubes
Sort
View
TKDE
2012
278views Formal Methods» more  TKDE 2012»
11 years 7 months ago
Data Cube Materialization and Mining over MapReduce
—Computing interesting measures for data cubes and subsequent mining of interesting cube groups over massive datasets are critical for many important analyses done in the real wo...
Arnab Nandi, Cong Yu, Philip Bohannon, Raghu Ramak...
DAWAK
2004
Springer
13 years 8 months ago
Space-Efficient Range-Sum Queries in OLAP
Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
Fredrik Bengtsson, Jingsen Chen
EACL
2009
ACL Anthology
14 years 5 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 5 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
DEXA
2008
Springer
154views Database» more  DEXA 2008»
13 years 6 months ago
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have...
Wen-Chi Hou, Cheng Luo, Zhewei Jiang, Feng Yan, Qi...