Caching multidimensional queries using chunks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Multidimensional binary search trees used for associative searching
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
DynDex: a dynamic and non-metric space indexer
Proceedings of the tenth ACM international conference on Multimedia
An Index Structure for Efficient Reverse Nearest Neighbor Queries
Proceedings of the 17th 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
Robust Similarity Measures for Mobile Object Trajectories
DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Bulk insertion for R-trees by seeded clustering
Data & Knowledge Engineering
Efficient computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient online top-K retrieval with arbitrary similarity measures
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
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Finding RkNN Straightforwardly with Large Secondary Storage
INGS '08 Proceedings of the 2008 International Workshop on Information-Explosion and Next Generation Search
Efficient Computation of Reverse Skyline on Data Stream
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 01
Reverse skyline search in uncertain databases
ACM Transactions on Database Systems (TODS)
Efficient RkNN retrieval with arbitrary non-metric similarity measures
Proceedings of the VLDB Endowment
Non-metric similarity ranking for image retrieval
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
On efficient reverse k-skyband query processing
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Probabilistic reverse skyline query processing over uncertain data stream
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
Efficient influence-based processing of market research queries
Proceedings of the 21st ACM international conference on Information and knowledge management
A continuous reverse skyline query processing considering the mobility of query objects
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
On efficient reverse skyline query processing
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
A Reverse Skyline query returns all objects whose skyline contains the query object. In this paper, we consider Reverse Skyline query processing where the distance between attribute values are not necessarily metric. We outline real world cases that motivate Reverse Skyline processing in such scenarios. We consider various optimizations to develop efficient algorithms for Reverse Skyline processing. Firstly, we consider block-based processing of objects to optimize on IO costs. We then explore pre-processing to re-arrange objects on disk to speed-up computational and IO costs. We then present our main contribution, which is a method of using group-level reasoning and early pruning to micro-optimize processing by reducing attribute level comparisons. An extensive empirical evaluation with real-world datasets and synthetic data of varying characteristics shows that our optimization techniques are indeed very effective in dramatically speeding Reverse Skyline processing, both in terms of computational costs and IO costs.