Computer Science – Databases
Scientific paper
2010-06-18
Computer Science
Databases
31 pages
Scientific paper
Many queries that constrain multiple dimensions simultaneously are difficult to express and compute efficiently in both Structured Query Language (SQL) and multidimensional languages. We introduce the diamond cube operator, filling a gap among existing data warehouse operations. It aids decision support and analysis by facilitating the execution of simultaneous multidimensional queries on data cubes. An example query from the business analysis domain follows. A company wants to close shops and terminate product lines simultaneously. The CEO wants the maximal set of products and shops such that each shop would have sales greater than $400,000, and each product would bring revenues of at least $100,000 - assuming we terminate all other shops and product lines. Diamonds are intrinsically multidimensional and because of the interaction between dimensions the computation of diamond cubes is challenging. We present diamond dicing experiments on large data sets of more than 100 million facts. Our custom Java implementation is more than one hundred times faster, on a large data set, than a popular database engine.
Kaser Owen
Lemire Daniel
Webb Hazel
No associations
LandOfFree
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 Diamond Dicing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diamond Dicing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-260983