Fast Frequent Querying with Lazy Control Flow Compilation

Details Fast Frequent Querying with Lazy Control Flow Compilation Fast Frequent Querying with Lazy Control Flow Compilation

2006-01-16

arxiv.org/abs/cs/0601072v1

Computer Science

Programming Languages

Scientific paper

Control flow compilation is a hybrid between classical WAM compilation and meta-call, limited to the compilation of non-recursive clause bodies. This approach is used successfully for the execution of dynamically generated queries in an inductive logic programming setting (ILP). Control flow compilation reduces compilation times up to an order of magnitude, without slowing down execution. A lazy variant of control flow compilation is also presented. By compiling code by need, it removes the overhead of compiling unreached code (a frequent phenomenon in practical ILP settings), and thus reduces the size of the compiled code. Both dynamic compilation approaches have been implemented and were combined with query packs, an efficient ILP execution mechanism. It turns out that locality of data and code is important for performance. The experiments reported in the paper show that lazy control flow compilation is superior in both artificial and real life settings.

Affiliated with

Also associated with

No associations

Rating

Fast Frequent Querying with Lazy Control Flow Compilation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Frequent Querying with Lazy Control Flow Compilation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Frequent Querying with Lazy Control Flow Compilation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523751