Home // DBKDA 2019, The Eleventh International Conference on Advances in Databases, Knowledge, and Data Applications // View article

Strongly Possible Keys in Incomplete Databases with Limited Domains

Authors:
Munqath Alattar
Attila Sali

Keywords: Strongly possible keys; null values; approximation of keys.

Abstract:
Missing values that may occur in the key attributes of a database table is an extensive problem and handling it is an important and challenging task, as the records need to contain distinct and total values in their key part. The existing effective approaches include an imputation operation for each occurrence of a null in the key part of the data. In this paper, we assume the situation when the attributes’ domains are not known. For that, a new concept of keys called textit{strongly possible keys} in databases with null values is introduced. It lies between possible keys and certain keys introduced by Köhler et. al. earlier. The definition uses only information extractable from the database table. Furthermore, an approximation concept of the strongly possible key is provided.

Pages: 46 to 50

Copyright: Copyright (c) IARIA, 2019

Publication date: June 2, 2019

Published in: conference

ISSN: 2308-4332

ISBN: 978-1-61208-715-3

Location: Athens, Greece

Dates: from June 2, 2019 to June 6, 2019