DPiSAX: Massively Distributed Partitioned iSAX - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

DPiSAX: Massively Distributed Partitioned iSAX


Indexing is crucial for many data mining tasks that rely on efficient and effective similarity query processing. Consequently, indexing large volumes of time series, along with high performance similarity query processing, have became topics of high interest. For many applications across diverse domains though, the amount of data to be processed might be intractable for a single machine, making existing centralized indexing solutions inefficient. We propose a parallel indexing solution that gracefully scales to billions of time series, and a parallel query processing strategy that, given a batch of queries, efficiently exploits the index. Our experiments, on both synthetic and real world data, illustrate that our index creation algorithm works on 1 billion time series in less than 2 hours , while the state of the art centralized algorithms need more than 5 days. Also, our distributed querying algorithm is able to efficiently process millions of queries over collections of billions of time series, thanks to an effective load balancing mechanism.
Fichier principal
Vignette du fichier
DPiSAX__ICDM___short_paper_.pdf (242.9 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-01620125 , version 1 (20-10-2017)



Djamel-Edine Edine Yagoubi, Reza Akbarinia, Florent Masseglia, Themis Palpanas. DPiSAX: Massively Distributed Partitioned iSAX. ICDM 2017 - 17th IEEE International Conference on Data Mining, Nov 2017, New Orleans, LA, United States. pp.1135-1140, ⟨10.1109/ICDM.2017.151⟩. ⟨lirmm-01620125⟩
750 View
875 Download



Gmail Mastodon Facebook X LinkedIn More