Generating hinges from arbitrary subhypergraphs

DOI10.1016/0020-0190(92)90157-QzbMath0764.68033OpenAlexW2002051581MaRDI QIDQ1197992

L. L. Miller

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90157-q

zbMATH Keywords

hypergraphrelational databasejoin dependencyembedded join dependencyhingefd-hingeuniversal relation interface

Mathematics Subject Classification ID

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

Related Items (1)

Decomposing constraint satisfaction problems using database techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Testing arbitrary subhypergraphs for the lossless join property
• Completeness issues for join dependencies derived from the universal relation join dependency
• Degrees of acyclicity for hypergraphs and relational database schemes
• Maximal objects and the semantics of universal relation databases
• Query Translation Based on Hypergraph Models
• A Complete Axiomatization of Full Join Dependencies
• A simplied universal relation assumption and its properties

This page was built for publication: Generating hinges from arbitrary subhypergraphs