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…

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…

This special issues comprises nine papers presenting a wide selection of approaches to handling subjectivity, vagueness, and imprecision in information retrieval (IR) and database management necessary for success in designing, developing and implementing effective tools for information access. (LRW)