Before revision:  As a side benefit, our techniques are also applicable to unranked enumeration (where answers can be returned in any order) for joins with inequalities, returning k answers in \mathcal{O(n } n + k). This guarantee improves over the state of the art for large values of k. In an experimental study , we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice .
After revision:  As a side benefit, our techniques are also applicable to unranked enumeration (where answers can be returned in any order) for joins with inequalities, returning k answers in \mathcal{O(n } In addition to providing the first non-trivial theoretical guarantees beyond equi-joins, we show in an experimental study , we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice .