A Qualitative Performance Comparison and Analysis of Suffix Array, FM-index and Compressed Suffix Array

被引:0
|
作者
Wu, Jichuan [1 ]
Mao, Xin [2 ]
Lu, Songfeng [3 ]
机构
[1] Natl Univ Singapore, Dept Mech Engn, Singapore, Singapore
[2] Wuhan Qiaokou Power Supply Co, Wuhan 430034, Peoples R China
[3] Huazhong Univ Sci & Technol, Sch Comp Sci, Wuhan 430074, Peoples R China
基金
中国国家自然科学基金;
关键词
String Matching; Compressed Suffix Array; FM-index; Suffix Array;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Suffix array is an index structure widely used in string matching and data compression which has the advantages of fast data retrieval and high compatibility in many areas of applications. Nevertheless, the memory space consumption for the execution of the algorithm is inefficient compare with conventional methods. To overcome this problem, FM-index and Compressed Suffix Array (CSA) were proposed. In this paper, the constructor methods of the three index structures are comprehensively described in order to evaluate their specific characteristics in the corresponding applicable field. Performances of these index structures are analyzed through the designed experiments, and qualitative conclusions are drawn based on the measured results.
引用
收藏
页码:348 / 352
页数:5
相关论文
共 50 条
  • [1] Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction
    Labeit, Julian
    Shun, Julian
    Blelloch, Guy E.
    [J]. 2016 DATA COMPRESSION CONFERENCE (DCC), 2016, : 33 - 42
  • [2] Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order
    Daykin, Jacqueline W.
    Mhaskar, Neerja
    Smyth, W. F.
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 880 : 82 - 96
  • [3] Fibonacci Based Compressed Suffix Array
    Klein, Shmuel T.
    Shapira, Dana
    [J]. 2018 DATA COMPRESSION CONFERENCE (DCC 2018), 2018, : 415 - 415
  • [4] Suffix cactus: A cross between suffix tree and suffix array
    Karkkainen, J
    [J]. COMBINATORIAL PATTERN MATCHING, 1995, 937 : 191 - 204
  • [5] Compact suffix array
    Mäkinen, V
    [J]. COMBINATORIAL PATTERN MATCHING, 2000, 1848 : 305 - 319
  • [6] Reconstructing a suffix array
    Franek, Frantisek
    Smyth, William F.
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1281 - 1295
  • [7] Suffix Array Performance Analysis for Multi-Core Platforms
    Gil-Costa, Veronica
    Ochoa, Cesar
    Printista, A. Marcela
    [J]. COMPUTACION Y SISTEMAS, 2013, 17 (03): : 391 - 399
  • [8] A Compressed Enhanced Suffix Array Supporting Fast String Matching
    Oblebusch, Enno
    Gog, Simon
    [J]. STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2009, 5721 : 51 - 62
  • [9] Suffix Array of Alignment: A Practical Index for Similar Data
    Na, Joong Chae
    Park, Heejin
    Lee, Sunho
    Hong, Minsung
    Lecroq, Thierry
    Mouchard, Laurent
    Park, Kunsoo
    [J]. STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2013), 2013, 8214 : 243 - 254
  • [10] Compressed text databases with efficient query algorithms based on the compressed suffix array
    Sadakane, K
    [J]. ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 410 - 421