Title: Fast query evaluation with (lazy) control flow compilation
Authors: Tronçon, Remko ×
Janssens, Gerda
Vandecasteele, Henk #
Issue Date: 2004
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3132 pages:240-253
Conference: Logic Programming, 20th International Conference, ICLP 2004, Proceedings
Abstract: Learning algorithms such as decision tree learners dynamically generate a huge amount of large queries. Because these queries are executed often, the trade-off between meta-calling and compiling & running them has been in favor of the latter, as compiled code is faster. This paper presents a technique named control flow compilation, which improves the compilation time of the queries by an order of magnitude without reducing the performance of executing the queries. We exploit the technique further by using it in a just-in-time manner. This improves performance in two ways: it opens the way to incremental compilation of the generated queries, and also gives potentially large gains by never compiling dynamically unreachable code. Both the implementation of (lazy) control flow compilation and its experimental evaluation in a real world application are reported on.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
41198.pdf Published 139KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science