Vectorized Query Evaluation in Julia
Richard Gankema & Alex Hall
29 July 2021
less than a minute read
Modern databases can choose between two approaches to evaluating queries with high performance: Query Compilation compiles each query to optimized machine code, while Vectorization interprets queries using BLAS-style primitives.
Query compilation offers more optimization potential for LLVM, while vectorization doesn’t require runtime compilation.
We explain how these techniques work and how we combine them, showcasing how Julia lets us have the best of both.
Related Posts
Loopy Lattices
About a decade ago, Marko Rodriguez wrote a blog post on Loopy Lattices. It became infamous amongst graph database practitioners as it taught them a very important lesson: Never give in to the temptation to ask for all potential paths between two nodes.
Read More
(RAI)volutionizing Master Data
Most master data projects fail because we’ve relied on monolithic MDM platforms, and therefore centralized, highly federated approaches to creating master data. The MDM concept is strong. The benefits and uses of master data can provide value to those corporations who successfully implement it. However, we need to fundamentally change our approach to implementation.
Read More
Trends in Machine Learning: ICLR 2022
Despite early predictions that the deep learning hype would be ephemeral, we are happy to see the field still growing while delivering maturity in algorithms and architectures. ICLR 2022 was full of exciting papers. Here at RelationalAI we spent ~100 hours going through the content as we believe it will drive the commercialization of AI in the following years. We present what we found to be the most noteworthy ideas.
Read More