Before revision: We study full acyclic join queries with general join predicates that involve conjunctions and disjunctions of inequality. Specifically, we provide the first non-trivial algorithms for the problem of ranked enumeration where the query results are returned incrementally in an order dictated by a given ranking function.
After revision: We study full acyclic join queries with general join predicates that involve conjunctions and disjunctions of inequalities, focusing on ranked enumeration where the query results are returned incrementally in an order dictated by a given ranking function.