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)

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)

Analyzes computer terminal memory performance in terms of overflow probability and average queueing delay, and presents new method to derive a closed expression for data arrivals with Erlangly distributed interarrival times and an approach to derive steady state probability expressions of the terminal memory content process. Twenty references are…

Presents a system model for transmission of input data that is coming from terminals of users in a limited user resource-sharing environment. Performance of a mini/microcomputer receiving mixture of picture-phone terminal data is analyzed with constant service times, synchronous transmission, and single-server interruptions through first-order…

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)

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…

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…

Discusses data model role in an office filing facility, office data model requirements, and various modelling paradigms for office data modelling. Data model application to a typical collection of office data is presented, filing and retrieval operations are illustrated, and proposed research into other office data modelling aspects is outlined.…

Considers the implications of possible policy initiatives in the United States in light of Swedish experience in dealing with the privacy of computerized records. (CWM)

Suggests new method of external distribution called tree partitioning that involves use of binary tree to split incoming file into successively smaller partitions for internal sorting. Number of disc accesses during a tree-partitioning sort were calculated in simulation using files extracted from British National Bibliography catalog files. (19…

Introduces the multicharacter trie as an index structure that can improve the time needed for retrieving full-text materials stored on CD-ROMs. The advantages of this structure compared to other structures are described, and experimental results comparing it to the widely used B+ tree and other structures used for full-text retrieval are…

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)

The Ministry of Agriculture, Fisheries and Food conducted an operational evaluation of the software packages CAIRS and STATUS, which were used to build databases and databanks. Setting up the trial, types of data involved (chemical products used as pesticides), searching and presentation of data, and the final choice are covered. (EJS)

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)

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)