On the mean execution time of recursive definitions on relational databases

Fernandez de la Vega, Wenceslas; Paschos, Vangelis; Stafylopatis, Andreas

Fernandez de la Vega, Wenceslas; Paschos, Vangelis; Stafylopatis, Andreas (1991), On the mean execution time of recursive definitions on relational databases, dans Thalheim, Bernhard; Demetrovics, Janos; Gerhardt, Hans-Detlef, MFDBS 91 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Rostock, Germany, May 6-9, 1991 Proceedings, Springer : Berlin, p. 119-133. http://dx.doi.org/10.1007/3-540-54009-1_9

Type

Communication / Conférence

Date

1991

Titre du colloque

3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, MFDBS'91

Date du colloque

1991-05

Ville du colloque

Rostock

Pays du colloque

Allemagne

Titre de l'ouvrage

MFDBS 91 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Rostock, Germany, May 6-9, 1991 Proceedings

Auteurs de l’ouvrage

Thalheim, Bernhard; Demetrovics, Janos; Gerhardt, Hans-Detlef

Éditeur

Springer

Titre de la collection

Lecture Notes in Computer Science

Numéro dans la collection

495

Ville d’édition

Berlin

Isbn

978-3-540-54009-0

Nombre de pages

395

Pages

119-133

Résumé (EN)

The execution cost of a regular recursive definition is evaluated in the case where the database relation is represented by means of a forest of labeled oriented trees. The cost is evaluated for all possible types of queries with respect to the binding of the variables in the definition. The mean execution cost is also evaluated, where the mean is computed over all databases representable by forests. Also, a cost reduction technique is investigated—the intermediate storage—and the corresponding execution cost is computed.

Mots-clés

relational databases