2009 |
24 | EE | Todd Eavis,
Xi Zheng:
Multi-level Frequent Pattern Mining.
DASFAA 2009: 369-383 |
2008 |
23 | EE | Ying Chen,
Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
PnP: sequential, external memory, and parallel iceberg cube computation.
Distributed and Parallel Databases 23(2): 99-126 (2008) |
2007 |
22 | EE | Todd Eavis,
Ahmad Taleb:
Mapgraph: efficient methods for complex olap hierarchies.
CIKM 2007: 465-474 |
21 | EE | Todd Eavis,
Alex Lopez:
Rk-hist: an r-tree based histogram for multi-dimensional selectivity estimation.
CIKM 2007: 475-484 |
20 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Efficient computation of view subsets.
DOLAP 2007: 65-72 |
19 | EE | Todd Eavis,
David Cueva:
A Hilbert Space Compression Architecture for Data Warehouse Environments.
DaWaK 2007: 1-12 |
18 | EE | Todd Eavis,
David Cueva:
The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation.
IDEAS 2007: 241-250 |
17 | EE | Todd Eavis,
George Dimitrov,
Ivan Dimitrov,
David Cueva,
Alex Lopez,
Ahmad Taleb:
Sidera: A Cluster-Based Server for Online Analytical Processing.
OTM Conferences (2) 2007: 1453-1472 |
16 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Boyong Liang:
Compressing Data Cube in Parallel OLAP Systems.
Data Science Journal 6: 184-197 (2007) |
2006 |
15 | EE | Ying Chen,
Andrew Rau-Chaplin,
Frank K. H. A. Dehne,
Todd Eavis,
D. Green,
E. Sithirasenan:
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes.
ICDE 2006: 164 |
14 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
The cgmCUBE project: Optimizing parallel data cube generation for ROLAP.
Distributed and Parallel Databases 19(1): 29-62 (2006) |
2005 |
13 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Parallel querying of ROLAP cubes in the presence of hierarchies.
DOLAP 2005: 89-96 |
12 | EE | Ying Chen,
Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
PnP: Parallel And External Memory Iceberg Cubes.
ICDE 2005: 576-577 |
2004 |
11 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Top-Down Computation of Partial ROLAP Data Cubes.
HICSS 2004 |
10 | EE | Ying Chen,
Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Building Large ROLAP Data Cubes in Parallel.
IDEAS 2004: 367-377 |
9 | EE | Ying Chen,
Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors.
Distributed and Parallel Databases 15(3): 219-236 (2004) |
2003 |
8 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Parallel Multi-Dimensional ROLAP Indexing.
CCGRID 2003: 86- |
7 | EE | Ying Chen,
Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors.
IPDPS 2003: 70 |
2002 |
6 | | Frank K. H. A. Dehne,
Todd Eavis,
Susanne E. Hambrusch,
Andrew Rau-Chaplin:
Parallelizing the Data Cube.
Distributed and Parallel Databases 11(2): 181-201 (2002) |
2001 |
5 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
A Cluster Architecture for Parallel Data Warehousing.
CCGRID 2001: 161-168 |
4 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Susanne E. Hambrusch,
Andrew Rau-Chaplin:
Parallelizing the Data Cube.
ICDT 2001: 129-143 |
3 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining.
International Conference on Computational Science (2) 2001: 589-598 |
2 | EE | Frank K. H. A. Dehne,
Todd Eavis,
Andrew Rau-Chaplin:
Computing Partial Data Cubes for Parallel Data Warehousing Applications.
PVM/MPI 2001: 319-326 |
2000 |
1 | EE | Todd Eavis,
Nathalie Japkowicz:
A Recognition-Based Alternative to Discrimination-Based Multi-layer Perceptrons.
Canadian Conference on AI 2000: 280-292 |