NotesFAQContact Us
Collection
Advanced
Search Tips
Showing 1 to 15 of 26 results Save | Export
Peer reviewed Peer reviewed
Sharma, Ravi – Information Processing and Management, 1989
Introduces two distribution schemes that partition documents over multiple processors and the corresponding multiprocessor retrieval algorithms that match relevant documents to user queries. The suggested framework is based on a general purpose hypercube multicomputer architecture with a dedicated disk for each node. A timing analysis for the…
Descriptors: Algorithms, Cost Effectiveness, Efficiency, Information Retrieval
Peer reviewed Peer reviewed
Mazur, Zygmunt – Information Processing and Management, 1979
Examines through a series of mathematical models (theorems, descriptions, and examples), properties and operations on inverted files, which are used in an information retrieval system based on thesaurus with weighted descriptors. (CWM)
Descriptors: Algorithms, Indexes, Information Processing, Information Retrieval
Peer reviewed Peer reviewed
Waller, W. G.; Kraft, Donald H. – Information Processing and Management, 1979
Analyzes the use of weights to denote a query representation and/or the indexing of a document as a generalization of a Boolean retrieval system. Criteria are given for the functions used to evaluate the relevance of the records to a specific query and a new evaluation approach is suggested. (CWM)
Descriptors: Algorithms, Evaluation Criteria, Information Processing, Information Retrieval
Peer reviewed Peer reviewed
Radecki, Tadeusz – Information Processing and Management, 1979
Presents a new method of document retrieval based on the fundamental operations of fuzzy set theory. Basic notions are introduced. Then the syntax and semantics of the proposed language for document retrieval is given, and an algorithm allocating documents to particular queries is described and its properties are discussed. (Author/CWM)
Descriptors: Algorithms, Information Processing, Information Retrieval, Information Storage
Peer reviewed Peer reviewed
King, Donald R. – Journal of Library Automation, 1974
The binary vector is suggested as an alternative to the usual method of storing document pointers in an inverted index file. (Author)
Descriptors: Algorithms, Databases, Indexes, Information Retrieval
Edwards, John S. – 1967
Three specific contributions to the field of information retrieval are presented. The first two describe the establishment of an adaptive, interactive man-machine dialogue that produces a form of unsolicited librarian-like assistance for the user in his selection of index terms to characterize an indexing function. The data set upon which the…
Descriptors: Algorithms, Automation, Computer Programs, Evaluation
Peer reviewed Peer reviewed
Steinacker, Ivo – Journal of the American Society for Information Science, 1974
An algorithm is proposed to solve the problem of sequential indexing which does not use any grammatical or semantic analysis, but follows the principle of emulating human judgement by evaluation of machine-recognizable attributes of structured word assemblies. (Author)
Descriptors: Algorithms, Automatic Indexing, Databases, Indexing
Schuegraf, E. J. – Information Storage and Retrieval, 1973
The design of programs to search large document data bases is discussed with regard to the use of compression coding combined with adoption of word fragments as the basic language elements. An algorithm is described for determination of a set of almost equifrequent fragments. Its efficiency is tested. (23 references) (Author)
Descriptors: Algorithms, Computer Programs, Information Retrieval, Information Storage
Peer reviewed Peer reviewed
Murrary, D. M. – Journal of Library Automation, 1970
Virtual scatter storage schemes are well suited dictionaries, having both rapid lookup and economy of storage. (MF)
Descriptors: Algorithms, Automation, Dictionaries, Information Retrieval
Peer reviewed Peer reviewed
Shishibori, Masami; Koyama, Masafumi; Okada, Makoto; Aoe, Jun-ichi – Information Processing & Management, 2000
Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)
Descriptors: Access to Information, Algorithms, Information Retrieval, Information Storage
Litofsky, Barry – 1969
Large-scale, on-line information storage and retrieval systems pose numerous problems above those encountered by smaller systems. A step toward the solution of these problems is presented along with several demonstrations of feasibility and advantages. The methodology on which this solution is based is that of a posteriori automatic classification…
Descriptors: Algorithms, Automation, Classification, Evaluation
Peer reviewed Peer reviewed
Bratley, Paul; Choueka, Yaacov – Information Processing and Management, 1982
Presents uniform and efficient approach for processing all truncated query terms in information retrieval which requires one disk access to obtain from the permuted dictionary all strings represented by truncated term. The problem of the overhead storage required to implement the permuted dictionary is discussed. Fifteen references are provided.…
Descriptors: Algorithms, Information Retrieval, Information Storage, Information Systems
Peer reviewed Peer reviewed
Zaki, M.; Elboraey, F. – Information Processing and Management, 1985
Investigates applicability of inverted file processing in magnetic bubble memories by presenting four magnetic bubble memory models as storage mediums: one based on a major-minor loop configuration; one utilizing a decoder design on a magnetic bubble memory chip; and two based on different structural configurations of the first two. (MBR)
Descriptors: Algorithms, Classification, Computer Storage Devices, Data Processing
CHIEN, R.T.; PREPARATA, F.P. – 1967
ONE OF THE PROBLEMS ENCOUNTERED IN CLUSTERING TECHNIQUES AS APPLIED TO DOCUMENT RETRIEVAL SYSTEMS USING BIBLIOGRAPHIC COUPLING DEVICES IS THAT THE COMPUTATIONAL EFFORT REQUIRED GROWS ROUGHLY AS THE SQUARE OF THE COLLECTION SIZE. IN THIS STUDY GRAPH THEORY IS APPLIED TO THIS PROBLEM BY FIRST MAPPING THE CITATION GRAPH OF THE DOCUMENT COLLECTION…
Descriptors: Algorithms, Bibliographic Coupling, Classification, Cluster Grouping
Air Force Systems Command, Wright-Patterson AFB, OH. Foreign Technology Div. – 1969
Questions of the automation of input, output and data processing on computers in systems of information services are covered in the discussion of peculiarities of applied computers and processed information, general characteristics of processing algorithms and problems of information input and output. This is followed by a discussion of the…
Descriptors: Abstracting, Algorithms, Automatic Indexing, Automation
Previous Page | Next Page ยป
Pages: 1  |  2