On 11/18/06, Rodrigo Hjort <[EMAIL PROTECTED]> wrote:
Based on the paper below , I ask: is there anyone working on, or already
tried to such native implementation on PostgreSQL? I didn't find anything
related on pgFoundry. There is also a presentation  related to the paper.
"By Souripriya Das, Eugene Inseok Chong, George Eadon, Jagannathan
Srinivasan, Proceedings of the 30th VLDB Conference, Toronto, Canada.
Ontologies are increasingly being used to build applications that utilize
domain-specific knowledge. This paper addresses the problem of supporting
ontology-based semantic matching in RDBMS. The approach enables users to
reference ontology data directly from SQL using the semantic match
operators, thereby opening up possibilities of combining with other
operations such as joins as well as making the ontology-driven applications
easy to develop and efficient. In contrast, other approaches use RDBMS only
for storage of ontologies and querying of ontology data is typically done
via APIs. This paper presents the ontology-related functionality including
inferencing, discusses how it is implemented on top of Oracle RDBMS, and
illustrates the usage with several database applications."
Besides, what are your opinions on the subject?
Is it worthful to have such native implementation on PG, even as a modest
Based on your development know-how on the backend internals, how difficult
is it to develop this (3 operators + 1 index type)?
For simple situations of BT/NT ontology relationships, check out the
ltree contrib module*. It allows building and indexing of directed
graphs and other network-like structures, and seems ideal for both
path storage and search.
[thinks some more]
If applied as a column per axis, ltree may be enough ... interesting
stuff in any case.
CELEPAR - Cia de Informática do Paraná - Brasil
GPLS -- PINES Development
---------------------------(end of broadcast)---------------------------
TIP 3: Have you checked our extensive FAQ?