Describes an approximate document ranking process that uses a compact array of in-memory, low-precision approximations for document length. Combined with another rule for reducing the memory required by partial similarity accumulators, the approximation heuristic allows the ranking of large document collections using less than one byte of memory…

Proposes a cost/benefit model coupled with a decision tree for determining normal forms, which are used in information systems development processes to group data into well-refined structures. The three primary variables that impact the benefits and costs of normalization (reduced anomalies, storage requirements, and transaction response times)…

Discusses traditional information retrieval through indexing terms and describes a document storage and retrieval system based on structured information, where the SGML document is transformed into Grove (Graph Representation of Property Values) and stored at an element level by an object-oriented database management system. Also discusses query…

Discusses general problems of thesaurus construction theory and practice. Highlights include lexical control and its tools in various databases; natural language versus conceptual networks; systems approach; thesaurus versus classification, including associative relations; and thesaurus role in information storage and retrieval. (110 references)…

Discussion of data storage technology for multimedia materials highlights a new signature file method that divides files into variable-sized vertical frames to optimize response time using partial query evaluation. Real data experiments that tested the response time are reported, and future work is discussed. (Author/LRW)

Presents a technique for storing compound keywords with information about short and long component (SC and LC) keywords by extending Aho and Corasick (AC) string-pattern matching-machine for a finite number of keywords. Results for 38 Japanese text files reveal the extended AC machine is three to six times faster than the original AC machine in SC…

Analyzes the properties of genetic sequences that cause the failure of classical algorithms used for data compression. A lossless algorithm, which compresses the information contained in DNA and RNA sequences by detecting regularities such as palindromes, is presented. This algorithm combines substitutional and statistical methods and appears to…