Dynamic trajectory partition optimization method based on historical trajectory data

Xiang Yu, Huawei Zhai, Ruijie Tian, Yao Guan, Kemal Polat, Adi Alhudhaif

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Article number111120
JournalApplied Soft Computing
Volume151
DOIs
StatePublished - Jan 2024

Keywords

  • Dynamic trajectory partitioning
  • Pre-partitioning
  • Similarity function

Fingerprint

Dive into the research topics of 'Dynamic trajectory partition optimization method based on historical trajectory data'. Together they form a unique fingerprint.

Cite this