... Our second contribution is
to show that using more sophisticated (yet natural and
well-studied) indexes may result in instance optimal al-
gorithms for some acyclic queries that are exponentially
better ... A
2
) ✶ ··· ✶ R
n
(A
1
, . . . , A
n
)
when the relations are sorted in lexicographical order
(BST indexes on A
1
, . . . , A
i
for i = 1, . . . , n). Intu-
itively, solving H
n
is equ...