Accelerated preprocessing in task of searching substrings in a string
Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database management systems that support associative s...
Main Authors: | A. V. Mazurenko, N. V. Boldyrikhin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Don State Technical University
2019-10-01
|
Series: | Advanced Engineering Research |
Subjects: | |
Online Access: | https://www.vestnik-donstu.ru/jour/article/view/1537 |
Similar Items
-
Speeding Up the String Comparison of the IDS Snort using Parallel Programming: A Systematic Literature Review on the Parallelized Aho-Corasick Algorithm
by: SILVA JUNIOR,J. B., et al.
Published: (2016-12-01) -
A Secure Live Signature Verification with Aho-Corasick Histogram Algorithm for Mobile Smart Pad
by: Kuo-Kun Tseng, et al.
Published: (2021-06-01) -
Substring-Searchable Symmetric Encryption
by: Chase Melissa, et al.
Published: (2015-06-01) -
Computing Maximal Lyndon Substrings of a String
by: Frantisek Franek, et al.
Published: (2020-11-01) -
Smart Clustering System for Filtering and Cleaning User Generated Content : Creating a profanity filter for Truecaller
by: Moradi, Arvin
Published: (2013)