支持多子串近似匹配的空间关键词查询算法  

Support Multi Approximate String Matching Keywords Space Query Algorithm

作　　者：张素智[1] 丁温雪 徐家兴[1] 

机构地区：[1]郑州轻工业学院计算机与通信工程学院,河南郑州450002

出　　处：《湖北民族学院学报（自然科学版）》2016年第3期241-245,共5页Journal of Hubei Minzu University(Natural Science Edition)

基　　金：国家自然科学基金项目(61201447)

摘　　要：随着空间数据飞速增长,不仅POI(Point Of Interest)越来越密集,而且每个空间点的文本描述也越来越多,以往关键词近似查询算法中,不同长度的关键词需要不同的阈值相匹配,影响查询效率和查询结果.针对以上不足提出了支持空间多子串近似匹配的空间关键词查询算法,在该算法中不需要考虑阈值的改变,而是将编辑距离直接应用到索引结构中.通过真实数据进行实验,表明该算法在查询精准性和查询效率上都有较大的提高.With the rapid growth of spatial data,POI（ Points of Interest,referred to as POI） is becoming more and more intensive,and the text description of each spatial point is also gradually increasing. In previous key words approximate query algorithm,the key words of different length match with different thresholds,which affect the efficiency of query and query results. In view of the above problem is proposed to support multi space on the approximation space of keyword matching query algorithm,in this algorithm,it is not needed to consider the change of threshold,because edit distance is directly applied to the index structure. The simulation results show that the proposed algorithm can improve the accuracy and efficiency of query.

关 键 词：空间数据库 q-gram倒排索引 查询算法 RB-tree 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]