Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A greedy algorithm for bulk loading R-trees
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Influence sets based on reverse nearest neighbor queries
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
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 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
Constrained subspace skyline computation
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Efficient Skyline and Top-k Retrieval in Subspaces
IEEE Transactions on Knowledge and Data Engineering
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Location-Dependent Skyline Query
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Reverse ranking query over imprecise spatial data
Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application
Z-SKY: an efficient skyline query processing framework based on Z-order
The VLDB Journal — The International Journal on Very Large Data Bases
Location-Dependent Skyline Query Processing in Mobile Databases
WISA '10 Proceedings of the 2010 Seventh Web Information Systems and Applications Conference
| Hi-index | 0.00 |
With respect to a given query point q, a location-dependent skyline query (LDSQ) finds all objects that are not spatially dominated by any other in a specified set of objects. An object o is considered to spatially dominate another o' if o is not worse than o' for all search criteria and strictly better than o' for at least one of the search criteria. Here, the search criteria include the objects' nearness to q and their non-spatial attributes. LDSQs have many valuable applications that need to find the best and nearest objects. Nevertheless, efficient evaluation of LDSQs faces challenges due to exhaustive comparisons among objects in determining their spatial dominance relationships which in turn depend on query points at the run time. In this paper, we introduce a notion of non-dominance scopes. For each object, a non-dominance scope is an area in which query points find the object not spatially dominated by other objects. With non-dominance scopes, LDSQs are simplified as searches for objects whose non-dominance scopes enclose query points. We develop algorithms to compute non-dominance scopes and evaluate LDSQs using indexed non-dominance scopes. We also evaluate our proposed approach. The experiment results show the outstanding performance of our proposed approach.