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.
国家科技期刊平台
NSTL
万方数据
维普
