On the average number of maxima in a set of vectors
Information Processing Letters
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An array-based algorithm for simultaneous multidimensional aggregates
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Efficient computation of Iceberg cubes with complex measures
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Proceedings of the 17th International Conference on Data Engineering
Fast Computation of Sparse Datacubes
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Finding Intensional Knowledge of Distance-Based Outliers
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
QC-trees: an efficient summary structure for semantic OLAP
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
On the complexity of inducing categorical and quantitative association rules
Theoretical Computer Science
The complexity of mining maximal frequent itemsets and maximal frequent patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Catching the best views of skyline: a semantic approach based on decisive subspaces
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Refreshing the sky: the compressed skycube with efficient support for frequent updates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Star-cubing: computing iceberg cubes by top-down and bottom-up integration
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Multi-objective query processing for database systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximately dominating representatives
ICDT'05 Proceedings of the 10th international conference on Database Theory
Supporting personalized top-k skyline queries using partial compressed skycube
Proceedings of the 9th annual ACM international workshop on Web information and data management
Efficient skyline querying with variable user preferences on nominal attributes
Proceedings of the VLDB Endowment
Personalized top-k skyline queries in high-dimensional space
Information Systems
Top-k dominant web services under multi-criteria matching
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Emerging Cubes: Borders, size estimations and lossless reductions
Information Systems
Multi-dimensional top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Data & Knowledge Engineering
Discovering relative importance of skyline attributes
Proceedings of the VLDB Endowment
Efficient mining of skyline objects in subspaces over data streams
Knowledge and Information Systems
A fast and progressive algorithm for skyline queries with totally- and partially-ordered domains
Journal of Systems and Software
Efficiently selecting the best web services
RED'09 Proceedings of the 2nd international conference on Resource discovery
An efficient skyline framework for matchmaking applications
Journal of Network and Computer Applications
Proceedings of the VLDB Endowment
QSkycube: efficient skycube computation using point-based space partitioning
Proceedings of the VLDB Endowment
A clustering based approach for skyline diversity
Expert Systems with Applications: An International Journal
The agree concept lattice for multidimensional database analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Prominent streak discovery in sequence data
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding the most desirable skyline objects
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
ACM Transactions on Database Systems (TODS)
Online subspace skyline query processing using the compressed skycube
ACM Transactions on Database Systems (TODS)
Information filtering by using materialized skyline view
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient processing of multiple continuous skyline queries over a data stream
Information Sciences: an International Journal
Skyline queries, front and back
ACM SIGMOD Record
On efficient reverse skyline query processing
Expert Systems with Applications: An International Journal
Toward efficient multidimensional subspace skyline computation
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently Producing the K Nearest Neighbors in the Skyline on Vertically Partitioned Tables
International Journal of Information Retrieval Research
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
Hi-index | 0.00 |
The skyline operator is important for multicriteria decision-making applications. Although many recent studies developed efficient methods to compute skyline objects in a given space, none of them considers skylines in multiple subspaces simultaneously. More importantly, the fundamental problem on the semantics of skylines remains open: Why and in which subspaces is (or is not) an object in the skyline? Practically, users may also be interested in the skylines in any subspaces. Then, what is the relationship between the skylines in the subspaces and those in the super-spaces? How can we effectively analyze the subspace skylines? Can we efficiently compute skylines in various subspaces and answer various analytical queries?In this article, we tackle the problem of multidimensional subspace skyline computation and analysis. We explore skylines in subspaces. First, we propose the concept of Skycube, which consists of skylines of all possible nonempty subspaces of a given full space. Once a Skycube is materialized, any subspace skyline queries can be answered online. However, Skycube cannot fully address the semantic concerns and may contain redundant information. To tackle the problem, we introduce a novel notion of skyline group which essentially is a group of objects that coincide in the skylines of some subspaces. We identify the decisive subspaces that qualify skyline groups in the subspace skylines. The new notions concisely capture the semantics and the structures of skylines in various subspaces. Multidimensional roll-up and drill-down analysis is introduced. We also develop efficient algorithms to compute Skycube, skyline groups and their decisive subspaces. A systematic performance study using both real data sets and synthetic data sets is reported to evaluate our approach.