Abstract: Many applications are required to support both spatial joins and keyword-based search. This paper aims to present efficient methods to answer Keyword-based Spatial Join(KSJ) queries, constructs MIR2-tree indexing structures on the datasets for KSJ, and uses them to answer KSJ with breadth-first traversal method. In addition, some search pruning strategies are applied to enhance the efficiency of MIR2-tree traversing. Experimental results show that the algorithm is effective for keyword-based spatial join queries.

Key words: keyword-based search, spatial join, MIR2-tree

摘要： 许多实际的应用需要同时支持空间连接查询和关键词搜索。在给出基于关键词的空间连接(KSJ)查询定义的基础上，对参与KSJ查询的空间数据集建立MIR2-树索引结构，并结合一些高效的搜索剪枝策略，提出一种基于宽度优先的KSJ查询算法。实验结果表明该算法可有效支持基于关键词的空间连接查询处理。

关键词: 基于关键词搜索, 空间连接, MIR2-树

CLC Number: 

• TP311