Sciweavers

5640 search results - page 30 / 1128
» Parallelizing the Data Cube
Sort
View
PDIS
1994
IEEE
13 years 11 months ago
An Efficient Parallel Join Algorithm Based On Hypercube-Partitioning
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
Hwan-Ik Choi, Byoung Mo Im, Myoung-Ho Kim, Yoon-Jo...
VLDB
2007
ACM
179views Database» more  VLDB 2007»
14 years 7 months ago
Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
Xiaolei Li, Jiawei Han
AMC
2004
97views more  AMC 2004»
13 years 7 months ago
Analysis of three-dimensional grids: the eight-point cube
It is widely believed that quadratic coefficients cannot be estimated from eight data in cubical array. This paper illustrates the estimation of those coefficients by means of by ...
G. L. Silver
DMDW
2001
127views Management» more  DMDW 2001»
13 years 9 months ago
MAC: Conceptual data modeling for OLAP
In this paper we address the issue of conceptual modeling of data used in multidimensional analysis. We view the problem from the end-user point of view and we describe a set of r...
Aris Tsois, Nikos Karayannidis, Timos K. Sellis
MOC
1998
107views more  MOC 1998»
13 years 7 months ago
A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
Suely Oliveira