Database Index for Approximate String Matching
Alexander Korotkov · Proceedings of the Spring/Summer young researchers' colloquium on software engineering · 2010
In this work the database index for approximate string search is proposed.In particular the task of finding strings from some data domain which have a distance from given string less than given number is considered.Some kind of editorial string distance is used in capacity of string distance.Some subclass of regular expressions is used in the capacity of tree node predicates.The analysis of performance tests was performed and the areas of further researches were surveyed.