Efficiently compiling efficient query plans for modern hardware

doi:10.14778/2002938.2002940

Efficiently compiling efficient query plans for modern hardware

2011-06-01

0

OA

AI

DOI：10.14778/2002938.2002940

原文链接

查看原文

摘要

En 中文

As main memory grows, query performance is more and more determined by the raw CPU costs of query processing itself. The classical iterator style query processing technique is very simple and exible, but shows poor performance on modern CPUs due to lack of locality and frequent instruction mispredictions. Several techniques like batch oriented processing or vectorized tuple processing have been proposed in the past to improve this situation, but even these techniques are frequently out-performed by hand-written execution plans. In this work we present a novel compilation strategy that translates a query into compact and efficient machine code using the LLVM compiler framework. By aiming at good code and data locality and predictable branch layout the resulting code frequently rivals the performance of hand-written C++ code. We integrated these techniques into the HyPer main memory database system and show that this results in excellent query performance while requiring only modest compilation time.

Efficiently compiling efficient query plans for modern hardware

摘要

AI总结

期刊

机构

引用论文