Notes of “Quotient Cube: How to Summarize the Semantics of a Data Cube”

Notes of "Quotient Cube: How to Summarize the Semantics of a Data Cube"

•1. Terminology(相关术语)

Roll up：向上综合

Drill down：向下细化或者向下钻取

w.r.t. ：with respect to 关于

lattice: A lattice is partially ordered set (L, ≼) such that every pair of elements in has a least upper bound (lub) and a greatest lower bound (glb)

•2. Cube lattice and Partition

2.1 Convex Partitions

A convex partition retains semantics:

C₁ roll up C₂, C₂ roll up C₃, C₁ C₃ ∈CLS, and we get C₂∈CLS

Convexity means "holes" cannot exist in classes.

2.2 Proposition 1 [Count and sum]

The equivalence relation defined solely on the basis of equality of count values is always convex. Suppose the domain of the measure attribute contain only non-negative (or only non-positive) values. Then equivalence defined solely on the basis of equality of sum values is convex.

The proposition follows from the observation that whenever there is a cell c'' in between c and c', i.e. c≼c''≼c', c'' must contain all tuples that c' has, and for COUNT and SUM on positive measure, it cannot form a hole.

We say an equivalence class is connected if its local internal structure is a connected DAG. DAG is short for Directed Acyclic Graphic ( 有向无圈图 ).

Specifically, say that two cells c and c' are cover equivalent, c ≡ Cov c', provided the tuples contained in those cells is the same.

2.3 Lemma 1 [Cover Partition]

         Let Pcov be the partition associated with the co