Syntactic Characterization of Tree Database Schemas
From MaRDI portal
Cited in
(20)- Tree projections and structural decomposition methods: minimality and game-theoretic characterization
- An algorithm for handling many relational calculus queries efficiently.
- A characterization of finite fd-acyclicity
- On hypergraph acyclicity and graph chordality
- Weighted 2-sections and hypergraph reconstruction
- A comparison of structural CSP decomposition methods
- An algorithm for determining minimal reduced-coverings of acyclic database schemes
- The tree projection theorem and relational query processing
- Existence of extensions and product extensions for discrete probability distributions
- Dually chordal graphs
- Interval graphs and related topics
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
- A review of tree convex sets test
- Algorithmic aspects of intersection graphs and representation hypergraphs
- NP-complete problems simplified on tree schemas
- Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers
- On the power of structural decompositions of graph-based representations of constraint problems
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections
- Tree projections: Game characterization and computational aspects
This page was built for publication: Syntactic Characterization of Tree Database Schemas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028374)
