The complexity of recognizing 3NF relation schemes
From MaRDI portal
Publication:1166279
DOI10.1016/0020-0190(82)90034-5zbMath0488.68062MaRDI QIDQ1166279
Jiann H. Jou, Patrick C. Fischer
Publication date: 1982
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(82)90034-5
68Q25: Analysis of algorithms and problem complexity
68P05: Data structures
68P20: Information storage and retrieval of data
Related Items
An efficient algorithm for 3NF determination, Succinctness in dependency systems, Polynomial tests of normal forms and some related results, Functional dependencies in relational databases: A lattice point of view
Cites Work