Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Label correcting methods to solve multicriteria shortest path problems
Journal of Optimization Theory and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Processing spatial skyline queries in both vector spaces and spatial network databases
ACM Transactions on Database Systems (TODS)
Efficient k-nearest neighbor search in time-dependent spatial networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
| Hi-index | 0.00 |
The class of spatial query over the networks has been extensively studied in the past decade. However, most of the current research focuses on the single objective solution, which is based on the optimization of one objective function. In this paper, we propose a framework to address one type of the multi-objective spatial query problems (i.e., the range query) on the road networks. Towards this end, we utilize a filtering and refinement paradigm to significantly prune the search space and localize the expensive refinement operation within a small candidate space. We experimentally verified the applicability and efficiency of the proposed method with real world datasets.