2 citations · 6 across the 13 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DB2012
Computing optimal k-regret minimizing sets with top-k depth contours
Sean Chester, Alex Thomo, S. Venkatesh +1
Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 quer…
cs.DB2012★ 2 cited
Indexing Reverse Top-k Queries
Sean Chester, Alex Thomo, S. Venkatesh +1
We consider the recently introduced monochromatic reverse top-k queries which ask for, given a new tuple q and a dataset D, all possible top-k queries on D union {q} for which q is…