Uniformly-Distributed Random Generation of Join Orders (1995)
| Citations: | 14 - 11 self |
BibTeX
@MISC{Galindo-Legaria95uniformly-distributedrandom,
author = {Cesar A. Galindo-Legaria and Arjan Pellenkoft and Martin L. Kersten},
title = {Uniformly-Distributed Random Generation of Join Orders},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we study the space of operator trees that can be used to answer a join query, with the goal of generating elements form this space at random. We solve the problem for queries with acyclic query graphs. First, we count the exact number of trees that can be used to evaluate a given query. Then, we establish a mapping between the n operator trees for a query and the integers 1 through n ---i. e. a ranking--- and describe efficient ranking and unranking procedures. The generation of random, uniformly distributed operator trees follows from the unraking.
