Top-k queries have been studied intensively in the database community and they are an
important means to reduce query cost when only the" best" or" most interesting" results are …

We study theta-joins in general and join predicates with conjunctions and disjunctions of
inequalities in particular, focusing on ranked enumeration where the answers are returned …

When processing join queries over big data, a DBMS can become unresponsive, ie, it takes
very long until any output tuples appear. Ranked enumeration addresses this problem by …

Given a relation and a ranking of its tuples, but no information about the ranking function, we
propose RankExplain to solve 2 types of problems: SAT asks if any linear scoring function …

Database queries can produce a huge output that is infeasible to compute, regardless of the
algorithm or system that processes them. This can often occur when the query joins large …

In this work, we present a plethora of results for the range longest increasing subsequence
problem (Range-LIS) and its variants. The input to Range-LIS is a sequence $\mathcal {S} …

This paper studies a multi-armed bandit (MAB) version of the range-searching problem. In its
basic form, range searching considers as input a set of points (on the real line) and a …