Computing dominances inEn (short communication)
Information Processing Letters
Output-sensitive peeling of convex and maximal layers
Information Processing Letters
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 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)
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient Processing of Skyline Queries with Partially-Ordered Domains
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
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
Discovering strong skyline points in high dimensional spaces
Proceedings of the 14th ACM international conference on Information and knowledge management
Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
SUBSKY: Efficient Computation of Skylines in Subspaces
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
SaLSa: computing the skyline without scanning the whole sky
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Efficient continuous skyline computation
Information Sciences: an International Journal
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ad-hoc top-k query answering for data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient skyline computation over low-cardinality domains
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approaching the skyline in Z order
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient processing of top-k dominating queries on multi-dimensional data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Dynamic skyline queries in metric spaces
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Monochromatic and bichromatic reverse skyline search over uncertain databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Categorical skylines for streaming data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Caching Dynamic Skyline Queries
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Efficient skyline querying with variable user preferences on nominal attributes
Proceedings of the VLDB Endowment
Dominant and K Nearest Probabilistic Skylines
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Skyline Query Processing for Incomplete Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Scalable skyline computation using object-based space partitioning
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Extract interesting skyline points in high dimension
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Adaptive support framework for wisdom web of things
World Wide Web
Personalized progressive filtering of skyline queries in high dimensional spaces
Proceedings of the 17th International Database Engineering & Applications Symposium
Progressive ranking based on a dominance list
Proceedings of the 7th International Workshop on Ranking in Databases
Hi-index | 0.00 |
In a typical Web recommendation system, objects are often described by many attributes. It also needs to serve many users with a diversified range of preferences. In other words, it must be capable to efficiently support high dimensional preference queries that allow the user to explore the data space effectively without imposing specific preference weightings for each dimension. The skyline query, which can produce a set of objects guaranteed to contain all top ranked objects for any linear attribute preference combination, has been proposed to support this type of recommendation applications. However, it suffers from the problem known as `dimensionality curse' as the size of skyline query result set can grow exponentially with the number of dimensions. Therefore, when the dimensionality is high, a large percentage of objects can become skyline points. This problem makes such a recommendation system less usable for users. In this paper, we propose a stronger type of skyline query, called core skyline query, that adopts a new quality measure called vertical dominance to return only an interesting subset of the traditional skyline points. An efficient query processing method is proposed to find core skyline points using a novel indexing structure called Linked Multiple B'-trees (LMB). Our approach can find such superior skyline points progressively without the need of computing the entire set of skyline points first.