Odyssey: A Journey in the Land of Distributed Data Series Similarity Search
Manos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, Botao Peng
Abstract
This paper presents Odyssey, a novel distributed data-series processing framework that efficiently addresses the critical challenges of exhibiting good speedup and ensuring high scalability in data series processing by taking advantage of the full computational capacity of modern distributed systems comprised of multi-core servers. Odyssey addresses a number of challenges in designing efficient and highly-scalable distributed data series index, including efficient scheduling, and loadbalancing without paying the prohibitive cost of moving data around. It also supports a flexible partial replication scheme, which enables Odyssey to navigate through a fundamental trade-off between data scalability and good performance during query answering. Through a wide range of configurations and using several real and synthetic datasets, our experimental analysis demonstrates that Odyssey achieves its challenging goals. This paper appeared in PVLDB 2023, Volume 16.
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 7597b9c2-9ba8-4685-87f5-f6842e531b23Cited by top-tier papers9
- Elpis: Graph-Based Similarity Search for Scalable Data ScienceIlias Azizi, Karima Echihabi, Themis PalpanasVLDB 2023 · 67 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
- Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN IndexesZeyu Wang, Qitong Wang, Xiaoxing Cheng, Peng Wang et al.VLDB 2024 · 19 citations
- Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor SearchJiuqi Wei, Xiaodong Lee, Zhenyu Liao, Themis Palpanas et al.SIGMOD 2025 · 14 citations
- DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor SearchManos Chatzakis, Yannis Papakonstantinou, Themis PalpanasSIGMOD 2026 · 10 citations
Builds on7
- Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity SearchKarima Echihabi, Kostas Zoumpatianos, Themis Palpanas, Houda BenbrahimVLDB 2020 · 99 citations
- Elpis: Graph-Based Similarity Search for Scalable Data ScienceIlias Azizi, Karima Echihabi, Themis PalpanasVLDB 2023 · 67 citations
- MESSI: In-Memory Data Series IndexingBotao Peng, Panagiota Fatourou, Themis PalpanasICDE 2020 · 38 citations
- Deep Learning Embeddings for Data Series Similarity SearchQitong Wang, Themis PalpanasKDD 2021 · 32 citations
- Dumpy: A Compact and Adaptive Index for Large Data Series CollectionsZeyu Wang, Qitong Wang, Peng Wang, Themis Palpanas et al.SIGMOD 2023 · 20 citations
Related papers
- CLIMBER: Pivot-Based Approximate Similarity Search Over Big Data SeriesLiang Zhang, Mohamed Y. Eltabakh, Elke A. Rundensteiner, Khalid AlnuaimICDE 2024 · 1 citation
- Odyssey: the impact of modern hardware on strongly-consistent replication protocolsVasilis Gavrielatos, Antonios Katsarakis, Vijay NagarajanEuroSys 2021 · 11 citations
- DIDS: Double Indices and Double Summarizations for Fast Similarity SearchHan Hu, Jiye Qiu, Hongzhi Wang, Bin Liang et al.VLDB 2024 · 2 citations
- Hercules Against Data Series Similarity SearchKarima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos, Themis Palpanas et al.VLDB 2022 · 41 citations
- DShuffle: DPU-Optimized Shuffle Framework for Large-scale Data ProcessingChen Ding, Sicen Li, Kai Lu, Ting Yao et al.USENIX ATC 2025 · 2 citations
