Image from Google Jackets

Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions

Tipo de material: TextoTextoSeries ; SIAM Journal on Compiting, 10(3), p.405-421, 1981Trabajos contenidos:
  • Aho, A.V
  • Sagiv, Y
  • Szymanski, T.G
  • Ullman, J.D
Tema(s): Recursos en línea: Resumen: We present an algorithm for constructing a tree to satisfy a set of lineage constraints on common ancestors. We then apply this algorithm to synthesize a relational algebra expression from a simple tableau, a problem arising in the theory of relational databases.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
Documentos solicitados Documentos solicitados CICY Documento préstamo interbibliotecario Ref1 B-11681 (Browse shelf(Opens below)) Available

We present an algorithm for constructing a tree to satisfy a set of lineage constraints on common ancestors. We then apply this algorithm to synthesize a relational algebra expression from a simple tableau, a problem arising in the theory of relational databases.

There are no comments on this title.

to post a comment.