P-Cube: Answering Preference Queries in Multi-Dimensional Space

Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes top-k queries and skyline queries. An analytical query often comes with a set of boolean predicates that constrain a target subset of data, which, may also vary incrementally by drilling/rolling operators. To efficiently support preference queries with multiple boolean predicates, neither boolean-thenpreference 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 progress...

• Type: Conference
• Year: 2008
• Where: ICDE
• Authors: Dong Xin, Jiawei Han
• Keywords: Database, ICDE 2008, Multiple Boolean Predicates, Preference Pruning, Typical Preference Queries