RELIEF: combining expressiveness and rapidity into a single system
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Effective and efficient relational query processing using conceptual graphs
IRSG'98 Proceedings of the 20th Annual BCS-IRSG conference on Information Retrieval Research
| Hi-index | 0.00 |
We introduce in this paper the RELIEF retrieval system, a system for image retrieval based on the conceptual graph formalism. Conceptual graphs can be used as a simple and expressive language for indexing and retrieving non--textual documents. In this formalism the implementation of the matching function between a query and a document is obtained by using the so-called projection operator between two conceptual graphs. However, the first implementations of this operator have shown its lack of efficiency, as it is based on an exponential algorithm. The RELIEF system supports a new polynomial matching function for conceptual graphs which turns out to be equivalent to the projection operator but it has the important feature that it incorporates reasoning about relations. This allows for better qualitative results as well as improved time performance compared to the original system implementing the classical projection. RELIEF is developed on top of the object oriented DBMS O2, and any WWW-navigator with JAVA facilities can be used to access its interface.