in Proceeding
| Authors | Fabian Panse, Norbert Ritter |
| Title | Completeness in Databases with Maybe-Tuples |
| Published in | Proceedings of the 4th Workshop on Quality of Information Systems at ER 2009 |
| Editor | Carlos A. Heuser and Günther Pernul |
| Publisher | Springer Heidelberg |
| Medium | Lecture Notes in Computer Science Volume 5833 |
| Date | November 2009 |
| Pages | 202-211 |
| Note | Advances in Conceptual Modeling - ER Workshops |
| Abstract | Some data models use so-called maybe tuples to express the uncertainty, whether or not a tuple belongs to a relation. In order to assess this relations quality the corresponding vagueness needs to be taken into account. Current metrics of quality dimensions are not designed to deal with this uncertainty and therefore need to be adapted. One major quality dimension is data completeness. In general, there are two basic ways to distinguish maybe tuples from definite tuples. First, an attribute serving as a maybe indicator (values YES or NO) can be used. Second, tuple probabilities can be specified. In this paper, the notion of data completeness is redefined w.r.t. both concepts. Thus, a more precise estimating of data quality in databases with maybe tuples (e.g. probabilistic databases) is enabled. |
| Document |  |
| Other formats | Din 1501 |