MESSI: In-Memory Data Series Indexing
Botao Peng, Panagiota Fatourou, Themis Palpanas
Abstract
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deliver the time performance required for interactive exploration, or analysis of large data series collections. In this work, we propose MESSI, the first data series index designed for in-memory operation on modern hardware. Our index takes advantage of the modern hardware parallelization opportunities (i.e., SIMD instructions, multi-core and multi-socket architectures), in order to accelerate both index construction and similarity search processing times. Moreover, it benefits from a careful design in the setup and coordination of the parallel workers and data structures, so that it maximizes its performance for in-memory operations. Our experiments with synthetic and real datasets demonstrate that overall MESSI is up to 4× faster at index construction, and up to 11× faster at query answering than the state-of-the-art parallel approach. MESSI is the first to answer exact similarity search queries on 100GB datasets in 50msec (30-75msec across diverse datasets), which enables real-time, interactive data exploration on very large data series collections.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a8fe3208-347e-4ff4-b2a0-331633729598Cited by top-tier papers15
- Elpis: Graph-Based Similarity Search for Scalable Data ScienceIlias Azizi, Karima Echihabi, Themis PalpanasVLDB 2023 · 67 citations
- Data Series Progressive Similarity Search with Probabilistic Quality GuaranteesAnna Gogolou, Theophanis Tsandilas, Karima Echihabi, Anastasia Bezerianos et al.SIGMOD 2020 · 38 citations
- Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-ArtIlias Azizi, Karima Echihabi, Themis PalpanasSIGMOD 2025 · 36 citations
- DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor SearchJiuqi Wei, Botao Peng, Xiaodong Lee, Themis PalpanasVLDB 2024 · 35 citations
- Odyssey: A Journey in the Land of Distributed Data Series Similarity SearchManos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas et al.VLDB 2023 · 26 citations
Builds on1
Related papers
- Hercules Against Data Series Similarity SearchKarima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos, Themis Palpanas et al.VLDB 2022 · 41 citations
- Fast and Exact Similarity Search in Less than a Blink of an EyePatrick Schäfer, Jakob Brand, Ulf Leser, Botao Peng et al.ICDE 2025 · 1 citation
- Dumpy: A Compact and Adaptive Index for Large Data Series CollectionsZeyu Wang, Qitong Wang, Peng Wang, Themis Palpanas et al.SIGMOD 2023 · 20 citations
- DIDS: Double Indices and Double Summarizations for Fast Similarity SearchHan Hu, Jiye Qiu, Hongzhi Wang, Bin Liang et al.VLDB 2024 · 2 citations
- MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean DistanceJens E. d'Hondt, Teun Kortekaas, Odysseas Papapetrou, Themis PalpanasVLDB 2026 · 1 citation
