空间关键字top-k查询的why问题  

Why question on spatial keyword top-k queries

作　　者：黄金亮 李艳红[1] 卢航 HUANG Jinliang;LI Yanhong;LU Hang(College of Computer Sciences,South-Central Minzu University,Wuhan 430074,China)

机构地区：[1]中南民族大学计算机科学学院,武汉430074

出　　处：《中南民族大学学报（自然科学版）》2024年第1期61-68,共8页Journal of South-Central University for Nationalities：Natural Science Edition

基　　金：国家自然科学基金资助项目(61309002);湖北省自然科学基金资助项目(2017CFB135);中央高校基本科研业务费专项资金资助项目(CZY23019)。

摘　　要：为提高空间关键字top-k查询的why问题处理效率,设计了一种名为WIR-tree的索引结构,以在访问非叶子结点下的子树之前,先估算其索引的所有对象与查询之间的空间距离和文本相似性的上限值,进而进行剪枝操作.此外,基于所构建的WIR-tree,提出了一种WSKQK算法,通过编辑距离递增方式枚举关键字集,并结合查询处理提早结束策略,加速空间关键字top-k查询why问题的整个处理过程.最后,通过与现有的基于setR-tree索引的BS算法进行对比实验,验证了所提方法的高效性和可扩展性.In order to improve the processing efficiency of the why questions on spatial keyword top-k queries,an index structure named WIR-tree is designed.Before accessing the subtree under the non-leaf node,the upper bounds of spatial distance and text similarity between all the objects indexed and the query are estimated,and then the pruning operation is performed.In addition,a WSKQK algorithm is proposed based on the constructed WIR-tree.This algorithm enumerates the keyword set by increasing the edit distance gradually and combines the query processing early termination strategy.The whole process of the why question on spatial keyword top-k query is accelerated.Finally,the efficiency and scalability of the proposed method are verified significantly by comparing it with the existing BS algorithm based on the setR-tree index structure.

关 键 词：查询 why问题 WIR-tree树索引结构 WSKQK算法 

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