Adjoined Dimension Column Clustering to Improve Data Warehouse Query Performance

Authors:
Xuedong Chen;Patrick O'Neil;Elizabeth O'Neil
Affiliations:
Computer Science Department, University of Massachusetts Boston, 100 Morrissey Boulevard, Boston, MA 02125, U.S.A. xuedchen@cs.umb.edu;Computer Science Department, University of Massachusetts Boston, 100 Morrissey Boulevard, Boston, MA 02125, U.S.A. poneil@cs.umb.edu;Computer Science Department, University of Massachusetts Boston, 100 Morrissey Boulevard, Boston, MA 02125, U.S.A. eoneil@cs.umb.edu
Venue:
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Year:
2008

Citing 0
Cited 5

Column-stores vs. row-stores: how different are they really?

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Correlation maps: a compressed access method for exploiting soft functional dependencies

Proceedings of the VLDB Endowment
Positional update handling in column stores

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
CORADD: correlation aware database designer for materialized views and indexes

Proceedings of the VLDB Endowment
Clydesdale: structured data processing on MapReduce

Proceedings of the 15th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Columns of dimension tables that are frequently restricted in queries on a star schema database are materialized into the fact table by various means, depending on database product features. This makes it possible to create a multi-dimensional partitioning on the fact table, so that many queries restricting columns in hierarchies of the columns materialized will retrieve only a small number of cells of a rectangular subset of the partitioning. We believe this approach to be a previously undiscovered, though seemingly obvious, method to accelerate query performance.