Completeness in databases with Maybe-Tuples

Link:
Autor/in:
Beteiligte Personen:
  • Heuser , Carlos Alberto
  • Pernul, Günther
Verlag/Körperschaft:
Springer
Erscheinungsjahr:
2009
Medientyp:
Text
Schlagworte:
  • Database systems
  • Semantics
  • Database model
  • Database Systems
  • Ontology
  • Query Processing
  • Data completeness
  • Maybe tuple
  • Probabilistic database
  • Database systems
  • Semantics
  • Database model
  • Database Systems
  • Ontology
  • Query Processing
Beschreibung:
  • 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. © Springer-Verlag Berlin Heidelberg 2009.
Lizenz:
  • info:eu-repo/semantics/closedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/6e256821-590d-4a0f-a3db-33431a3c81ce