1993
DOI: 10.1002/(sici)1097-4571(199312)44:10<557::aid-asi2>3.0.co;2-m
|View full text |Cite
|
Sign up to set email alerts
|

Deductive information retrieval based on classifications

Abstract: Modern fact databases contain abundant data ciassified 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 re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1995
1995
2000
2000

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…. The main menu for impact factor analysis which are returned as a set [23]. The two sets of article numbers are finally intersected by the operation set_intersection.…”
Section: Generalised Impact Factorsmentioning
confidence: 99%
See 1 more Smart Citation
“…. The main menu for impact factor analysis which are returned as a set [23]. The two sets of article numbers are finally intersected by the operation set_intersection.…”
Section: Generalised Impact Factorsmentioning
confidence: 99%
“…references) of article art_5 are denoted by im_successors(art_5, [CITES]) = {art_3, …}. These notations correspond to the operations of our query language for transitive processing [16,23] which will be used below. The query language also has an acyclicity checking tool for the binary relations.…”
Section: Introductionmentioning
confidence: 99%