qlever
qlever copied to clipboard
IKKBZ Join ordering
Finds optimal left-deep tree for an acyclic graph in polynomial time and a necessary prerequisite for search-space linearization.
~~the cost function has a slight implementation mistake due to a misunderstanding on my behalf, which subsequently has a slight effect on the relation rank. i will fix that ASAP.~~