Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Generating spatiotemporal datasets on the WWW
ACM SIGMOD Record
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
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
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on 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
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
In-Route skyline querying for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Dominating sets in directed graphs
Information Sciences: an International Journal
MSSQ: manhattan spatial skyline queries
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Spatial skyline queries: exact and approximation algorithms
Geoinformatica
Optimized skyline queries on road networks using nearest neighbors
Personal and Ubiquitous Computing
Range query processing in multi-objective networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Topological operators: a relaxed query processing approach
Geoinformatica
Path skyline for moving objects
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
The Farthest Spatial Skyline Queries
Information Systems
I/O-efficient planar range skyline and attrition priority queues
Proceedings of the 32nd symposium on Principles of database systems
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
MSSQ: Manhattan Spatial Skyline Queries
Information Systems
Hi-index | 0.00 |
In this article, we first introduce the concept of Spatial Skyline Queries (SSQ). Given a set of data points P and a set of query points Q, each data point has a number of derived spatial attributes each of which is the point's distance to a query point. An SSQ retrieves those points of P which are not dominated by any other point in P considering their derived spatial attributes. The main difference with the regular skyline query is that this spatial domination depends on the location of the query points Q. SSQ has application in several domains such as emergency response and online maps. The main intuition and novelty behind our approaches is that we exploit the geometric properties of the SSQ problem space to avoid the exhaustive examination of all the point pairs in P and Q. Consequently, we reduce the complexity of SSQ search from O(|P|2|Q|) to O(|S|2|C| + &sqrt;|P|), where |S| and |C| are the solution size and the number of vertices of the convex hull of Q, respectively. Considering Euclidean distance, we propose two algorithms, B2S2 and VS2, for static query points and one algorithm, VCS2, for streaming Q whose points change location over time (e.g., are mobile). VCS2 exploits the pattern of change in Q to avoid unnecessary recomputation of the skyline and hence efficiently perform updates. We also propose two algorithms, SNS2 and VSNS2, that compute the spatial skyline with respect to the network distance in a spatial network database. Our extensive experiments using real-world datasets verify that both R-tree-based B2S2 and Voronoi-based VS2 outperform the best competitor approach in terms of both processing time and I/O cost. Furthermore, their output computed based on Euclidean distance is a good approximation of the spatial skyline in network space. For accurate computation of spatial skylines in network space, our experiments showed the superiority of VSNS2 over SNS2.