Before revision:  Given an acyclic inequality join between tables of size n , it returns the join answers in order and guarantees that for every value of k, the k top-ranked answers are returned in O(n polylog n + k log k) time .
After revision:  With n denoting the number of tuples in the database, we guarantee that for every value of k, the k top-ranked answers are returned in O(n polylog n + k log k) time .