HBase中一种高效时空搜索的混合索引模型
A hybrid index model for efficient spatio-temporal search in HBase
摘要:
随着地理定位技术和地理定位服务的发展,在诸如位置感知设备和无线通信的许多应用中收集的大量时空数据迅速增长,其中对象通过其空间位置和其时间戳来描述。因此,时空搜索的研究,探索的地理位置信息和时间信息的数据已经引起了研究机构和商业社区的显着关注。本文研究时空\emph{k} -最近邻搜索(ST $k$ NNS)问题,它是时空查询的基础。在HBase的基础上,提出了一种新的索引结构--\textbf{H}混合\textbf{T} emporal HBase \textbf{I}索引(简称\textbf{HSTI}),该索引结构经过精心设计,兼顾了空间和时间信息,有效地缩小了搜索空间。基于HSTI,提出了一种时空\emph{k} -最近邻搜索算法。对真实数据和合成数据的综合实验清楚地表明,HSTI比最先进的技术快三到五倍。
英文摘要:
With advances in geo-positioning technologies and geo-location services, there are a rapidly growing massive amount of spatio-temporal data collected in many applications such as location-aware devices and wireless communication, in which an object is described by its spatial location and its timestamp. Consequently, the study of spatio-temporal search which explores both geo-location information and temporal information of the data has attracted significant concern from research organizations and commercial communities. This work study the problem of spatio-temporal \emph{k}-nearest neighbors search (ST$k$NNS), which is fundamental in the spatial temporal queries. Based on HBase, a novel index structure is proposed, called \textbf{H}ybrid \textbf{S}patio-\textbf{T}emporal HBase \textbf{I}ndex (\textbf{HSTI} for short), which is carefully designed and takes both spatial and temporal information into consideration to effectively reduce the search space. Based on HSTI, an efficient algorithm is developed to deal with spatio-temporal \emph{k}-nearest neighbors search. Comprehensive experiments on real and synthetic data clearly show that HSTI is three to five times faster than the state-of-the-art technique.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。