Sciweavers

6 search results - page 1 / 2
» Relative Prefix Sums: An Efficient Approach for Querying Dyn...
Sort
View
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 6 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, ...
DOLAP
2004
ACM
13 years 10 months ago
PrefixCube: prefix-sharing condensed data cube
BST Condensed Cube is a fully computed cube that condenses those tuples, which are aggregated from the same single base relation tuple, into one physical tuple. Although it has be...
Jianlin Feng, Qiong Fang, Hulin Ding
VLDB
2000
ACM
163views Database» more  VLDB 2000»
13 years 8 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
VLDB
2001
ACM
115views Database» more  VLDB 2001»
13 years 9 months ago
Dynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Ly...
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 9 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....