Scholarlink

<p>The article considers the advantages and disadvantages of implementing a suffix tree-based index to optimize substring search operations in a DBMS when working with large data. The theoretical characteristics of the complexity of operations for suffix trees are presented. Experimental estimates of the time complexity of substring search operations for suffix trees and database management systems, such as Elasticsearch, PostgreSQL, MySQL, and ClickHouse are carried out. Based on the results obtained, the hypothesis about the potential efficiency of implementing an index based on suffix trees to optimize substring search operations in a DBMS is confirmed.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Implementation of a Suffix Tree-Based Index for Searching for Substrings in a Large DBMS

  • 期刊论文

  • 发表日期：

    2025年3月1日

查看全文
  • A. Hlybovets,
  • D. Zvazhii

摘要

The article considers the advantages and disadvantages of implementing a suffix tree-based index to optimize substring search operations in a DBMS when working with large data. The theoretical characteristics of the complexity of operations for suffix trees are presented. Experimental estimates of the time complexity of substring search operations for suffix trees and database management systems, such as Elasticsearch, PostgreSQL, MySQL, and ClickHouse are carried out. Based on the results obtained, the hypothesis about the potential efficiency of implementing an index based on suffix trees to optimize substring search operations in a DBMS is confirmed.