Deductive information retrieval based on classifications

Kalervo Järvelin and Timo Niemi

Journal of the American Society for Information Science, 1993, vol. 44, issue 10, 557-578

Abstract: Modern fact databases contain abundant data classified through several classifications. Typically, users must consult these classifications in separate manuals or files, thus making their effective use difficult. Contemporary database systems do little to support deductive use of classifications. In this study we show how deductive data management techniques can be applied to the utilization of data value classifications. Computation of transitive class relationships is of primary importance here. We define a representation of classifications which supports transitive computation and present an operation‐oriented deductive query language tailored for classification‐based deductive information retrieval. The operations of this language are on the same abstraction level as relational algebra operations and can be integrated with these to form a powerful and flexible query language for deductive information retrieval. We define the integration of the operations and demonstrate the usefulness of the language in terms of several sample queries. © 1993 John Wiley & Sons, Inc.

Date: 1993
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(199312)44:103.0.CO;2-M

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:44:y:1993:i:10:p:557-578

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().