Pruning Attribute Values From Data Cubes with Diamond Dicing

Details Pruning Attribute Values From Data Cubes with Diamond Dicing Pruning Attribute Values From Data Cubes with Diamond Dicing

2008-05-06

arxiv.org/abs/0805.0747v1

Computer Science

Databases

Scientific paper

Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to issue multidimensional queries. For example, an analyst may need to select not just the most profitable stores or--separately--the most profitable products, but simultaneous sets of stores and products fulfilling some profitability constraints. To fill this need, we propose a new operator, the diamond dice. Because of the interaction between dimensions, the computation of diamonds is challenging. We present the first diamond-dicing experiments on large data sets. Experiments show that we can compute diamond cubes over fact tables containing 100 million facts in less than 35 minutes using a standard PC.

Affiliated with

Also associated with

No associations

Rating

Pruning Attribute Values From Data Cubes with Diamond Dicing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pruning Attribute Values From Data Cubes with Diamond Dicing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pruning Attribute Values From Data Cubes with Diamond Dicing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209383