On the complexity of inferring functional dependencies
type: Item
instance of: scholarly article
title: On the complexity of inferring functional dependencies
zbMATH Open document ID: 0767.68034
DOI: 10.1016/0166-218X(92)90031-5
author: Heikki Mannila
author: Kari-Jouko Raeihae
published in: Discrete Applied Mathematics
publication date: 1993-01-31T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 109443
zbMATH Keywords: dependency inference problem
zbMATH Keywords: functional dependencies
zbMATH Keywords: relational database
zbMATH Keywords: query optimization
zbMATH Keywords: lower bounds
Wikidata QID: Q61450080
MaRDI profile type: Publication
cites work: On the Structure of Armstrong Relations for Functional Dependencies
cites work: On the number of databases and closure operations
cites work: Q3341951
cites work: Design by example: An application of Armstrong relations
cites work: Algorithms for inferring functional dependencies from relations
cites work: On the Optimality of Some Set Algorithms
cites work: Q3026386
DBLP publication ID: journals/dam/MannilaR92
Recommended article: Algorithms for inferring functional dependencies from relations
Recommended article: Approximate inference of functional dependencies from relations
Recommended article: Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies
Recommended article: On the Complexity of Insertion Propagation with Functional Dependency Constraints
Recommended article: Efficient discovery of functional dependencies with degrees of satisfaction
Recommended article: Inductive inference of recursive functions: Complexity bounds
Recommended article: Q3341951
Recommended article: Foundations of Information and Knowledge Systems
description: scientific article; zbMATH DE number 109443