Generalized transitive closure for relational queries

Seppo Sippu, Eljas Soisalon-Soininen

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Sammanfattning

We augment relational algebra with a generalized transitive closure operator that allows for the efficient evaluation of a subclass of recursive queries. The operator is based on a composition operator which is as general as possible when the operator is required to be associative and when only relational algebra operators are used in its definition. The closure of such a composition can be computed using the well-known efficient algorithms designed for the computation of the usual transitive closure. Besides the case in which complete materialization of recursive relations are required, our strategy also yields an efficient solution in the case in which a selection is applied to the closure.
Originalspråkengelska
Titel på gästpublikationProceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems : March 21-23, 1988, Austin, Texas
Antal sidor8
UtgivningsortNew York, NY
FörlagACM
Utgivningsdatum1988
Sidor325-332
ISBN (tryckt)0-89791-263-2
DOI
StatusPublicerad - 1988
MoE-publikationstypA4 Artikel i en konferenspublikation
EvenemangACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) - Austin, Texas, Förenta Staterna (USA)
Varaktighet: 21 mar 198823 mar 1988
Konferensnummer: 7

Vetenskapsgrenar

  • 113 Data- och informationsvetenskap

Citera det här