Bulk-insertions into R-trees using the small-tree-large-tree approach
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
IEEE Transactions on Knowledge and Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Cost Model for Estimating the Performance of Spatial Joins Using R-trees
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Adaptive nearest neighbor queries in travel time networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Moving objects in networks databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
The weighted shortest path search based on multi-agents in mobile GIS management services
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
We investigate optimization strategies for processing path queries with embedded spatial constraints, such as avoiding areas with certain characteristics. To resolve complex spatial constraints during path finding, we consider two decisions: (1) the spatial relation operations (e.g., intersect) between areas and links can be preprocessed or intermixed with path finding and (2) areas satisfying the query constraint can be prefiltered or dynamically selected during path finding. Based on these two decisions, we propose and implement the resulting four integrated query processing strategies, utilizing state-of-the-art technologies such as spatial joins for intersect computation, R-tree access structure for spatial overlap search, and spatial clustering for efficient path search. In this paper, we also report an experimental evaluation to show which strategies perform best in different scenarios.