With DBD::SQLite, this might be a viable option if I can figure out how to structure this. I've seen this discussed before and, if it works, I can push the hard part of matching down to the C level and get a huge performance boost. I'll have to see how robust the SQLite SQL implementation is. As I recall, it's pretty good (and here's an instance where I think a typeless database like SQLite is fine).
Cheers,
Ovid
New address of my CGI Course.
In reply to Re: Re: Being Forced to Fork with Nested Regular Expressions
by Ovid
in thread Being Forced to Fork with Nested Regular Expressions
by Ovid
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |