Abstract: A method and apparatus for ranking results from a search engine query is described. In one embodiment, the search engine provides results from a search query. The results contain a list of web pages where each web page has one or more inbound links. The search engine computes the growth of the number of inbound links of each web page over a predefined period of time. The search engine ranks each web page based on a function of its respective computed growth of the number of inbound links.

Abstract: Methods and systems for adjusting a scoring measure of a search result based at least in part on the breadth of a previously-executed search query associated with the search result are described. In one described system, a search engine determines a popularity measure for a search result, and then adjusts the popularity measure based at least in part on a query breadth measure of a previously-executed search query associated with the search result. The search engine may use a variety of query breadth measures. For example, the search engine may use the quantity of results returned by the search query, the length of the query, the IR score drop-off, or some other measure of breadth.

Abstract: Methods for updating an information retrieval system are disclosed. In one embodiment, search terms affiliated with mappings or associations that represent a connection of relevancy between a query and an asset are pushed as content updates to a client system (e.g., as new updates or utilized to replace older data). The search terms are inserted (e.g., inserted as metadata) into corresponding content (the content associated with the asset). In this manner, content-searching data can be updated (e.g., remotely updated) as frequently as desired, even periodically, or selectively as new manually and/or automatically derived data becomes available. In another embodiment, the update data is already built into the content when it is delivered to a client machine. Other disclosed embodiments pertain to methods for generating a data mining classification model that is a blended representation of associations (e.g., query-asset associations) having different characteristics and/or different originating sources.

Abstract: A system providing methodology for replication subscription resolution. In one embodiment, for example, a system of the present invention for determining subscribers to which a published item of data should be replicated comprises: an interface module for receiving user input of lists of a plurality of subscribers, each list specifying items of data to be replicated to a given subscriber, a build module for building an index based on the lists of the plurality of subscribers containing entries indicating subscribers For each item of data specified in the lists and a default list of subscribers for items of data not matching any of the entries; and a resolution module for receiving a published item of data and determining subscribers to which the published item should be replicated based on the index.

Abstract: Given a destination(s) and search criteria, the destination(s) is searched to identify files that satisfy the search criteria. For each such file, a file identifier (such a uniform resource locator (URL)) is added to a reference page. This document also describes, in one example, receiving indications of a destination to be searched and a set of search criteria and, responsive to receiving these indications, searching a destination to identify one or more web pages at the destination that satisfy the search criteria and generating a reference page that includes an identifier of each of the one or more web pages.

Abstract: The method for processing data in a relational database wherein ontology data that specifies terms and relationships between pairs of said terms expressed in an OWL document is stored in the database, database queries that include a semantic matching operator are formed which identify the ontology data and further specify a stated relationship between two input terms, and the query is executed to invoke the semantic matching operator to determine if the two input terms are related by the stated relationship by consulting said ontology data.

Abstract: When a retrieval condition including a first desired word and a first desired component including a value in which the first desired word is included, is inputted, a first detecting device detects second desired components each being similar to the first desired component, an acquiring device acquirers second desired words each being similar to the first desired word, a first retrieving device retrieves first structured documents each including a first component including a value in which one of the first desired word and the second desired words is included, a second retrieving device retrieves second structured documents each including a second component corresponding to one of the first desired component and the second desired components and including or corresponding to the first component.

Abstract: Provided are methods, apparatus and computer programs for evaluating the resilience, to structural changes in a data source, of a representative label representing a data element within the data source. Also disclosed are applications using a resilient representative label. For example, a representative label may represent a particular data field or other data element within a semi-structured data source—such as within XML or HTML Web pages. An estimate of resilience to changes can be used to determine whether a candidate representative label satisfies a required degree of resilience, or to enable selection of a label with the highest resilience score among a set of representative labels. The validated or selected representative label may then be used for data extraction, remaining usable despite the possibility of future changes to the structure of a Web page, or for template clustering/classification.