>> Then there's this from the article:
>> "The key ideas are that SQL code is translated into C++, so avoiding the
>> need to use a slow SQL interpreter, and that the data is kept in memory,
>> with disk read/writes taking place in the background."
>> Besides the nonsense statement that SQL is translated to C++ (Lexical
>> scanners would circumvent even this step, and does that mean you have to
>> literally compile the resulting C++? Ridiculous.) ...
> DB2 on the mainframe (if memory serves), for one, will compile static SQL to machine code. Not that unusual.
Yeah. Actually such techniques go back at least to the fifties (look up
"sort generators" sometime). They are out of fashion now because
(1) the achievable speed difference isn't what it once was, and
(2) programs that execute self-modified code are prone to seriously
nasty security issues. Get any sort of control over the code generator,
and you can happily execute anything you want.
regards, tom lane
In response to
pgsql-performance by date
|Next:||From: Jesper Krogh||Date: 2012-06-26 05:03:26|
|Subject: Re: Performance of a large array access by position (tested
|Previous:||From: Alejandro Carrillo||Date: 2012-06-25 19:14:21|
|Subject: Re: Postgres delete performance problem|