电子学报2016，Vol.44Issue(6)：1343-1348,6.DOI:10.3969/j.issn.0372-2112.2016.06.012
空间近似关键字反远邻查询
Approxi mate String Reverse Fu rthest Neighbors Search
摘要
Abstract
The points of spatial dataset usually consist of the spatial information and the described text information. The problem of approximate string reverse furthest neighbors search(ASRFNS)query is defined to search all points in a spatial dataset that take the given query point as its furthest neighbor while their text satisfies the string similarity constraint. Based on the existing reverse furthest neighbors search algorithm and approximate string search algorithm,we proposed two solution algorithms:the convex hull furthest cells join algorithm(CHFCsJoin)and the convex hull furthest cell approximate string serial search algorithm(CHFCASSS).In order to further improve the query performance,we also proposed an efficient algorithm of the convex hull furthest cell filter-Rtree(CHFilterRtree)which contains disk resident structure of space and keyword information.With the real dataset experiments and analysis,the results demonstrate that our proposed algorithms ob-tained a good performance.关键词
近似查询/反远邻查询/空间数据库/外存索引Key words
approximate string search/reverse furthest neighbors search/spatial database/disk resident index分类
信息技术与安全科学引用本文复制引用
邰伟鹏,岳建华,邓育,陈业斌,秦锋..空间近似关键字反远邻查询[J].电子学报,2016,44(6):1343-1348,6.基金项目
国家自然科学基金项目（No．61003311）；安徽高校省级自然科学研究重大项目（No．KJ2014ZD05）；安徽高校省级自然科学研究重点项目（No．KJ2013Z023，No．KJ2013A058）；安徽省振兴计划资助项目 （）
