arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.04642cs.DB
收藏

HOC-Tree:一种新的高效时空范围搜索索引

HOC-Tree: A Novel Index for efficient Spatio-temporal Range Search

Jun Long, Lei Zhu, Chengyuan Zhang, Shuangqiao Lin, Zhan Yang, Xinpan Yuan

摘要:

随着移动计算和Web服务的快速发展,智能移动终端每天都要采集大量的具有时空信息的数据,其中对象是通过其空间信息和时间信息来描述的。鉴于时空范围搜索的重要性和缺乏有效搜索算法的现状,本文研究了时空范围搜索问题,提出了一种基于Hilbert曲线和OC树的时空范围搜索索引结构HOC-Tree,该索引结构兼顾了时空信息。基于HOC-Tree,我们提出了一种有效的时空范围搜索算法。对真实数据和合成数据的综合实验表明,该方法比现有技术更有效。

英文摘要:

With the rapid development of mobile computing and Web services, a huge amount of data with spatial and temporal information have been collected everyday by smart mobile terminals, in which an object is described by its spatial information and temporal information. Motivated by the significance of spatio-temporal range search and the lack of efficient search algorithm, in this paper, we study the problem of spatio-temporal range search (STRS), a novel index structure is proposed, called HOC-Tree, which is based on Hilbert curve and OC-Tree, and takes both spatial and temporal information into consideration. Based on HOC-Tree, we develop an efficient algorithm to solve the problem of spatio-temporal range search. Comprehensive experiments on real and synthetic data demonstrate that our method is more efficient than the state-of-the-art technique.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑