A unifying probability measure for logic-based similarity conditions on uncertain relational data

  • Authors:
  • Sebastian Lehrack;Ingo Schmitt

  • Affiliations:
  • Brandenburg University of Technology Cottbus, Cottbus, Germany;Brandenburg University of Technology Cottbus, Cottbus, Germany

  • Venue:
  • Proceedings of the 1st Workshop on New Trends in Similarity Search
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A Boolean logic-based evaluation of a database query returns true on match and false on mismatch. Unfortunately, there are many application scenarios where such an evaluation is not possible or does not adequately meet user expectations about vague and uncertain conditions. Consequently, there is a need for incorporating impreciseness and proximity into a logic-based query language. A probabilistic approach known from Information Retrieval expresses the fulfilling of a condition by a probability of relevance. Besides relevance probabilities used in IR probabilistic databases have been established as a challenging research field. In this work we lay the theoretical basis for the combination of relevance probabilities and probabilistic databases evaluated by a unifying probability measure.