5640 search results - page 10 / 1128 » Parallelizing the Data Cube |
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
CLEIEJ
1998
13 years 7 months ago
1998
Parallel disk I/O subsystems are becoming more important in today’s large-scale parallel machines. Parallel disk systems provide a significant boost in I/O performance reducing ...
PPSC
1993
13 years 8 months ago
1993
Scalable parallel computers with TFLOPS (Trillion FLoating Point Operations Per Second) performance levels are now under construction. While we believe TFLOPS processor technology...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
ICDE
1999
IEEE
14 years 8 months ago
1999
IEEE
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 ...