Before revision: We study full acyclic join queries with general join predicates that involve conjunctions and disjunctions of inequalities  , focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function.
After revision: We study theta-joins in general and join predicates with conjunctions and disjunctions of inequalities , focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function.