A Synchronous Search for Documents
Abstract
An algorithm is described of a synchronous search in a complex system of selective retrieval of documents, with an allowance for exclusion of information loss. All documents containing if only one concept common with the concept specified in the claim slip are retrieved. The search pattern (SP) corresponds to the search claim (SC) if even one SC-characteristic is equal to one of the SP-characteristics. Then, SC is a disjunction of search characteristic, which greatly simplifies the search algorithm. Examples are given that illustrate the disjunction method of search. The algorithm was realized on a Minsk-2 digital computer. The program includes 400 octonary instructions and occupies 550 octonary cells. The program consists of three blocks: the search proper, the establishment of absolute community of meaning between selected documents and claims, and the delivery of results. An SP-file and an SC-bank serve as input information. The numbers of SC which correspond to the numbers of coming documents serve as output information; SC are stored on a magnetic tape. The number of topics served by the synchronous search goes into thousands; a search within 500-600 topics is performed without additional access to the tape.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 05, 1970
- Accession Number
- AD0717064
Entities
People
- I. N. Kar-yalaine