Intersection graphs of k-acyclic families of subtrees and relational database query processing.

DOI10.1016/S0020-0190(98)00028-3zbMATH Open1078.68622OpenAlexW1980479334MaRDI QIDQ2583532FDOQ2583532

Authors Oded Shmueli, Fanica Gavril

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00028-3

zbMATH Keywords

Algorithms2-acyclic family of subtreesAcyclic relational databaseIntersection graph of subtreesNeighborhood chordal graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 859448
• Intersection graphs of concatenable subtrees of graphs
• Intersection graphs of Helly families of subtrees
• The tree projection theorem and relational query processing
• On the subgraph query problem
• Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
• Families of induced trees and their intersection graphs
• Succinct data structures for families of interval graphs
• The \(k\)-edge intersection graphs of paths in a tree
• The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation

Cites work

• Generating the maximum spanning trees of a weighted graph
• Intersection graphs of Helly families of subtrees
• On the tree representation of chordal graphs
• Power of Natural Semijoins
• The intersection graphs of subtrees in trees are exactly the chordal graphs

This page was built for publication: Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583532)