Efficient evaluation for a subset of recursive queries

Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Sammanfattning

Well-known results on graph traversal are used to develop a practical, efficient algorithm for evaluating regularly and linearly recursive queries in databases that contain only binary relations. Transformations are given that reduce a subset of regular and linear queries involving n-ary relations (n > 2) to queries involving only binary relations.
Originalspråkengelska
Titel på gästpublikationProceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems : March 23-25, 1987, San Diego, California
Antal sidor10
UtgivningsortNew York, NY
FörlagACM
Utgivningsdatum1987
Sidor284-293
ISBN (tryckt)0-89791-223-3
DOI
StatusPublicerad - 1987
MoE-publikationstypA4 Artikel i en konferenspublikation
EvenemangACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) - San Diego, California, Förenta Staterna (USA)
Varaktighet: 23 mar 198725 mar 1987
Konferensnummer: 6

Vetenskapsgrenar

  • 113 Data- och informationsvetenskap

Citera det här