Cubes convexes

Details Cubes convexes Cubes convexes

2010-03-26

arxiv.org/abs/1003.5056v1

Revue des Sciences et Technologies de l'Information (S\'erie Ing\'enierie des Syst\`emes d'Information) 11, 6 (2006) 11-31

Computer Science

Databases

Scientific paper

10.3166/isi.11.6.11-31

In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the concept of convex cube which captures all the tuples of a datacube satisfying a constraint combination. It can be represented in a very compact way in order to optimize both computation time and required storage space. The convex cube is not an additional structure appended to the list of cube variants but we propose it as a unifying structure that we use to characterize, in a simple, sound and homogeneous way, the other quoted types of cubes. Finally, we introduce the concept of emerging cube which captures the significant trend inversions. characterizations.

Affiliated with

Also associated with

No associations

Rating

Cubes convexes 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 Cubes convexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cubes convexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182056