Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Probabilistic Ontologies and Relational Databases
verfasst von : Octavian Udrea, Deng Yu, Edward Hung, V. S. Subrahmanian
Erschienen in: On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a
constrained probabilistic ontology
(CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.