基于数据广播的空间关键字查询处理  

Spatial keyword query processing on data broadcast

作　　者：李艳红[1] 李国徽[2] 黄群[3] 

机构地区：[1]中南民族大学计算机科学学院,湖北武汉430074 [2]华中科技大学计算机科学与技术学院,湖北武汉430074 [3]中国船舶重工集团公司第七零九研究所,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2015年第1期122-126,共5页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61309002)

摘　　要：为了解决无线广播环境下空间关键字查询的问题,研究广播环境下空间关键字k近邻查询处理(BkSKQ),设计了一种结合kd树、倒排位图和(1,m)索引机制的空间关键字索引(ISKW)结构,以有效地组织对象的关键字信息、位置信息以及索引信息.该索引结构为客户的查询处理提供有效的指导,使得他们尽可能只下载查询处理所必须的数据信息.在ISKW索引结构的基础上,提出了BkSKQ查询处理算法.最后,通过模拟实验验证了提出的索引结构和算法的性能,实验结果表明所提出方法在访问时间和调谐时间上明显优于基于IR树的方法(BIRM).In order to overcome the problem that there is no research on the issue of spatial keywords query processing in wireless broadcast environments,the problem of processing top-kspatial keyword queries in wireless broadcast environments（BkSKQ）was mainly addressed in this paper.A novel air index of spatial keyword（ISKW）,which combines the kd tree,inverted bitmaps,and（1,m）index mechanism,was proposed to efficiently organize the keyword information and location information of objects,and the index information.This index could provide an effective guideline for the client to only download the necessary data for query processing.Based on the ISKW index,an efficient BkSKQ query processing method was proposed.Finally,simulation experiments were conducted to verify the performance of the proposed air index and query processing method.Experimental result shows that access time and tuning time of our proposed method are better than the compared IR-tree based method（BIRM）method,respectively.

关 键 词：查询 K近邻查询 无线广播环境 路网 算法 

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