Computational geometry: an introduction
Computational geometry: an introduction
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
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 Query Refinement in Multimedia Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
k-Center problems with minimum coverage
Theoretical Computer Science
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th 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
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Processing spatial skyline queries in both vector spaces and spatial network databases
ACM Transactions on Database Systems (TODS)
Spatial Skyline Queries: An Efficient Geometric Algorithm
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or ''not dominated''. Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More specifically, given data points P and query points Q in two-dimensional space, our goal is to retrieve data points that are farther from at least one query point than all the other data points. Such queries are helpful in identifying spatial locations far away from undesirable locations, e.g., unpleasant facilities or business competitors. To solve this problem, we first study a baseline Algorithm TFSS and propose an efficient progressive Algorithm BBFS, which significantly outperforms TFSS by exploiting spatial locality. We also develop an efficient approximation algorithm to trade accuracy for efficiency. We validate our proposed algorithms using extensive evaluations over synthetic and real datasets.