Järvelin, K.; Niemi, T.: Deductive information retrieval based on classifications (1993)
0.00
0.0035694437 = product of:
0.014277775 = sum of:
0.014277775 = weight(_text_:information in 2229) [ClassicSimilarity], result of:
0.014277775 = score(doc=2229,freq=8.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.23274569 = fieldWeight in 2229, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=2229)
0.25 = coord(1/4)
- Abstract
- Modern fact databses contain abundant data classified through several classifications. Typically, users msut consult these classifications in separate manuals or files, thus making their effective use difficult. Contemporary database systems do little 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 these operations and demonstrate the usefulness of the language in terms of several sample queries
- Source
- Journal of the American Society for Information Science. 44(1993) no.10, S.557-578
