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 条
[1]  
Alistarh D, 2015, ACM SIGPLAN NOTICES, V50, P11, DOI [10.1145/2858788.2688523, 10.1145/2688500.2688523]
[2]   Brief Announcement: Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures [J].
Attiya, Hagit ;
Ben-Baruch, Ohad ;
Fatourou, Panagiota ;
Hendler, Danny ;
Kosmas, Eleftherios .
PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, :503-505
[3]   Detectable Recovery of Lock-Free Data Structures [J].
Attiya, Hagit ;
Ben-Baruch, Ohad ;
Fatourou, Panagiota ;
Hendler, Danny ;
Kosmas, Eleftherios .
PPOPP'22: PROCEEDINGS OF THE 27TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2022, :262-277
[4]   ELPIS: Graph-Based Similarity Search for Scalable Data Science [J].
Azizi, Ilias ;
Echihabi, Karima ;
Palpanas, Themis .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 16 (06) :1548-1559
[5]  
Bagnall Anthony J., 2019, Dagstuhl Rep., V9, P24, DOI DOI 10.4230/DAGREP.9.7.24
[6]  
Braginsky A., 2012, P ACM S PAR ALG ARCH, P58, DOI 10.1145/2312005.2312016
[7]  
Brown T, 2014, ACM SIGPLAN NOTICES, V49, P329, DOI [10.1145/2555243.2555267, 10.1145/2692916.2555267]
[8]  
Camerra A, 2014, KNOWL INF SYST, V39, P123, DOI 10.1007/s10115-012-0606-6
[9]   Efficient Lock-free Binary Search Trees [J].
Chatterjee, Bapi ;
Nguyen, Nhan ;
Tsigas, Philippas .
PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, :322-331
[10]   Odyssey: A Journey in the Land of Distributed Data Series Similarity Search [J].
Chatzakis, Manos ;
Fatourou, Panagiota ;
Kosmas, Eleftherios ;
Palpanas, Themis ;
Peng, Botao .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 16 (05) :1140-1153