HOC-Tree: A Novel Index for Efficient Spatio-Temporal Range Search

Abstract

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.

A Novel Range Search Scheme Based on Frequent Computing for Edge-Cloud Collaborative Computing in CPSS

“…The goal is to optimize the direction-aware direction perception of keywords in the query. Long et al [24] propose a HOC-Tree index structure, which is based on OC-Tree and Hilbert curve. Spatiotemporal and physical attributes of data are also taken into account.…”