Information Retrieval Abstracts Selected by Gerry Salton A Very Fast Substring Search Algorithm Daniel M. Sunday Communications of the ACM 33(8),1990,132-142 This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend on scanning the pattern string in any particular order. Three variations of the algorithm are given that use three different pattern scan orders. These include: (1)a "Quick Search"algofithm; (2) a "Maximal Shift" algorithm; and (3)an "Optimal Mismatch "algorithm. Agenda: A Personal Information Manager S. Jerrold Kaplan, Mitchell D. Kapor, Edward J. Belove, Richard A Landsman, and Todd R. Drake CACM 33(7), 1990 The free-form, evolving, personal information that people deal with in the course of their daily activities requires more flexible data structures and data management systems than tabular data structures provide. A tool for managing personal information must conveniently handle freetextual data; allow for StlUCtUre to evolve gracefully as the database grows; represent unnormalized data; and support data entry through database views. We have designed a new type of database that serves these needs-- called an "itemdatabase-- and realized this design in a commercial personal computer software product named "Agenda." Uncitedness in the Biomedical Literature Richard E.
/lp/association-for-computing-machinery/selected-information-retrieval-abstracts-6u576UrFyu