What question did this study set out to answer?

This work aims to present a compilation method for relational algebra that optimizes fused operations on multisets.

A Compiler for Fused Relational Operations on Multisets

View Full Paper

Ask AI

Bookmark

This work aims to present a compilation method for relational algebra that optimizes fused operations on multisets.
Developed a loop-based intermediate representation (IR) for relational algebra operations.
Lowered relational algebra query plan trees to the IR, including complex operators.
Compiled the IR into efficient C++ code for diverse data structures.
Achieved a 3.8x speedup (0.8--12.1x) compared to Hyper on selected LSQB benchmarks.
Generated C++ code with sequential performance similar to Hyper, showing a 1.0x speedup (0.4--4.3x).
Approached Hyper's parallel performance with a 0.6x speedup (0.2--1.8x).

No takes yet. Share an insight, caveat, or question.

Randomized trial shows optimized relational operations in databases, suggesting improved performance for complex queries.

Dong et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark