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 …

Query optimizers rely on fast, high-quality estimates of result sizes in order to select between
various join plans. Selfjoin sizes of relations provide bounds on the join size of any pairs of …

Data analysis is fundamentally an iterative process in which you issue a query, receive a
response, formulate the next query based on the response, and repeat. You usually don't …

We present a pipelining, dynamically user-controllable reorder operator, for use in data-
intensive applications. Allowing the user to reorder the data delivery on the y increases the …

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 …

In this paper, we study the progressive evaluation of nested queries with aggregates (ie, the
inner query block is an aggregate query), where users are provided progressively with …

Reviews techniques for exploring large object-relational scientific and statistical databases
in an interactive online manner. The idea is to provide continuously updated running …

D ata analysis is fundamentally an iterative process in which you issue a query, receive a
response, formulate the next query based on the response, and repeat. You usually don't …

Today's information systems are based on designs that are a quarter-century old: centralized
servers with local metadata, black-box user interactions, complex monolithic software, and …