Completeness in Databases with Maybe-Tuples

  • Authors:
  • Fabian Panse;Norbert Ritter

  • Affiliations:
  • University of Hamburg, Hamburg, Germany 22527;University of Hamburg, Hamburg, Germany 22527

  • Venue:
  • ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 relation's 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.