This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking)
aggregate queries, which provide the k groups with the highest aggregates as results …

Rank-aware query processing has emerged as a key requirement in modern applications. In
these applications, efficient and adaptive evaluation of top-k queries is an integral part of the …

One important way in which sampling for approximate query processing in a database
environment differs from traditional applications of sampling is that in a database, it is …

One of the most common operations in analytic query processing is the application of an
aggregate function to the result of a relational join. We describe an algorithm called the Sort …

Database management systems (DBMSs) have been used successfully in traditional
business applications that require persistent data storage and an efficient querying …

The quality of data in relational databases is often uncertain, and the relationship between
the quality of the underlying base tables and the set of potential query results, a type of …

(57) ABSTRACT A parallel hash ripple join algorithm partitions tuples of tWo relations for
localized processing. The algorithm is non blocking and may be performed in a parallel …

Early access to partial query results is highly desirable during exploration of massive data
sets. However, it is challenging to provide transactionally consistent, immediate partial …

We present the architecture of ARGUS, a stream processing system implemented atop
commercial DBMSs to support large-scale complex continuous queries over data streams …

Many applications require a randomized ordering of input data. Examples include
algorithms for online aggregation, data mining, and various randomized algorithms. Most …