This document discusses compiling database queries into machine code for more efficient processing. It proposes using just-in-time compilation of queries at runtime to avoid overhead from traditional interpretation while minimizing memory usage. The paper shows how queries can be optimized and code generated together for performance, demonstrated through the Hyper system which uses query compilation and achieves excellent performance.
This document discusses compiling database queries into machine code for more efficient processing. It proposes using just-in-time compilation of queries at runtime to avoid overhead from traditional interpretation while minimizing memory usage. The paper shows how queries can be optimized and code generated together for performance, demonstrated through the Hyper system which uses query compilation and achieves excellent performance.
This document discusses compiling database queries into machine code for more efficient processing. It proposes using just-in-time compilation of queries at runtime to avoid overhead from traditional interpretation while minimizing memory usage. The paper shows how queries can be optimized and code generated together for performance, demonstrated through the Hyper system which uses query compilation and achieves excellent performance.
S.NANDHINI DEPARTMENT OF COMPUTER SCIENCE ENGINEERING SRI RAM ENGINEERING COLLEGE CHENNAI, INDAI Nandhusara01@gmail.com
K.POONGOTHAI DEPARTMENT OF COMPUTER SCIENCE ENGINEERING SRI RAM ENGINEERING COLLEGE CHENNAI, INDAI sharmilakarthik14@gmail.com
ABSTRACT On modern servers the working set of database management systems becomes more and more main memory resident. Slow disk accesses are largely avoided, and thus the in-memory processing speed of databases becomes an important factor. most attractive approach for fast query processing is just- in- time compilation of incoming queries. By producing a machine code at runtime. we avoid the overhead of a traditional interpretation systems, and there by carefully organizing the machine code around register usage. we minimize memory traffic during compilation and get excellent performance. our paper shows that how queries can be brought into a form suitable for efficient translation, and how the underlying generation of the code can be grouped together. By carefully abstracting away the necessary plumbing infrastructure we can build a query compiler that is both maintainable and efficient. The effectiveness of the approach is demonstrated by the Hyper systems, that uses a query compilation as its execution strategy, and that achieves excellent performance Keywords: just-in-time compilation, minimize memory traffic, more memory space, in-memory processing speed