Approximate keys and functional dependencies in incomplete databases with limited domains
DOI10.1007/978-3-031-11321-5_9OpenAlexW4285259755MaRDI QIDQ2103914
Publication date: 9 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-11321-5_9
incomplete databasesdata imputationapproximate functional dependenciesapproximate keysstrongly possible functional dependenciesstrongly possible keys
Database theory (68P15) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Uses Software
Cites Work
- Unnamed Item
- A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
- Approximate inference of functional dependencies from relations
- Measures of association for cross classifications
- Discovery of functional and approximate functional dependencies in relational databases
- Impurity measures in databases
- Functional dependencies in incomplete databases with limited domains
- On Databases with Incomplete Information
- Discovering functional and inclusion dependencies in relational databases
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Functional and approximate dependency mining: database and FCA points of view
- Strongly Possible Functional Dependencies for SQL
This page was built for publication: Approximate keys and functional dependencies in incomplete databases with limited domains
