This paper introduces RankSQL, a system that provides a systematic and principled
framework to support efficient evaluations of ranking (top-k) queries in relational database …

Spatiotemporal databases are becoming increasingly more common. Typically, applications
modeling spatiotemporal objects need to process vast amounts of data. In such cases …

Many of the data sources used in stream query processing are known to exhibit bursty
behavior. Data in a burst often has different characteristics than steady-state data, and …

The problem of estimating progress for long-running queries has recently been introduced.
We analyze the characteristics of the progress estimation problem, from the perspective of …

Minimizing both the response time to produce the first few thousand results and the overall
execution time is important for interactive querying. Current join algorithms either minimize …

Statistical estimation and approximate query processing have become increasingly
prevalent applications for database systems. However, approximation is usually of little use …

Among the different types of algorithms proposed to test static random access memories
(SRAMs), March tests have proven to be faster, simpler and regularly structured. New …

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 for computing …

Traditionally, distributed query optimization techniques generate static query plans at
compile time. However, the optimality of these plans depends on many parameters (such as …

The growth of electronic commerce and the widespread use of sensor networks has created
the demand for online processing and monitoring applications [Madden and Franklin, 2002; …