面向实际道路网络模型的空间资源Top-k查询算法  

Spatial Resource Top-k Query Algorithm Facing Real Road Network Model

作　　者：马武彬[1] 刘明星[1] 黄宏斌[1] 邓苏[1] 

机构地区：[1]国防科学技术大学信息系统工程重点实验室,长沙410073

出　　处：《计算机研究与发展》2013年第S1期171-178,共8页Journal of Computer Research and Development

摘　　要：空间资源的索引查询广泛应用在多个位置服务平台上(Google地图、百度地图等),基于欧氏空间或者普通网络图的资源查询算法对于实际道路情况考虑不完全,影响实际应用效果.在已有工作基础上,提出改进的实际道路网络模型,并设计以边为引导的查询(directed from edge,DFE)算法、以点为引导的查询(directed from point,DFP)算法和结合IR-tree的改进查询(IR-tree query,IR-TQ)算法.通过真实数据进行实验,验证算法的可行性.Index and query of spatial resource is widely used by located-service platform,such as Google maps,Baidu maps.The real instance of road network was not considered in the normal network and Euclid distance based query algorithm.The improving real road network mode is proposed based on the existing work.The algorithms named directed from edge(DFE),directed from point(DBP)and IR-tree query(IR-TQ)are designed.The experimental results used real datasets demonstrate the feasible of the algorithm.

关 键 词：道路网络 基于位置的服务 空间资源查询 TOP-K查询 IR-tree 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]