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)

Proposes a microprocessor-based architecture that makes large use of parallelism both in processing and in retrieval operations. The proposed system consists of three functional blocks: the query processor, simple query executers, and the answer composer. Twenty-one references are listed. (FM)

Describes the theoretical framework of a retrieval system that uses data structures called bitmaps to improve search algorithms for medium-sized systems. Information retrieval systems that contain the full text of the documents are discussed, and the use of inverted files such as concordances for small texts is explained. (24 references) (LRW)

Presents an inexpensive search system which would be very easy to adapt to a library's data processing requirements and would give a smaller library the opportunity to go on-line. (Author/PF)

Explains an experiment in text-searching retrieval for cancer questions which developed and used computer procedures (via human simulation) to select search words from medical dictionaries. This study is based on an earlier one in which search words were humanly selected, and the recall results of the two studies are compared. (Author/LRW)

Discusses the multilevel information system (MLIS), a retrieval system that integrates functions typical for database management systems and retrieval-oriented systems and provides several levels of data accessing, each developed for a different class of users. Twenty-two sources are cited. (FM)

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)

Describes an interface mechanism called "complex view support" to be used with a relational database system (RDBS) in supporting increasingly complex distributed environments in automated library systems. The interface system refers queries to multidimensional tables as well as to flat tables on RDBS and is shown to efficiently support…

Describes the principles and methodology of Warsaw Clearinghouse activity and its specialized bibliographic service for collecting, processing, and disseminating information on thesauri and related topics. An information retrieval system TEKLA, designed to improve clearinghouse service, is discussed. (Author/BK)

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…

Review of office filing facility filing and retrieval mechanisms for unstructured and mixed media information focuses on free text methods. Also discussed are the state of the art in handling voice and image data, problems with searching text surrogates to implement free text content retrieval, and work of Project Minstrel. (Author/MBR)

Discusses the shift of information access from a data-centered to a user-centered model and describes the Daltext system, a prototype user-centered information system that allows the user to determine how the data will be viewed (i.e., within a datastream model, a set model, a relational model, and/or a hierarchical model). (Contains 30…

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…