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 large data warehousing environments, it is often advantageous to provide fast,
approximate answers to complex decision support queries using precomputed summary …

Wide-area distribution raises significant performance problems for traditional query
processing techniques as data access becomes less predictable due to link congestion …

As query engines are scaled and federated, they must cope with highly unpredictable and
changeable environments. In the Telegraph project, we are attempting to architect and …

As the area of data management for the Internet has gained in popularity, recent work has
focused on effectively dealing with unpredictable, dynamic data volumes and transfer rates …

We present a pipelining, dynamically tunable reorder operator for providing user control
during long running, data-intensive operations. Users can see partial results and …

In many decision-making scenarios, decision makers require rapid feedback to their queries,
which typically involve aggregates. The traditional blocking execution model can no longer …

Data warehouses are becoming a powerful tool to analyze enterprise data. A critical
demand imposed by the users of data warehouses is that the time to get an answer (latency) …

Data analysts are frequently interested in finding a certain subset of query answers quickly.
The process of computing a particular block of query answers quickly is known as partial …

Data warehouses are becoming a powerful tool to analyze enterprise data. A critical
demand imposed by the users of data warehouses is that the time to get an answer latency …