Dimitri Fontaine <dimi...@2ndquadrant.fr> writes: > Tom Lane <t...@sss.pgh.pa.us> writes: >> Yeah, it's conceivable that we could implement something whereby >> characters with codes above some cutoff point are handled via runtime >> calls to iswalpha() and friends, rather than being included in the >> statically-constructed DFA maps. The cutoff point could likely be a lot >> less than U+FFFF, too, thereby saving storage and map build time all >> round.
> It's been proposed to build a âregexpâ type in PostgreSQL which would > store the DFA directly and provides some way to run that DFA out of its > âstorageâ without recompiling. > Would such a mechanism be useful here? No, this is about what goes into the DFA representation in the first place, not about how we store it and reuse it. regards, tom lane -- Sent via pgsql-hackers mailing list (firstname.lastname@example.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers