THE MOST EFFECTIVE METHOD FOR FINDING REGULAR EXPRESSIONS IN DOCUMENT DATABASES

Considering a list of n strings with a maximum length of k, where l is the longest string. The goal is to use as few regular expressions as possible to cover the strings (r1, r2, r3……………..,rm for m≥1) so that: a) Every text in the database meets at least one ri and b) Any string "X" of length at most K satisfying r1+r2+r3+And so on.The distance between a string "y" in the database and +rm is at most p, where "p" is a specified constant parameter. We presume that the database is in the form of B+ tree. We begin with leaf nodes and gather all of the database's longest strings. The goal of the paper is to create a process for detecting regular expressions in databases that is comparable to that for Boolean formulae (in DNF or CNF), where function values and don't care words are supplied.