FreSh: A Lock-Free Data Series Index

被引:2
作者
Fatourou, Panagiota [1 ,2 ]
Kosmas, Eleftherios [3 ]
Palpanas, Themis [4 ,5 ]
Paterakis, George [1 ,2 ]
机构
[1] ICS FORTH, Iraklion, Greece
[2] Univ Crete, Iraklion, Greece
[3] Hellen Mediterranean Univ, Khania, Greece
[4] Univ Paris Cite, LIPADE, Paris, France
[5] French Univ Inst IUF, Paris, France
来源
2023 42ND INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, SRDS 2023 | 2023年
关键词
SIMILARITY SEARCH; LERNAEAN HYDRA;
D O I
10.1109/SRDS60354.2023.00029
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present FreSh, a lock-free data series index that exhibits good performance (while being robust). FreSh is based on Refresh, which is a generic approach we have developed for supporting lock-freedom in an efficient way on top of any localityaware data series index. We believe Refresh is of independent interest and can be used to get well-performed lock-free versions of other locality-aware blocking data structures. For developing FreSh, we first studied in depth the design decisions of current state-of-the-art data series indexes, and the principles governing their performance. This led to a theoretical framework, which enables the development and analysis of data series indexes in a modular way. The framework allowed us to apply Refresh, repeatedly, to get lock-free versions of the different phases of a family of data series indexes. Experiments with several synthetic and real datasets illustrate that FreSh achieves performance that is as good as that of the state-of-the-art blocking in-memory data series index. This shows that the helping mechanisms of FreSh are light-weight, respecting certain principles that are crucial for performance in locality-aware data structures.
引用
收藏
页码:209 / 220
页数:12
相关论文
共 60 条
[11]  
Echihabi K., 2021, P 24 INT C EXTENDING, P714
[12]   Hercules Against Data Series Similarity Search [J].
Echihabi, Karima ;
Fatourou, Panagiota ;
Zoumpatianos, Kostas ;
Palpanas, Themis ;
Benbrahim, Houda .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 15 (10) :2005-2018
[13]   ProS: data series progressive k-NN similarity search and classification with probabilistic quality guarantees [J].
Echihabi, Karima ;
Tsandilas, Theophanis ;
Gogolou, Anna ;
Bezerianos, Anastasia ;
Palpanas, Themis .
VLDB JOURNAL, 2023, 32 (04) :763-789
[14]   New Trends in High-D Vector Similarity Search: AI-driven, Progressive, and Distributed [J].
Echihabi, Karima ;
Zoumpatianos, Kostas ;
Palpanas, Themis .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (12) :3198-3201
[15]   Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search [J].
Echihabi, Karima ;
Zoumpatianos, Kostas ;
Palpanas, Themis ;
Benbrahim, Houda .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 13 (03) :403-420
[16]   The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art [J].
Echihabi, Karima ;
Zoumpatianos, Kostas ;
Palpanas, Themis ;
Benbrahim, Houda .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2018, 12 (02) :112-127
[17]   The Amortized Complexity of Non-blocking Binary Search Trees [J].
Ellen, Faith ;
Fatourou, Panagiota ;
Helga, Joanna ;
Ruppert, Eric .
PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, :332-340
[18]   Non-blocking Binary Search Trees [J].
Ellen, Faith ;
Fatourou, Panagiota ;
Ruppert, Eric ;
van Breugel, Franck .
PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, :131-140
[19]  
Faloutsos C., 1994, SIGMOD Record, V23, P419, DOI 10.1145/191843.191925
[20]  
Fatourou P, 2018, Arxiv, DOI arXiv:1805.04779