Instance optimal query processing in spatial networks

Ke Deng, Xiaofang Zhou, Heng Tao Shen, Shazia Sadiq, Xue Li
2008 The VLDB journal  
The performance optimization of query processing in spatial networks focuses on minimizing network data accesses and the cost of network distance calculations. This paper proposes algorithms for network k-NN queries, range queries, closest-pair queries and multi-source skyline queries based on a novel processing framework, namely, incremental lower bound constraint. By giving high processing priority to the query associated data points and utilizing the incremental nature of the lower bound,
more » ... performance of our algorithms is better optimized in contrast to the corresponding algorithms based on known framework incremental Euclidean restriction and incremental network expansion. More importantly, the proposed algorithms are proven to be instance optimal among classes of algorithms. Through experiments on real road network datasets, the superiority of the proposed algorithms is demonstrated.
doi:10.1007/s00778-008-0115-0 fatcat:5vwfwxkyengfvlpbnpkfy3g5ce