Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Proceedings of the 17th International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Fast Time Sequence Indexing for Arbitrary Lp Norms
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Supporting Content-Based Searches on Time Series via Approximation
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
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
SUBSKY: Efficient Computation of Skylines in Subspaces
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
High dimensional nearest neighbor searching
Information Systems
Reverse Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Shooting stars in the sky: an online algorithm for skyline queries
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
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 computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Skyline Query Processing for Incomplete Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Answering preference queries with bit-sliced index arithmetic
Proceedings of the 2008 C3S2E conference
Efficient skyline computation in metric space
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Scalable skyline computation using object-based space partitioning
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Reverse skyline search in uncertain databases
ACM Transactions on Database Systems (TODS)
Z-SKY: an efficient skyline query processing framework based on Z-order
The VLDB Journal — The International Journal on Very Large Data Bases
Preference query evaluation over expensive attributes
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Identifying the most influential user preference from an assorted collection
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Efficient skyline evaluation over partially ordered domains
Proceedings of the VLDB Endowment
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Continuous monitoring of skylines over uncertain data streams
Information Sciences: an International Journal
Optimized skyline queries on road networks using nearest neighbors
Personal and Ubiquitous Computing
Shooting top-k stars in uncertain databases
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
Dynamic skyline queries in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Discovering the most potential stars in social networks with infra-skyline queries
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Probabilistic ranking in fuzzy object databases
Proceedings of the 21st ACM international conference on Information and knowledge management
The Farthest Spatial Skyline Queries
Information Systems
Subspace global skyline query processing
Proceedings of the 16th International Conference on Extending Database Technology
Spatial inverse query processing
Geoinformatica
Parallel skyline queries over uncertain data streams in cloud computing environments
International Journal of Web and Grid Services
Hi-index | 0.00 |
Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the database whose attribute vector is not dominated by that of any other objects. Previous methods to retrieve skyline points usually assume static data objects in the database (i.e. their attribute vectors are fixed), whereas several recent work focus on skyline queries with dynamic attributes. In this paper, we propose a novel variant of skyline queries, namely metric skyline, whose dynamic attributes are defined in the metric space (i.e. not limited to the Euclidean space). We illustrate an efficient and effective pruning mechanism to answer metric skyline queries through a metric index. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed pruning techniques over the metric index in answering metric skyline queries.