Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (18): 19-21.

• 博士论坛 • Previous Articles     Next Articles

Research on best location query algorithm in spatial database

XU Hongbo1,HAN Qilong2,PAN Haiwei2   

  1. 1.College of Computer and Information Engineering,Harbin University of Commerce,Harbin 150028,China
    2.College of Computer Science and Technology,Harbin Engineering University,Harbin 150001,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-06-21 Published:2011-06-21

空间数据库最优位置查询算法研究

徐红波1,韩启龙2,潘海为2   

  1. 1.哈尔滨商业大学 计算机与信息工程学院,哈尔滨 150028
    2.哈尔滨工程大学 计算机科学与技术学院,哈尔滨 150001

Abstract: As to the demand of real application,this paper presents a new kind of spatial query type,best location query.After describing real application,it presents the best location query,the priority of target object,the heuristic rule to delete data objects,and analyzes the time complexity of the algorithm.The experimental result shows that the query efficiency of the optimal location query algorithm remains effective with the parameters varying.

Key words: spatial database, best location query, priority, heuristic rule, query algorithm

摘要: 针对实际应用的查询要求,提出一种新颖的空间数据库查询类型—最优位置查询。在叙述实际应用的基础上抽象出最优位置查询概念,提出目标对象的优先权度量标准、删减数据对象的启发式规则和最优位置查询算法,分析最优位置查询算法的时间复杂度。实验结果表明,在参数不同取值情况下最优位置查询算法的查询性能仍然高效。

关键词: 空间数据库, 最优位置查询, 优先权, 启发式规则, 查询算法