Discusses the role of search engines in Web usability and analyzes and evaluates the retrieval effectiveness of various indexing and searching strategies on a new Web text collection. Highlights include preprocessing techniques that might improve retrieval effectiveness; and hyperlinks as useful sources of evidence in improving retrieval…

Discussion of knowledge management for electronic data focuses on creating a high quality similarity ranking algorithm. Topics include similarity ranking and unstructured data management; searching, categorization, and summarization of documents; query evaluation; considering sentences in addition to keywords; and vector models. (LRW)

Explains, with supporting figures and flowcharts of programing logic, two search strategies introduced to the MORPHS System since 1976: one that employs the normal Boolean operators in strings without bracketing or in the form of marked steps, and one that treats a string of keywords as a compound word. (Author/JD)

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

Reviews Web-search tools available to librarians. Discusses the Clever project, (part of the Computer Science Principles and Methodologies Department at the IBM Almaden Research Center, Silicon Valley, California), an algorithm that finds authoritative sources on the Web; Google technology, based on links between Web pages; Ask Jeeves, a…

Describes SWEAR (Systematic Weighting and Ranking), a powers-of-two algorithm that can be used for searching the World Wide Web or any large database that automatically creates discrete, well-defined result sets and displays them in decreasing order of likely relevance. Also discusses fuzzy sets. (Author/LRW)

Discusses subject gateway sites and commercial search engines for the Web and presents an explanation of Google's PageRank algorithm. The principle question addressed is the conditions under which a gateway site will increase the likelihood that a target page is found in search engines. (LRW)

Discusses how to improve the quality of Internet search systems and introduces the Ghosts Consensus Method which is free from the drawbacks of digital democracy algorithms and is based on linear programming tasks. Highlights include vector space models; determining relevant documents; and enriching query terms. (LRW)

Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)

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

Discusses search engines and provides methods for determining what resources are searched, the quality of the information, and the algorithms used that will improve the use of search engines on the World Wide Web, online public access catalogs, and electronic encyclopedias. Lists strategies for conducting searches and for learning about the latest…

Evaluates the effectiveness of spelling-correction and string-similarity matching methods in retrieving similar words in a Malay dictionary associated with a set of query words. Describes experiments that showed the best search combination used a stemming algorithm, and calculates retrieval effectiveness and relevant means measures from weighted…

Discusses indexes for text databases and presents an efficient implementation of an index for text searching called PAT array, or suffix array, where the database is stored on secondary storage devices such as magnetic or optical disks. Additional hierarchical index structures and searching algorithms are proposed that improve searching time, and…

Describes EquiX, a search language for XML that combines querying with searching to query the data and the meta-data content of Web pages. Topics include search engines; a data model for XML documents; search query syntax; search query semantics; an algorithm for evaluating a query on a document; and indexing EquiX queries. (LRW)

Analytical methods for facilitating comparison of multiple sets during online searching are illustrated by description of specific searching methods that eliminate duplicate citations and a factoring procedure based on syntactic relationships that establishes ranked sets. Searches executed in National Center for Mental Health database on…