International Business Machines Corporation

Metro One Telecommunications, Inc.

Runping Qi

Marcus Felipe Fontoura

Ronny Lempel

Eugene Jon Shekita

Andreas Neumann

Jason Yeong Zien

John A McPherson, Jr

Andrei Zary Broder

Ning Li

Reiner Kraft

Michael A Kepler

Sridhar Rajagopalan

Christopher Alan Huey

Nadav Eiron

Shila Ofek-Koifman

Christopher A Wake

Felipe Marcus Fontoura

Michael Herscovici

Tony Leung

Tony Kai-chi Leung

Srinivasan Balasubramanian

Laurent Chavet

Provided are a method, system, and article of manufacture for searching documents for ranges of numeric values. Document identifiers for documents are accessed, wherein the documents include at least one value that is a member of a set of values. A number of posting lists are generated. Each posting list is associated with a range of consecutive values within the set of values and includes document identifiers for documents including at least one value within the range of consecutive values associated with the posting list, and wherein each document identifier is associated with one value in the set of values included in the document identified by the document identifier. The generated posting lists are stored, wherein the posting lists are used to process a query on a range of values within the set of values.

Searching documents for ranges of numeric values

Provided are a system and article of manufacture for searching documents for ranges of numeric values. A number of posting lists is generated, wherein each posting list is associated with a range of consecutive values within the set of values and includes document identifiers for documents including at least one value within the range of consecutive values associated with the posting list, and wherein each document identifier is associated with one value in the set of values included in the document identified by the document identifier. The generated posting lists are stored. A query on a query range of values within the set of values is received and a determination is made of a minimum number of posting lists associated with consecutive values that together include the query range of values. The determined posting lists are merged.

Disclosed is a method, system, and program for handling redirects in documents. At least one equivalence class that includes documents that are connected through a redirect. Cycles for each equivalence class are detected, wherein documents in a cycle are marked so that they are not indexed. Incomplete chains for each equivalence class are detected, wherein documents in an incomplete chain are marked so that they are not indexed. A representative for each equivalence class is selected.

Method, system, and program for handling redirects in a search engine

A method for indexing a plurality of documents, that includes a plurality of duplicate documents, first identifies one or more duplicate groups of documents from among the plurality of documents. Then, one index of content for the duplicate group is created instead of indexing the content from every document within the duplicate group. However, in contrast to the content index, an index of metadata for each of the documents in the duplicate group is created. Thus the content of each duplicate group is indexed only once, while a search engine using such indexing techniques retains the capability to answer queries as if the duplicated content was indexed for each document of the group.

Generic architecture for indexing document groups in an inverted text index

A method and system for querying multifaceted information. An inverted index is constructed to include unique indexed tokens associated with posting lists of one or more documents. An indexed token is either a facet token included in a document as an annotation or a path prefix of the facet token. The annotation indicates a path within a tree structure representing a facet that includes the document. The tree structure includes nodes representing categories of documents. A query is received that includes constraints on documents. The constraints are associated with indexed tokens and corresponding posting lists. An execution of the query includes identifying the corresponding posting lists by utilizing the constraints and the inverted index and intersecting the posting lists to obtain a query result.

Efficient multifaceted search in information retrieval systems

Provided is a technique for building an index. A new indexis built and an anchor text tableand a duplicates tableare output using a store, a delta store, and previously generated global analysis computations, wherein the previously generated global analysis computationsinclude an anchor text table, a rank table, and a duplicates table. New global analysis computationsare generated using the anchor text tablei+1, the duplicates table, and the previously generated global analysis computations.

Pipelined architecture for global analysis and index building

A collaborative focused crawler crawls documents on a network locating documents that match multiple focus topics. The collaborative crawler comprises a fetcher and a focus engine. The fetcher prioritizes which documents to crawl based on a set of rules, obtains documents from the network, and outputs crawled documents to the focus engine. The focus engine determines whether a fetched document is relevant to any of the multiple focus topics. The focus engine determines whether fetched documents are disallowed. If a fetched document is disallowed, the present system may place the URL for that web document in a blacklist, a list of URLs that may not be crawled. URLs may be disallowed if they match a disallowed topic or if they fail a set of rules designed for a web space focus, for example, domain rules, IP address rules, and prefix rules.

System, method, and service for collaborative focused crawling of documents on a network

A method for querying multifaceted information. An inverted index is constructed to include unique indexed tokens associated with posting lists of one or more documents. An indexed token is either a facet token included in a document as an annotation or a path prefix of the facet token. The annotation indicates a path within a tree structure representing a facet that includes the document. The tree structure includes nodes representing categories of documents. Constructing the inverted index includes generating a full path token and an associated full path token posting list. A query is received that includes constraints on documents. The constraints are associated with indexed tokens and corresponding posting lists. An execution of the query includes identifying the corresponding posting lists by utilizing the constraints and the inverted index and intersecting the posting lists to obtain a query result.

Provided are a method, system, and program for searching documents for ranges of numeric values. Document identifiers for documents are accessed, wherein the documents include at least one value that is a member of a set of values. A number of posting lists are generated. Each posting list is associated with a range of consecutive values within the set of values and includes document identifiers for documents having values within the range of consecutive values associated with the posting list. Each document identifier is associated with one value in the set of values included in the document identified by the document identifier. The generated posting lists are stored.

Method for searching documents for ranges of numeric values

Disclosed is a technique for building an index in which global analysis computations and index creation are pipelined, wherein the global analysis computations share intermediate results.

A system and method for searching, accessing updating database records on a plurality of geographically dispersed databases is provided. Update databases consisting of a plurality of update records having at least one field capable of being set to at least one particular value are used to update records in target databases. When a database search is conducted on one or more target databases, a search is also conducted on update databases associated with the target databases. The results of the searches are processed. If the at least one field in an update record is set to a predefined value, then all returned records equivalent to the update record are discarded. Otherwise, the update record is added to the search result.

Method and system for searching, accessing and updating databases

A search-routing database is used to direct database search requests to only those databases that may contain results to the search request. The search-routing database contains a subset of the data fields from the other databases in the network, along with a field indicating the database to which the search request should be routed. When a database search request is received, a modified search request is generated based on the overlap between the type of information contained in the search request and the type of information contained in the data-fields of the search routing database. This modified search request is submitted to the search-routing database, which returns a list of database candidates which could produce results to the original search request. The original search request is then submitted to those database candidates, and the results are returned to the user.

Growing community of inventors

Cupertino, CA, United States of America

Runping Qi