TY - JOUR
T1 - Dynamic trajectory partition optimization method based on historical trajectory data
AU - Yu, Xiang
AU - Zhai, Huawei
AU - Tian, Ruijie
AU - Guan, Yao
AU - Polat, Kemal
AU - Alhudhaif, Adi
N1 - Publisher Copyright:
© 2023 Elsevier B.V.
PY - 2024/1
Y1 - 2024/1
N2 - Partitioning dynamic trajectory data can improve the efficiency and accuracy of trajectory data processing, provide a foundation for trajectory data mining and analysis. However, with the continuous growth of trajectory data scales and the urgent demand for trajectory query efficiency and accuracy, partitioning methods have become crucial. The partitioning method of dynamic trajectory data faces significant challenges in terms of spatiotemporal trajectory locality, partition load balancing, and partition time. To address these challenges, we propose a method based on historical trajectory pre-partitioning, which can store data more effectively in distributed systems. We partition similar historical trajectory data to achieve preliminary partitioning of the data. In addition, we also construct a cost model to ensure that the workload of each partition is close to consistency. Extensive experiments have demonstrated the excellent partitioning efficiency and query efficiency achieved by our design compared to other partitioning methods.
AB - Partitioning dynamic trajectory data can improve the efficiency and accuracy of trajectory data processing, provide a foundation for trajectory data mining and analysis. However, with the continuous growth of trajectory data scales and the urgent demand for trajectory query efficiency and accuracy, partitioning methods have become crucial. The partitioning method of dynamic trajectory data faces significant challenges in terms of spatiotemporal trajectory locality, partition load balancing, and partition time. To address these challenges, we propose a method based on historical trajectory pre-partitioning, which can store data more effectively in distributed systems. We partition similar historical trajectory data to achieve preliminary partitioning of the data. In addition, we also construct a cost model to ensure that the workload of each partition is close to consistency. Extensive experiments have demonstrated the excellent partitioning efficiency and query efficiency achieved by our design compared to other partitioning methods.
KW - Dynamic trajectory partitioning
KW - Pre-partitioning
KW - Similarity function
UR - http://www.scopus.com/inward/record.url?scp=85179476681&partnerID=8YFLogxK
U2 - 10.1016/j.asoc.2023.111120
DO - 10.1016/j.asoc.2023.111120
M3 - Article
AN - SCOPUS:85179476681
SN - 1568-4946
VL - 151
JO - Applied Soft Computing
JF - Applied Soft Computing
M1 - 111120
ER -