A promising retrieval algorithm for systems based on the conceptual graphs formalism

Conceptual graphs can be used as a simple and expressive language for indexing and retrieving non-textual documents. In this knowledge representation formalism, the implementation of the matching function between a query and a document is obtained by the so-called projection operator between two conceptual graphs. A good implementation of the projection algorithm is therefore crucial for managing large bases of text and image documents. We present a new promising implementation. It has the important feature that it applies the projection to the whole document index database. We implemented the approach on top of the OO-DBMS O/sub 2/. As the matching function is reduced to a sequence of set operators, the time performance is improved as compared to previous implementations of the projection as an inference process. The experimental results prove the feasibility of the approach in terms of retrieval time performance.