Computing geodesic furthest neighbors in simple polygons
Journal of Computer and System Sciences
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
Incremental Processing of Continual Range Queries over Moving Objects
IEEE Transactions on Knowledge and Data Engineering
iSEE: Efficient Continuous K-Nearest-Neighbor Monitoring over Moving Objects
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
All Farthest Neighbors in the Presence of Highways and Obstacles
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Lazy updates: an efficient technique to continuously monitoring reverse kNN
Proceedings of the VLDB Endowment
Circulartrip: an effective algorithm for continuous kNN queries
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Efficient methods in finding aggregate nearest neighbor by projection-based filtering
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Efficient algorithms to monitor continuous constrained k nearest neighbor queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Efficiently processing snapshot and continuous reverse k nearest neighbors queries
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Continuous monitoring of spatial queries has gained significant research attention in the past few years. Although numerous algorithms have been proposed to solve specific queries, there does not exist a unified algorithm that solves a broad class of spatial queries. In this paper, we first define a versatile top-k query and show that various important spatial queries can be modeled to a versatile top-k query by defining a suitable scoring function. Then, we propose an efficient algorithm to continuously monitor the versatile top-k queries. To show the effectiveness of our proposed approach, we model various inherently different spatial queries to the versatile top-k query and conduct experiments to show the efficiency of our unified algorithm. The extensive experimental results demonstrate that our unified algorithm is several times faster than the existing best known algorithms for monitoring constrained k nearest neighbors queries, furthest k neighbors queries and aggregate k nearest neighbors queries.