Descriptor
Source
| Information Storage and… | 25 |
Author
| Heaps, H. S. | 2 |
| Schuegraf, E. J. | 2 |
| Borillo, A. | 1 |
| Coaker, Frank W. | 1 |
| Corning, Mary E. | 1 |
| Dabrowski, Miroslaw | 1 |
| De Heer, T. | 1 |
| Farradane, J. | 1 |
| Giroux, Pierre | 1 |
| Grimson, J. B. | 1 |
| Hall, J. L. | 1 |
| More ▼ | |
Publication Type
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Grimson, J. B.; Stacey, G. M. – Information Storage and Retrieval, 1974
Two different directory structuring techniques--division hash technique and a hydrid technique--are compared for the same set of keys with directories of from 10,000 to 100,000 unique keys. Retrieval costs, in terms of the number of accesses of secondary storage required to retrieve the keys, are considered in detail. (Author)
Descriptors: Computer Programs, Databases, Information Storage
Heaps, H. S.; Schuegraf, E. J. – Information Storage and Retrieval, 1975
Describes the advantages of using variable length equifrequent fragments as the language elements for compression coding of large data bases. (Author)
Descriptors: Algorithms, Databases, Information Storage, Information Systems
Reardon, Bernard C. – Information Storage and Retrieval, 1974
The Retrieval of information by means of freely-chosen descriptors may be handled efficiently by creating an inverted file organization in an adaptive manner, entries in this file being generated by sequential searching of the master file, when required. (Author)
Descriptors: Databases, Information Retrieval, Information Storage, Search Strategies
Giroux, Pierre; Khadem, Riaz – Information Storage and Retrieval, 1973
An English summary is provided for this French article which describes the first stage of a research project using the Bose, Ghosh and Abraham theory with attributes of multiple values applied to a file containing a large number (10 6) of records. (7 references) (Author/SJ)
Descriptors: Databases, Information Processing, Information Retrieval, Information Storage
Lynch, Michael F. – Information Storage and Retrieval, 1973
Substantial degrees of compression of bibliographical data bases result from the application to them of a modified form of run-length coding. (14 references) (Author)
Descriptors: Citations (References), Databases, Information Retrieval, Information Storage
Laus, Krystyna; Dabrowski, Miroslaw – Information Storage and Retrieval, 1974
Presents a model information retrieval system for the case when a hierarchic set of descriptors is defined. (Author/PF)
Descriptors: Information Retrieval, Information Storage, Models, Subject Index Terms
Coaker, Frank W. – Information Storage and Retrieval, 1974
Traditional and table-driven methods of editing input data for a data-storage system are compared. An application of table-driven input editing is described for a high-volume, multiple-format, clinical data-base. (Author)
Descriptors: Computer Programs, Databases, Editing, Information Storage
Farradane, J.; And Others – Information Storage and Retrieval, 1973
The use of a structured system of storing information, particularly relational indexing, can lead to situations in which items would not be retrieved due to technicalities of the system. To overcome such problems a study was made of condensations with the aim of providing a series of rules to apply. (4 references) (Author/SJ)
Descriptors: Indexing, Information Retrieval, Information Storage, Relevance (Information Retrieval)
Stanfel, Larry E. – Information Storage and Retrieval, 1973
A review is given of doubly-chained trees for information retrieval. It is shown that the chaining steps may be of different cost depending upon whether the step is vertical or horizontal. The problem of constructing an optimal retrieval tree is formulated mathematically and a solution procedure given. (5 references) (Author/KE)
Descriptors: Decision Making, Information Retrieval, Information Storage, Mathematical Models
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
Borillo, A.; And Others – Information Storage and Retrieval, 1973
An English summary is provided for the article which gives the opportunity to solve original problems in linguistics, mathematics and computing science as well as to design descriptive and typological methods in archaeology. (6 references) (Author/SJ)
Descriptors: Algorithms, Archaeology, Computer Science, Information Processing
Corning, Mary E. – Information Storage and Retrieval, 1972
The National Library of Medicine has eight international MEDLARS quid-pro-quo arrangements with the United Kingdom, Sweden, France, West Germany, Japan, Australia, Canada and the World Health Organization. Policy aspects of these arrangements are discussed as well as the organizational and operational characteristics of the non-U.S. Medlars…
Descriptors: Information Retrieval, Information Services, Information Storage, Information Systems
Negus, A. E.; Hall, J. L. – Information Storage and Retrieval, 1971
Descriptors: Computers, Cost Effectiveness, Costs, Information Retrieval
Williams, Martha E. – Information Storage and Retrieval, 1972
Descriptors: Computers, Information Centers, Information Retrieval, Information Storage
Thiel, L. H.; Heaps, H. S. – Information Storage and Retrieval, 1972
Retrospective search of large data bases requires development of special techniques for automatic compression of data and minimization of the number of input-output operations to the computer files. The computer program should require a relatively small amount of internal memory. This paper describes the structure of such a program. (9 references)…
Descriptors: Computer Programs, Computers, Information Retrieval, Information Storage
Previous Page | Next Page ยป
Pages: 1 | 2
