Computational geometry: an introduction
Computational geometry: an introduction
On the average number of maxima in a set of vectors
Information Processing Letters
Computing dominances inEn (short communication)
Information Processing Letters
The minimum weight dominating set problem for permutation graphs is in NC
Journal of Parallel and Distributed Computing
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
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)
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Querying with Intrinsic Preferences
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Proceedings of the 17th International Conference on Data Engineering
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
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Mining thick skylines over large databases
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
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
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
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
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Efficient Continuous Skyline Computation
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Refreshing the sky: the compressed skycube with efficient support for frequent updates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous Skyline Queries for Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Constrained subspace skyline computation
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Processing relaxed skylines in PDMS using distributed data summaries
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient skyline querying with variable user preferences on nominal attributes
Proceedings of the VLDB Endowment
Scalable skyline computation using object-based space partitioning
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Kernel-based skyline cardinality estimation
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Workload-Driven Compressed Skycube Queries in Wireless Applications
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Proceedings of the VLDB Endowment
QSkycube: efficient skycube computation using point-based space partitioning
Proceedings of the VLDB Endowment
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Parallelizing skyline queries for scalable distribution
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
In-Route skyline querying for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Hi-index | 0.00 |
The skyline query can help identify the “best” objects in a multi-attribute dataset. During the past decade, this query has received considerable attention in the database research community. Most research focused on computing the “skyline” of a dataset, or the set of “skyline objects” that are not dominated by any other object. Such algorithms are not appropriate in an online system, which should respond in real time to skyline query requests with arbitrary subsets of the attributes (also called subspaces). To guarantee real-time response, an online system should precompute the skylines for all subspaces, and look up a skyline upon query. Unfortunately, because the number of subspaces is exponential to the number of attributes, such pre computation has very expensive storage cost and update cost. We propose the Compressed SkyCube (CSC) that is much more compact, yet can still return the skyline of any subspace without consulting the base table. The CSC therefore combines the advantage of precomputation in that it can respond to queries in real time, and the advantage of no-precomputation in that it has efficient space cost and update cost. This article presents the CSC data structures, the CSC query algorithm, the CSC update algorithm, and the CSC initial computation scheme. A solution to extend to high-dimensional data is also proposed.