During a regex query, ParadeDB doesn’t scan through every single word. Instead, it uses a highly optimized structure called a finite state transducer (FST) that makes it possible to jump straight to the matching terms.
Even if the index contains millions of words, the regex query only looks at the ones that have a chance of matching, skipping everything else.This is why the certain regex constructs are not supported — they are difficult to implement efficiently.