Descriptor
Information Storage | 36 |
Information Retrieval | 28 |
Databases | 13 |
Information Systems | 12 |
Algorithms | 10 |
Online Systems | 10 |
Mathematical Models | 9 |
Search Strategies | 9 |
Comparative Analysis | 8 |
Data Processing | 8 |
Models | 6 |
More ▼ |
Source
Information Processing and… | 36 |
Author
Cooper, Lorraine K. D. | 2 |
Reddi, Arumalla V. | 2 |
Schuegraf, E. J. | 2 |
Tharp, Alan L. | 2 |
And Others. | 1 |
Bennett, K. H. | 1 |
Bernier, Charles L. | 1 |
Bird, P. R. | 1 |
Bratley, Paul | 1 |
Chen, Zhengxin | 1 |
Choueka, Yaacov | 1 |
More ▼ |
Publication Type
Journal Articles | 30 |
Reports - Research | 17 |
Reports - Descriptive | 10 |
Information Analyses | 4 |
Opinion Papers | 3 |
Education Level
Audience
Researchers | 8 |
Location
Sweden | 1 |
United Kingdom | 1 |
United States | 1 |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating

Heaps, H. S.; Schuegraf, E. J. – Information Processing and Management, 1976
The structure of a retrospective information retrieval system that uses equifrequent word or text fragments is described, and its advantages over word oriented systems are mentioned briefly. (Author)
Descriptors: Databases, Information Retrieval, Information Storage

Krishnan, S.; Krishnamurthy, E. V. – Information Processing and Management, 1976
Described here is an efficient encoding procedure for Algorithmic Wiswesser Notation (ALWIN), using the Morgan labelling algorithm and the neighborhood relationship in a chemical graph. This procedure introduces a hierarchy to bring an order for the unique description of the chemical structure with a minimal computational effect. (Author)
Descriptors: Algorithms, Chemical Nomenclature, Chemistry, Information Storage

Lee, E. T. – Information Processing and Management, 1976
Four advantages of storing and retrieving geometric figures and chromosome images through the use of shape-oriented similarity measures are presented. (Author)
Descriptors: Classification, Geometric Concepts, Information Retrieval, Information Storage

Raita, Timo; Teuhola, Jukka – Information Processing and Management, 1989
Presents three text compression methods of increasing power and evaluates each based on the trade-off between compression gain and processing time. The advantages of using hash coding for speed and optimal arithmetic coding to successor information for compression gain are discussed. (26 references) (Author/CLB)
Descriptors: Algorithms, Comparative Analysis, Data Processing, Efficiency

Bird, P. R. – Information Processing and Management, 1975
False drops occur in a system of random superimposed coding for edge-notched, punched, and feature cards. Formulae for the false dropping fraction are derived, and figures and tables are given for the calculated values in the most popular scheme. (Author/LS)
Descriptors: Data Processing, Information Retrieval, Information Storage, Information Systems

Guy, Louis-Gavet – Information Processing and Management, 1977
A new method for concentrating keywords of a thesaurus, based on a mathematical study of the distribution of characters in a defined natural language. (Author/KP)
Descriptors: Computer Programs, Databases, Information Retrieval, Information Storage

And Others; Proctor, David, J. – Information Processing and Management, 1978
Uses collection and storage of data in an environmental chemicals data bank to develop an exchange format of hierarchical tree structure between network partners. Rules identify and process the nodes in the tree in such a way that information is neither lost nor degraded upon transfer between network partners. (CWM)
Descriptors: Databases, Information Networks, Information Storage, International Organizations

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

Bennett, K. H.; And Others – Information Processing and Management, 1986
Demonstrates that hierarchical naming schemes--one with a single namespace and fixed root spread over all machines in a distributed system, and a second with total namespace composed of some aggregation of individual namespaces of each component system's filestores--can coexist in distributed computer systems. Combined system's design is…
Descriptors: Computer Software, Definitions, Design, Information Retrieval

Neville, H. H. – Information Processing and Management, 1981
Describes an online library catalog in which bibliographic references have been compiled by simply transcribing the descriptive data found on the title page and elsewhere on the documents, and discusses the wider implications of the use of natural language descriptions without modifications. Eleven references are listed. (FM)
Descriptors: Bibliographies, Databases, Information Processing, Information Retrieval

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

Saran, M.; And Others – Information Processing and Management, 1981
Describes a dialog-program which uses basic statements available on a WANG 2200T version connected to a floppy-diskette to cross-reference a given set of keywords, author names, journal names, and specified reference numbers. Special program features are described and two references are listed. (Author/RBF)
Descriptors: Computer Programs, Computer Storage Devices, Computers, Information Retrieval

Cooper, Lorraine K. D.; Tharp, Alan L. – Information Processing and Management, 1989
Explores the new storage technology of optical data disks and introduces a data structure, the inverted signature tree, for storing data on optical data disks for efficient text searching. The inverted signature tree approach is compared to the use of text signatures and the B+ tree. (22 references) (Author/CLB)
Descriptors: Comparative Analysis, Computer Storage Devices, Data Processing, Information Storage

Jarvelin, Kalervo; Vakkari, Pertti – Information Processing and Management, 1993
This content analysis of library and information science (LIS) research from 1965 to 1985 was conducted to determine the distribution of topics in research articles and the research methodologies that have been used. Results indicated that information storage and retrieval was the most popular topic and that empirical strategies predominated. (20…
Descriptors: Content Analysis, Information Retrieval, Information Science, Information Storage

Chen, Zhengxin – Information Processing and Management, 1993
Describes a conceptual model for integrating short scientific texts, which extends classical text storage and retrieval. A brief comparison with related approaches such as case-based reasoning and classification-based reasoning is also provided. (13 references) (Author/KRN)
Descriptors: Artificial Intelligence, Comparative Analysis, Database Management Systems, Information Retrieval