Preprint
Oct 2026
Tight Asymptotic Bounds on the Size of Order Graphs
Order graphs were introduced by Arroyuelo et al.\ (TODS 2024) as a generalization of the ring index, to support worst-case optimal joins on relations of arity $d$ while storing as few columns as possible: the index stores one column per edge, so its size is proportional to the number of edges of an order graph. It was...
Ruben Becker, Adrián Gómez-Brandón, Gonzalo Navarro et al.
· 0 citations