Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
Numerous widely publicized cases of theft and misuse of private information underscore the need for audit technology to identify the sources of unauthorized disclosure. We present...
Rakesh Agrawal, Alexandre V. Evfimievski, Jerry Ki...
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...