Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)

Describes resources for researchers called the Invisible Web that are hidden from the usual search engines and other tools and contrasts them with those resources available on the surface Web. Identifies specialized search tools, databases, and strategies that can be used to locate credible in-depth information. (Author/LRW)

Describes Web versions of online systems and considers advantages and trade-offs for information professionals and other searchers. Web versions highlighted include Dow Jones Interactive; Dialog; LEXIS-NEXIS; and STN. (LRW)

Discusses relevance in search engines for the World Wide Web. Highlights include types of searches submitted; database scope; how organizations position their Web sites; link analysis; spelling errors; offering alternatives to queries; and the single-answer approach. (LRW)

Examines some of the primary outlets for IAC (Information Access Company) databases on the Web and evaluates when and why each source might be more appropriate to different situations. Features for DIALOG Web, DataStar Web, DIALOG Select, Dow Jones, and InSite Pro are compared. (Author/LRW)

Discusses searching on the World Wide Web. Highlights include search-engine size; features of the six largest search engines; features of five metasearch engines; intelligent agents; two Web sites for difficult-to-find information, including industry statistics and market data; Internet publishers and databases; specialty search engines; and…

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)

Compares three Web-based online reference services that are described as a cross between a traditional database service and a Web search engine: Ask Jeeves (http://www.ask.com), The Electric Library (http://www.elibrary.com), and Information Please (http://www.infoplease.com). Concludes that each has strengths and weaknesses and aren't directly…

These six articles discuss knowledge discovery in databases (KDD). Topics include data mining; knowledge management systems; applications of knowledge discovery; text and Web mining; text mining and information retrieval; user search patterns through Web log analysis; concept analysis; data collection; and data structure inconsistency. (LRW)

Discusses the portions of the World Wide Web that cannot be accessed via directories or search engines, explains why they can't be accessed, and offers suggestions for reference librarians to find these sites. Lists helpful resources and gives examples of invisible Web sites which are often databases. (LRW)

Discussion of commercial document retrieval focuses on a two-part searching procedure based on identifiable partitions. Topics include system growth and the effects of information technology; content searching on large databases, including partitioning; the granularity of context; resolving queries; document retrieval and the World Wide Web; and…

Keyword and text string searches of online library catalogs often provide different results according to library and database used and depending upon how books and journals are indexed. For this reason, online databases such as ERIC often provide tutorials and recommendations for searching their site, such as how to use Boolean search strategies.…

Discusses World Wide Web searching techniques for information professionals, and describes and evaluates four search systems that provide advanced search features and that search a comprehensive and authoritative database of Internet sites. Sample searches are explained and professional searching on the Web is discussed. (LRW)

Discusses indexing in large text databases, approximate text searching, and space-time tradeoffs for indexed text searching. Studies the space overhead and retrieval times as functions of the text block size, concludes that an index can be sublinear in space overhead and query time, and applies the analysis to the Web. (Author/LRW)

Indexing is the preprocessing of information to enable its retrieval, ranging from classification-based (precoordinate) to keyword searching (postcoordinate) approaches. This article describes a framework for modelling information retrieval systems in terms of sets of objects, relationships, and functions and discusses the application of indexing…