We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
Many popular online services provide "local" or "yellow-pages" search, but none of them allow users to customize the search over user-specified data. Instead, ...
Naren Datha, Tanuja Joshi, Joseph Joy, Vibhuti S. ...
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...