@inproceedings{36dc24c83838403d8fdece0c3e77b724,
title = "Probabilistic ontologies and relational databases",
abstract = "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.",
author = "Octavian Udrea and Deng Yu and Edward Hung and Subrahmanian, {V. S.}",
year = "2005",
doi = "10.1007/11575771_1",
language = "English (US)",
isbn = "3540297367",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--17",
booktitle = "On the Move to Meaningful Internet Systems 2005",
note = "OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2005 - On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE ; Conference date: 31-10-2005 Through 04-11-2005",
}