Probabilistic Ontologies and Relational Databases

TitleProbabilistic Ontologies and Relational Databases
Publication TypeBook Chapters
Year of Publication2005
AuthorsUdrea O, Yu D, Hung E, Subrahmanian V
EditorMeersman R, Tari Z
Book TitleOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE
Series TitleLecture Notes in Computer Science
Pagination1 - 17
PublisherSpringer Berlin / Heidelberg
ISBN Number978-3-540-29736-9
KeywordsComputer, Science

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.