Name
Abstract | ||
|---|---|---|
With advances in geo-positioning technologies and geo-locat-ion services, there are a rapidly growing massive amount of spatio-tempor-al 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 k-nearest neighbors search (STkNNS), which is fundamental in the spatial temporal queries. Based on HBase, a novel index structure is proposed, called Hybrid Spatio-Temporal HBase Index (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 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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-04503-6_9 | PAKDD |
DocType | Volume | Citations |
Conference | abs/1805.07599 | 0 |
PageRank | References | Authors |
0.34 | 23 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengyuan Zhang | 1 | 3 | 1.74 |
| Lei Zhu | 2 | 22 | 7.50 |
| Jun Long | 3 | 5 | 3.56 |
| Shuangqiao Lin | 4 | 0 | 0.68 |
| Zhan Yang | 5 | 24 | 16.44 |
| Wenti Huang | 6 | 3 | 1.38 |