A note on approximation measures for multi-valued dependencies in relational databases

DOI10.1016/S0020-0190(02)00365-4zbMath1011.68032OpenAlexW2056802754MaRDI QIDQ1853694

Chris Giannella, Edward L. Robertson

Publication date: 22 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00365-4

zbMATH Keywords

computational complexitybicliquesgraph algorithmsdatabasesmulti-valued dependencies

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Unnamed Item

Uses Software

• FastFDs
• TANE

Cites Work

• Approximate inference of functional dependencies from relations
• Statistical treatment of the information content of a database
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
• Measures of Association for Cross Classifications
• Functional and embedded dependency inference: A data mining point of view
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on approximation measures for multi-valued dependencies in relational databases