Csaba, On 3/17/06 7:07 AM, "Csaba Nagy" <[EMAIL PROTECTED]> wrote:
> It worths a look at how apache Derby does with query planning, where a > planned query is actually a compiled Java class, i.e. the executable > byte code which will run to fetch the results, created and compiled by > the planner... interesting approach, allows for lots of flexibility at > run-time, but probably won't work with C :-) We've looked at using the open source llvm compiler to create an intermediate representation of the plan, then generate machine code and dispatch for execution. This would have the advantage of being able to place runtime constants into the intermediate representation as constants (like the address of a comparator function or operator), then let the compiler optimize them out, hoist, etc. You can't do this at compile time, and there would be no change of the nice abstract code in the executor. It's on our list - anyone else interested? - Luke ---------------------------(end of broadcast)--------------------------- TIP 2: Don't 'kill -9' the postmaster
