— contact author — Abstract (2008)
Ying Chen, Frank Dehne, A. Rau-chaplin, Todd Eavis
www.scs.carleton.ca/∼teavis The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data...
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel (2006)
Ying Chen, Frank Dehne, Todd Eavis, A. Rau-chaplin
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tasks in large data...
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes (2006)
Y. Chen, A. Rau-Chaplin, F. Dehne, T. Eavis, D. Green, E. Sithirasenan
We present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporates a variety of novel approaches...
Improved data partitioning for building large ROLAP data cubes in parallel (2006)
Ying Chen, Frank Dehne, Todd Eavis, A. Rau-chaplin
www.cs.dal.ca / arc
Building Large ROLAP Data Cubes in Parallel (2004)
Ying Chen, Frank Dehne, Todd Eavis, A. Rau-Chaplin
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tasks in large data...
Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM (1998)
V. Alexandrov, F. Dehne, A. Rau-chaplin, K. Taft
The problem of solving System of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered.
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers (1994)
M. J. Atallah, F. Dehne, R. Miller, A. Rau-Chaplin
The {\em multisearch problem} is defined as follows. Given a data structure $D$ modeled as a graph with $n$ constant-degree nodes, perform $O(n)$ searches on $D$. Let $r$ be the length of the longest...