IMPLEMENTATION OF A SUFFIX TREE-BASED INDEX FOR SEARCHING SUBSTRINGS IN A LARGE DBMS

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, 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. Keywords: suffix tree, index, string searching, performance benchmark, Elasticsearch, PostgreSQL, MySQL, ClickHouse.