Finding compact scheme forests in nested normal form is NP-hard

DOI10.1006/INCO.1994.1022zbMath0804.68035OpenAlexW2091946057MaRDI QIDQ1322463

George Loizou, Peter Thanisch, Jyrki Nummenmaa

Publication date: 12 January 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f6d846ac9e256a4c7e3f043bb6cf5d9703c7f9ec

zbMATH Keywords

relational databasesmultivalued dependenciesnested normal formquery processing performance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

This page was built for publication: Finding compact scheme forests in nested normal form is NP-hard