(Almost) Optimal parallel block access for range queries

Optimal Parallel I/O for Range Queries through Replication

Asymptotically Optimal Declustering Schemes for Range Queries

Optimal Succinctness for Range Minimum Queries

For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into a scheme of size 2n + o(n) bits that allows to answer range minimum queries on A in constant time. This space is asymptotically optimal in the important setting where access to A is not permitted after the preprocessi...

Almost Optimal Stochastic Weighted Matching With Few Queries

We consider the stochastic matching problem. An edge-weighted general graph G(V,E) is given in the input, where each edge in E is realized independently with probability p. The realization is initially unknown, however, we are able to query the edges to determine whether they are realized. The goal is to query only a small number of edges to find a realized matching that is sufficiently close t...

Optimal Histograms for Hierarchical Range Queries Extended Abstract

Now there is tremendous interest in data warehousing and OLAP applications. OLAP applications typically view data as having multiple logical dimensions (e.g., product, location) with natural hierarchies de ned on each dimension, and analyze the behavior of various measure attributes (e.g., sales, volume) in terms of the dimensions. OLAP queries typically involve hierarchical selections on some ...