CITATION INDEXES, IN COMBINATION WITH REGULAR INDEXES, ARE CREATING NEW METHODS OF INFORMATION RETRIEVAL, WHICH USE SOME MEASURE OF CONNECTION OR ASSOCIATION BETWEEN A GIVEN BASE OF ARTICLES AND OTHER DOCUMENTS IN A COLLECTION. GENERAL REQUIREMENTS OF SUCH A MEASURE ARE--(1) IT SHOULD BE INDIRECTLY PROPORTIONAL TO THE NUMBER OF LINKS IN A CHAIN OF…

The binary vector is suggested as an alternative to the usual method of storing document pointers in an inverted index file. (Author)

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)

Proper name matching schemes are reviewed and an updated version of these schemes is tested on a suburban telephone book. (Author/AB)

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.…

Analyzes the formal properties, structural consequences, similarities, and differences of link indicators, brackets, and cohesion separators in the query languages employed in information retrieval. Eleven figures, a 32-item reference list, and appendices on Extended Backus Notation and the formal definition of the Formal Relevance Language are…

Describes an indexing technique based on overlapping word fragments as reference strings that are linked in a directed graph structure which makes possible exact match-, partial match-, and masked-partial match-retrieval and indicates search strategies for each case. Eight figures, two tables, and nine references are provided. (RBF)

Words and word fragments from the computer-readable data bases "Chemical Abstracts Condensates" and "Biological Abstracts Previews" were analyzed in terms of length, number, and frequency of appearance to determine some parameters upon which inversion of these data bases could be predicated. Types (unique words or fragments)…

Discusses ranking techniques for document retrieval and proposes an evaluation, or filtering, technique that reduces costs and memory usage by early recognition of which documents are likely to be highly ranked. Highlights include index design, ranked query evaluation, reducing the number of accumulators, inverted file structures, and experimental…

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)

Describes an algorithm for computer generation of hierarchical indexes for document collections. The resulting index, when presented with a graphical interface, provides users with a view of a document collection that permits general browsing and informal search activities via an access method that requires no keyboard entry or prior knowledge of…

Presents a World Wide Web page model that reacts to pre-defined events and performs actions like "prefetching" automatically. Discusses the active index, conceptual page model; design of the client system, status of the current implementation, prefetching algorithm, an experiment of the algorithm, experimental results of the active index…

The symposium focused on advances in techniques in the computer oriented technology of information retrieval. Early developments and the status of recent efforts in document retrieval, question answering and data management systems are briefly reviewed. Unless fundamental processing techniques are developed and made available to workers,…