Joseph M. Hellerstein and Lisa Hellerstein and George Kollios

EECS Department, University of California, Berkeley

Technical Report No. UCB/CSD-98-1013

, 1998

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1998/CSD-98-1013.pdf

A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative effectiveness. In order to empirically evaluate these indexes, it is helpful to have methodologies for generating random queries for performance testing. In this paper we propose a natural, domain-independent approach to the generation of random queries for experimenting with indexes: choose randomly among all logically distinct queries. <p>We investigate this idea in the context of a widely-used and widely-studied indexing workload: range queries over 2-dimensional points. We present an algorithm that chooses randomly among logically distinct 2-d range queries. It has constant-time expected performance over uniformly distributed data, and exhibited good performance in experiments over a variety of real and synthetic data sets. <p>We observe nonuniformities in the way randomly chosen logical 2-d range queries are distributed over a variety of spatial properties. This raises questions about the quality of the workloads generated from such queries. To explore this further, we contrast our approach of choosing random logical range queries with previous work that generates workloads of random spatial ranges. We highlight pros and cons of the alternate approaches, and sketch directions for future work on the robust generation of workloads for studying index performance.

---

BibTeX citation:

@techreport{Hellerstein:CSD-98-1013,
    Author= {Hellerstein, Joseph M. and Hellerstein, Lisa and Kollios, George},
    Title= {On the Generation of 2-Dimensional Index Workloads},
    Year= {1998},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1998/5797.html},
    Number= {UCB/CSD-98-1013},
    Abstract= {A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative effectiveness. In order to empirically evaluate these indexes, it is helpful to have methodologies for generating random queries for performance testing. In this paper we propose a natural, domain-independent approach to the generation of random queries for experimenting with indexes: choose randomly among all logically distinct queries. <p>We investigate this idea in the context of a widely-used and widely-studied indexing workload: range queries over 2-dimensional points. We present an algorithm that chooses randomly among logically distinct 2-d range queries. It has constant-time expected performance over uniformly distributed data, and exhibited good performance in experiments over a variety of real and synthetic data sets. <p>We observe nonuniformities in the way randomly chosen logical 2-d range queries are distributed over a variety of spatial properties. This raises questions about the quality of the workloads generated from such queries. To explore this further, we contrast our approach of choosing random logical range queries with previous work that generates workloads of random spatial ranges. We highlight pros and cons of the alternate approaches, and sketch directions for future work on the robust generation of workloads for studying index performance.},
}

EndNote citation:

%0 Report
%A Hellerstein, Joseph M. 
%A Hellerstein, Lisa 
%A Kollios, George 
%T On the Generation of 2-Dimensional Index Workloads
%I EECS Department, University of California, Berkeley
%D 1998
%@ UCB/CSD-98-1013
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1998/5797.html
%F Hellerstein:CSD-98-1013