Rico Jansen wrote: > It would be nice if there is a way to make a fallback for databases that > don't fully implement regexp. I know that is probably quite difficult, not > to mention performance intensive.
Yes, that would be nice, though quit hard to do it without too much performance penalty. The most straight-forward fallback would be to use java regexps, but since this would require the complete list to be fetched, I would perhaps not opt for that. Perhaps it would be better to imitate regexp a bit with a normal LIKE. Basic features (., .*) would probably work, but otherwise it would not work excactly the same. Precise database intercompatibility would probably be hard to garantuee anyway because I suppose any database has its own regexp dialect.. You should probably never depend in your code on regexp to search certain nodes. It could be offered in search-tools. Michiel -- Michiel Meeuwissen mihxil' Mediacentrum 140 H'sum [] () +31 (0)35 6772979 nl_NL eo_XX en_US
