Paper Info
Title
Strongly Possible Keys for SQL
Abstract
Missing data value is an extensive problem in both research and industrial developers. Two general approaches are there to deal with the problem of missing values in databases; they could be either ignored (removed) or imputed (filled in) with new values (Farhangfar et al. in IEEE Trans Syst Man Cybern-Part A: Syst Hum 37(5):692–709, 2007). For some SQL tables, it is possible that some candidate key of the table is not null-free and this needs to be handled. Possible keys and certain keys to deal with this situation were introduced in Köhler et al. (VLDB J 25(4):571–596, 2016). In the present paper, we introduce an intermediate concept called strongly possible keys that is based on a data mining approach using only information already contained in the SQL table. A strongly possible key is a key that holds for some possible world which is obtained by replacing any occurrences of nulls with some values already appearing in the corresponding attributes. Implication among strongly possible keys is characterized, and Armstrong tables are constructed. An algorithm to verify a strongly possible key is given applying bipartite matching. Connection between matroid intersection problem and system of strongly possible keys is established. For the cases when no strongly possible keys hold, an approximation notion is introduced to calculate the closeness of any given set of attributes to be considered as a strongly possible key using the $$g_3$$ measure, and we derive its component version $$g_4$$ . Analytical comparisons are given between the two measures.
Year
DOI
Venue
2020
10.1007/s13740-020-00113-8
Journal on Data Semantics
Keywords
DocType
Volume
Possible and certain keys, Strongly possible keys, Database, Null values, Data imputation, Armstrong tables, Implication problem
Journal
9
Issue
ISSN
Citations 
2
1861-2032
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Munqath Alattar100.68
Attila Sali200.68