comment on

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.

In reply to Re^2: In search of an efficient query abstractor by xaprb
in thread In search of an efficient query abstractor by xaprb

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


There's more than one way to do things
	PerlMonks