TY - GEN
T1 - P-Cube
T2 - 2008 IEEE 24th International Conference on Data Engineering, ICDE'08
AU - Xin, Dong
AU - Han, Jiawei
PY - 2008
Y1 - 2008
N2 - Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multi-dimensional boolean selections. Typical preference queries includes lop-k queries and skyline queries. An analytical query often comes with a set of boolean predicates that constrain a largel subsel of data, which, may also vary incrementally by drilling/rolling operators. To efficiently support preference queries with multiple boolean predicates, neither boolean-then-preference nor preference-then-boolean approach is satisfactory. To integrate boolean pruning and preference pruning in a unified framework, we propose signature, a new materialization measure for multi-dimensional group-bys. Based on this, we propose P-Cube (i.e., data cube for preference queries) and study its complete life cycle, including signature generation, compression, decomposition, incremental maintenance and usage for efficient on-line analytical query processing. We present a signature-based progressive algorithm that is able to simultaneously push boolean and preference constraints deep into the database search. Our performance study shows that the proposed method achieves al least one order of magnitude speed-up over existing approaches.
AB - Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multi-dimensional boolean selections. Typical preference queries includes lop-k queries and skyline queries. An analytical query often comes with a set of boolean predicates that constrain a largel subsel of data, which, may also vary incrementally by drilling/rolling operators. To efficiently support preference queries with multiple boolean predicates, neither boolean-then-preference nor preference-then-boolean approach is satisfactory. To integrate boolean pruning and preference pruning in a unified framework, we propose signature, a new materialization measure for multi-dimensional group-bys. Based on this, we propose P-Cube (i.e., data cube for preference queries) and study its complete life cycle, including signature generation, compression, decomposition, incremental maintenance and usage for efficient on-line analytical query processing. We present a signature-based progressive algorithm that is able to simultaneously push boolean and preference constraints deep into the database search. Our performance study shows that the proposed method achieves al least one order of magnitude speed-up over existing approaches.
UR - http://www.scopus.com/inward/record.url?scp=52649178259&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52649178259&partnerID=8YFLogxK
U2 - 10.1109/ICDE.2008.4497518
DO - 10.1109/ICDE.2008.4497518
M3 - Conference contribution
AN - SCOPUS:52649178259
SN - 9781424418374
T3 - Proceedings - International Conference on Data Engineering
SP - 1092
EP - 1100
BT - Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08
Y2 - 7 April 2008 through 12 April 2008
ER -