As the data management field has diversified to consider settings in which queries are
increasingly complex, statistics are less available, or data is stored remotely, there has been …

In this paper, we present BlinkDB, a massively parallel, approximate query engine for
running interactive SQL queries on large volumes of data. BlinkDB allows users to trade-off …

Perhaps the most basic synopsis of a data stream is a sample of elements from the stream. A
key benefit of such a sample is its flexibility: the sample can serve as input to a wide variety …

Abstract Methods for Approximate Query Processing (AQP) are essential for dealing with
massive data. They are often the only means of providing interactive response times when …

The first edition of this book appeared in 1991 when the technology was new and there were
not too many products. In the Preface to the first edition, we had quoted Michael Stonebraker …

The widespread distribution and availability of small-scale sensors, actuators, and
embedded processors is transforming the physical world into a computing platform. One …

In this paper, we reflect on the state of the art of Approximate Query Processing. Although
much technical progress has been made in this area of research, we are yet to see its impact …

In large federated and shared-nothing databases, resources can exhibit widely fluctuating
characteristics. Assumptions made at the time a query is submitted will rarely hold …

Joins are expensive, and online aggregation over joins was proposed to mitigate the cost,
which offers users a nice and flexible tradeoff between query efficiency and accuracy in a …

Influence maximization is a classic and extensively studied problem with important
applications in viral marketing. Existing algorithms for influence maximization, however …