Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Language and representation in information retrieval
Language and representation in information retrieval
Terminological reasoning is inherently intractable (research note)
Artificial Intelligence
Reasoning and revision in hybrid representation systems
Reasoning and revision in hybrid representation systems
Communications of the ACM
Information Retrieval
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
PRIME-GC. A medical information retrieval prototype on the Web
RIDE '97 Proceedings of the 7th International Workshop on Research Issues in Data Engineering (RIDE '97) High Performance Database Management for Large-Scale Applications
A logical relational approach for information retrieval indexing
IRSG'97 Proceedings of the 19th Annual BCS-IRSG conference on Information Retrieval Research
Hi-index | 0.00 |
In information retrieval, the way in which correspondence procedure works is highly important for the performance of the underlying system as a whole. An inverted file ensures quick access to the information items because the index alone is examined rather than the actual file of items, in order to determine the items which satisfy the search request. This technique was a prominent feature of the old commercial Information Retrieval Systems (IRS). However, it has been used only for keyword-based IRS. Since that time the inverted file design has not been radically modified. With the recent use of more expressive and richly structured languages in information retrieval, this method has not been used very much lately because it can be overrun by the expressiveness that new indexing languages, such as knowledge representation languages, brought about. We propose here to make use again of an extended version of the almost forgotten inverted file techniques, so that the complexity of our algorithms be polynomial. This will allow us to implement, with few modifications, a retrieval engine based on conceptual graphs on top of the O2 object oriented DBMS.