Re^2: In search of an efficient query abstractor

I should explain a little extra subtlety here. Suppose I have an SQL statement of the form

insert into foo (col1, col2, col3)
values(1, 2, 3), (4, 5, 6), ......
[download]

Now assume there are a million sets of values there. I want them all mushed down to a single "values(N, N, N)".

This happens to me all the time in the real world. How fast is this going to be?

And then, when the parser is done with it, I still have to reassemble the thing into a fingerprint of the query... which will be a lot of special-case code. MySQL's grammar is nontrivial.

So I don't think this will be a fast or easy way to do what I want, although I appreciate the idea.

Comment on Re^2: In search of an efficient query abstractor Download Code

Replies are listed 'Best First'.

Re^3: In search of an efficient query abstractor
by CountZero (Bishop) on Dec 07, 2008 at 22:37 UTC

SQL::Statement

INSERT

VALUES

May be you can petition the module's author jZED to extend it to include this case?

If you want to parse the SQL statements yourself, it can do no harm to look at the code of DBI::SQL::Nano which has a nice (but limited) set of regexes that parse them and it shouldn't be too difficult to expend these, although to parse the full MySQL grammar you will probably need something like Parse::RecDescent or Parse::Yapp.

CountZero

A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

[reply]
[d/l]
[select]


No such thing as a small change
	PerlMonks