Refreshing the sky: the compressed skycube with efficient support for frequent updates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Algorithms and analyses for maximal vector computation
The VLDB Journal — The International Journal on Very Large Data Bases
SaLSa: computing the skyline without scanning the whole sky
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Constrained subspace skyline computation
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient computation of reverse skyline queries
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
Continuous k-dominant skyline computation on multidimensional data streams
Proceedings of the 2008 ACM symposium on Applied computing
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Adaptive Mining the Approximate Skyline over Data Stream
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
DC-Tree: An Algorithm for Skyline Query on Data Streams
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Finding the influence set through skylines
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient skyline retrieval with arbitrary similarity measures
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Dominant and K Nearest Probabilistic Skylines
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Skyframe: a framework for skyline query processing in peer-to-peer systems
The VLDB Journal — The International Journal on Very Large Data Bases
Multi-dimensional top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
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
Bandwidth-constrained distributed skyline computation
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Workload-Driven Compressed Skycube Queries in Wireless Applications
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Skyline View: Efficient Distributed Subspace Skyline Computation
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Skyline queries with constraints: Integrating skyline and traditional query operators
Data & Knowledge Engineering
Location-aware privacy and more: a systems approach using context-aware database management systems
Proceedings of the 2nd SIGSPATIAL ACM GIS 2009 International Workshop on Security and Privacy in GIS and LBS
Reverse skyline search in uncertain databases
ACM Transactions on Database Systems (TODS)
Efficient mining of skyline objects in subspaces over data streams
Knowledge and Information Systems
Continuous adaptive mining the thin skylines over evolving data stream
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Data & Knowledge Engineering
Identifying the most influential user preference from an assorted collection
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Proceedings of the VLDB Endowment
Efficient skyline evaluation over partially ordered domains
Proceedings of the VLDB Endowment
QSkycube: efficient skycube computation using point-based space partitioning
Proceedings of the VLDB Endowment
Efficient distributed skyline queries for mobile applications
Journal of Computer Science and Technology
Ranking uncertain sky: The probabilistic top-k skyline operator
Information Systems
Skyline query processing over joins
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
Progressive processing of subspace dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods
Journal of Intelligent Information Systems
Multi-attribute optimization in service selection
World Wide Web
Parallelizing progressive computation for skyline queries in multi-disk environment
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Supporting efficient distributed skyline computation using skyline views
Information Sciences: an International Journal
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
Continuous distance-based skyline queries in road networks
Information Systems
A survey of skyline processing in highly distributed environments
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic top-k dominating queries in uncertain databases
Information Sciences: an International Journal
Efficient computation of combinatorial skyline queries
Information Systems
Computing immutable regions for subspace top-k queries
Proceedings of the VLDB Endowment
Subspace global skyline query processing
Proceedings of the 16th International Conference on Extending Database Technology
Branch-and-bound algorithm for reverse top-k queries
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Spatial inverse query processing
Geoinformatica
Secured obfuscated queries in spatial networks
International Journal of Wireless and Mobile Computing
Toward efficient multidimensional subspace skyline computation
The VLDB Journal — The International Journal on Very Large Data Bases
Evaluating continuous top-k queries over document streams
World Wide Web
Energy-efficient filtering for skyline queries in cluster-based sensor networks
Computers and Electrical Engineering
Hi-index | 0.00 |
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that require skyline analysis usually provide numerous candidate attributes, and various users depending on their interests may issue queries regarding different (small) subsets of the dimensions. Formally, given a relation with a large number (e.g.,ge 10) of attributes, a query aims at finding the skyline in an arbitrary subspace with a low dimensionality (e.g., 2). The existing algorithms do not support subspace skyline retrieval efficiently because they (i) require scanning the entire database at least once, or (ii) are optimized for one particular subspace but incur significant overhead for other subspaces. In this paper, we propose a technique SUBSKY which settles the problem using a single B-tree, and can be implemented in any relational database. The core of SUBSKY is a transformation that converts multi-dimensional data to 1D values, and enables several effective pruning heuristics. Extensive experiments with real data confirm that SUBSKY outperforms alternative approaches significantly in both efficiency and scalability.