Spatial-temporal trajectory data contains rich information aboutmoving objects and has been widely used for a large numberof real-world applications. However, the complexity of spatial-temporal trajectory data, on the one hand, and the fast collectionof datasets, on the other hand, has made it challenging to ef-ficiently store, process, and query such data. In this paper, wepropose a scalable method to analyze the sub-trajectory simi-larity search in an in-memory cluster computing environment.Notably, we have extended Apache Spark with efficient trajectoryindexing, partitioning, and querying functionalities to supportthe sub-trajectory similarity query. Our experiments on a realtrajectory dataset have shown the efficiency and effectiveness ofthe proposed method.
Towards in-memory sub-trajectory similarity search
Nanni M;Trasarti R;
2020
Abstract
Spatial-temporal trajectory data contains rich information aboutmoving objects and has been widely used for a large numberof real-world applications. However, the complexity of spatial-temporal trajectory data, on the one hand, and the fast collectionof datasets, on the other hand, has made it challenging to ef-ficiently store, process, and query such data. In this paper, wepropose a scalable method to analyze the sub-trajectory simi-larity search in an in-memory cluster computing environment.Notably, we have extended Apache Spark with efficient trajectoryindexing, partitioning, and querying functionalities to supportthe sub-trajectory similarity query. Our experiments on a realtrajectory dataset have shown the efficiency and effectiveness ofthe proposed method.| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_447159-doc_161231.pdf
accesso aperto
Descrizione: Towards in-memory sub-trajectory similarity search
Tipologia:
Versione Editoriale (PDF)
Dimensione
4.49 MB
Formato
Adobe PDF
|
4.49 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


