Adaptive execution of compiled queries

Kohn A, Leis V, Neumann T (2018)


Publication Type: Conference contribution

Publication year: 2018

Publisher: Institute of Electrical and Electronics Engineers Inc.

Pages Range: 197-208

Conference Proceedings Title: Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018

Event location: Paris FR

ISBN: 9781538655207

DOI: 10.1109/ICDE.2018.00027

Abstract

Compiling queries to machine code is a very efficient way for executing queries. One often overlooked problem with compilation is the time it takes to generate machine code. Even with fast compilation frameworks like LLVM, generating machine code for complex queries often takes hundreds of milliseconds. Such durations can be a major disadvantage for workloads that execute many complex, but quick queries. To solve this problem, we propose an adaptive execution framework, which dynamically switches from interpretation to compilation. We also propose a fast bytecode interpreter for LLVM, which can execute queries without costly translation to machine code and dramatically reduces the query latency. Adaptive execution is fine-grained, and can execute code paths of the same query using different execution modes. Our evaluation shows that this approach achieves optimal performance in a wide variety of settings-low latency for small data sets and maximum throughput for large data sizes.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Kohn, A., Leis, V., & Neumann, T. (2018). Adaptive execution of compiled queries. In Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018 (pp. 197-208). Paris, FR: Institute of Electrical and Electronics Engineers Inc..

MLA:

Kohn, Andre, Viktor Leis, and Thomas Neumann. "Adaptive execution of compiled queries." Proceedings of the 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris Institute of Electrical and Electronics Engineers Inc., 2018. 197-208.

BibTeX: Download