湖北民族学院学报（自然科学版）2016，Vol.34Issue(3)：241-245,5.DOI:10.13501/j.cnki.42-1569/n.2016.09.001
支持多子串近似匹配的空间关键词查询算法
Support Multi Approx imate Strin g Matching Keywords Space Query Algorithm
摘要
Abstract
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 algo-rithm, 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 ef-ficiency of query .关键词
空间数据库/q-gram倒排索引/查询算法/RB-treeKey words
spatial database/q-gram inverted index/query algorithm/RB-tree分类
信息技术与安全科学引用本文复制引用
张素智,丁温雪,徐家兴..支持多子串近似匹配的空间关键词查询算法[J].湖北民族学院学报（自然科学版）,2016,34(3):241-245,5.基金项目
国家自然科学基金项目（61201447）． （）
