Dynamic trajectory partition optimization method based on historical trajectory data

Yükleniyor...
Küçük Resim

Tarih

2024

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Elsevier

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Özet

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.

Açıklama

Anahtar Kelimeler

Pre-partitioning, Dynamic trajectory partitioning, Similarity function, Historical Trajectory, Query Efficiency and Accuracy, Urgent Demand

Kaynak

Applied Soft Computing

WoS Q Değeri

Q1

Scopus Q Değeri

Q1

Cilt

151

Sayı

Künye