3 citations · 6 across the 5 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DB2024
Soft and Constrained Hypertree Width
Matthias Lanzinger, Cem Okulmus, Reinhard Pichler +2
Hypertree decompositions provide a way to evaluate Conjunctive Queries (CQs) in polynomial time, where the exponent of this polynomial is determined by the width of the decompositi…
cs.DB2024★ 1 cited
Avoiding Materialisation for Guarded Aggregate Queries
Matthias Lanzinger, Reinhard Pichler, Alexander Selzer
Optimising queries with many joins is known to be a hard problem. The explosion of intermediate results as opposed to a much smaller final result poses a serious challenge to moder…