SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
On Approximate Algorithms for Distance-Based Queries using R-trees
The Computer Journal
K nearest neighbor search in navigation systems
Mobile Information Systems
Efficient Approximation of Spatial Network Queries using the M-Tree with Road Network Embedding
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Continuous Range Search Query Processing in Mobile Navigation
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
The Effect of Corners on the Complexity of Approximate Range Searching
Discrete & Computational Geometry
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
Voronoi-based range and continuous range query processing in mobile databases
Journal of Computer and System Sciences
Voronoi-based multi-level range search in mobile navigation
Multimedia Tools and Applications
Optimized skyline queries on road networks using nearest neighbors
Personal and Ubiquitous Computing
Efficient Monitoring of Moving Mobile Device Range Queries using Dynamic Safe Regions
Proceedings of International Conference on Advances in Mobile Computing & Multimedia
Hi-index | 0.01 |
Spatial range search is to find interest objects within a given radius. This type of query is common in a mobile environment as mobile users are able to find surrounding interest objects. Traditionally, a range search query will return all objects within a given radius. However, in many circumstances, having all objects is not necessary, especially when there are already enough objects closer to the query point. Also in other circumstance, expanding the radius may give users better results, especially when there are a lot of objects just outside the search boundary. Therefore, in this paper, we focus on approximate range search, where the query results are approximate, rather than exact. We propose γ approximate static range search (ARS). Using ARS, we are able to deliver a better performance, yet low false hit and reasonable false miss. We also extend ARS in the context of continuous query setting, in which the query moves. This is particularly important in mobile navigation as a mobile user who invokes the query moves. In continuous range search, the aim is to find split points; the locations where the query results will be updated. We propose two methods for approximate continuous range search (ACRS), namely (i) minimizing range search, and (ii) minimizing split points. Our performance evaluation which compares our methods with the traditional continuous range search shows that our methods reduce number of split points considerably, and hence improving overall performance.