The effect of unary inclusion dependencies on relational database design

DOI10.1016/0898-1221(92)90214-3zbMath0800.68371OpenAlexW2006778591WikidataQ114683440 ScholiaQ114683440MaRDI QIDQ1205894

Yanchun Zhang, Maria E. Orlowska

Publication date: 1 April 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(92)90214-3

zbMATH Keywords

functional dependencies\(k\)-cyclesinclusion dependenciesrelational database designmulti-graph presentation

Mathematics Subject Classification ID

Database theory (68P15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Inclusion dependencies and their interaction with functional dependencies
• Graph Algorithms for Functional Dependency Manipulation
• Polynomial-time implication problems for unary inclusion dependencies
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• An efficient search algorithm to find the elementary circuits of a graph
• A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph

This page was built for publication: The effect of unary inclusion dependencies on relational database design