Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Algorithms for Index-Assisted Selectivity Estimation

Paul M. Aoki

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-98-1021
1998

http://www.eecs.berkeley.edu/Pubs/TechRpts/1998/CSD-98-1021.pdf

The standard mechanisms for query selectivity estimation used in relational database systems rely on properties specific to the attribute types. For example, histograms and quantile values rely on the ability to define a well-ordering over the attribute values. The query optimizer in an object-relational database system will, in general, be unable to exploit these mechanisms for user-defined types, requiring the user to create entirely new estimation mechanisms. Worse, writing the selectivity estimation routines is extremely difficult because the software interfaces provided by vendors are relatively low-level. In this paper, we discuss extensions of the generalized search tree, or GiST, to support user-defined selectivity estimation in a variety of ways. We discuss the computation of selectivity estimates with confidence intervals over arbitrary data types using indices, give methods for combining this technique with random sampling, and present results from an experimental comparison of these methods with several estimators from the literature.


BibTeX citation:

@techreport{Aoki:CSD-98-1021,
    Author = {Aoki, Paul M.},
    Title = {Algorithms for Index-Assisted Selectivity Estimation},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1998},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1998/5681.html},
    Number = {UCB/CSD-98-1021},
    Abstract = {The standard mechanisms for query selectivity estimation used in relational database systems rely on properties specific to the attribute types. For example, histograms and quantile values rely on the ability to define a well-ordering over the attribute values. The query optimizer in an object-relational database system will, in general, be unable to exploit these mechanisms for user-defined types, requiring the user to create entirely new estimation mechanisms. Worse, writing the selectivity estimation routines is extremely difficult because the software interfaces provided by vendors are relatively low-level. In this paper, we discuss extensions of the generalized search tree, or GiST, to support user-defined selectivity estimation in a variety of ways. We discuss the computation of selectivity estimates with confidence intervals over arbitrary data types using indices, give methods for combining this technique with random sampling, and present results from an experimental comparison of these methods with several estimators from the literature.}
}

EndNote citation:

%0 Report
%A Aoki, Paul M.
%T Algorithms for Index-Assisted Selectivity Estimation
%I EECS Department, University of California, Berkeley
%D 1998
%@ UCB/CSD-98-1021
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1998/5681.html
%F Aoki:CSD-98-1021