Abstract: A method and apparatus for single instance indexing of backup images is provided. In one example, a content identifier is established for a file in the backup images. An index database associated with the backup images is queried with the content identifier. Content and metadata of the file is indexed if the content identifier is not in the index database. Only the metadata for the file is indexed if the content identifier is not in the index database. In one example, the content identifier comprises a file identifier defined by the metadata for the file. In another example, the content identifier comprises a checksum computed for the file.

Abstract: Locks placed on corresponding objects held in a plurality of databases located at different nodes in a network during replication are released in accordance with fairness criteria. Propagation delays are determined between a transaction initiating node and one or more other nodes in the network. An object is locked during a transaction being executed at the transaction initiating node. Corresponding objects are locked at one or more other nodes in the network that are manipulated as a result of the replication Upon determining that the object locks should be released, the propagation delays are used to determine when to release the object locks so that all of the object locks at the one or more other nodes are released in accordance with the fairness criteria.

Abstract: According to the invention, one embodiment of a method and program of synchronizing an end device with a data repository is disclosed. In another embodiment, a method for synchronizing data, both multimedia and non-multimedia, with a repository is provided. In an exemplary embodiment, a method for synchronizing data with multiple repositories is provided. In another embodiment a software program to implement said methods is provided.

Abstract: An object may be categorized upon distribution of the object from a sender system to a recipient system. The object may be assigned to at least one recipient category in a recipient category hierarchy according to a first predefined mapping from a sender category hierarchy to the recipient category hierarchy. The object is initially assigned to a sender category in the sender category hierarchy. There is applied to the object a second predefined mapping from the recipient category hierarchy to the sender category hierarchy. It is determined whether the first and second predefined mappings converge. If the first and second predefined mappings do not converge, there may be executed a rule-based reassignment algorithm to make the first and second predefined mappings converge.

Abstract: A method for network resource classification and identifying user interests based on the classification. The method uses a provided hierarchy of categories for classifying network resources, wherein each category is assigned a text item describing the category and the method includes obtaining resource description data collections corresponding to the network resources, and generating, using a semantic correlation algorithm, a category score vector of a network resource by comparing the resource description data collection to the text item assigned to each category in the hierarchy of categories, wherein the category score vector comprises a category score for each category in the hierarchy of categories, wherein the category score is determined based on at least a semantic correlation measure between the resource description data collection and the text item assigned to a corresponding category, wherein the plurality of network resources are classified based at least on the category score.

Abstract: Mobile friendly internet searches are enabled by determining if individual internet sites are mobile friendly. In a described implementation, a mobile-friendliness indication is determined for an internet site. The determined mobile-friendliness indication is stored in association with the internet site in an index that may be used for internet searching. In another described implementation, a data structure comprises an internet index with multiple internet site entries having one or more associated mobile-friendliness indications. The mobile-friendliness indications may be general affirmative indications of mobile friendliness or specific indications of mobile-friendliness that identify a specific user agent type. In yet another described implementation, a search request having search terms is received, and a search is performed based thereon to produce a search results set.

Abstract: To allow a user to maximize use of a video and digital multimedia aggregator, a search suggestion engine and corresponding method may be used to provide suggestions of available content. The search suggestion engine starts by constructing a database of metadata elements or word items. The metadata element database may be constructed by using a crawler that periodically or continually crawls a content metadata database and extracts word items from the content metadata database. The word items are then processed according to a number of factors, including part-of-speech, entries in dictionaries and thesaurus and other factors. The thus-processed word items are indexed, and may be provided with a vector value. A subsequent search request submitted by the user may include search criteria that may be provided vector values. A processor within the search suggestion engine compares the vector values to determine if an indexed word item should be considered for retrieving the indexed word item's associated content.

Abstract: A system and method for identifying semantically relevant documents is provided. An index having semantic index key terms from one or more documents is maintained. A query is obtained and semantic key terms of the query are identified. Each of the query key terms are associated with information, including use of the word and a grammatical role of the word. Each of the query key terms and variants of the query key terms is looked up in the index based on the information. One or more of the documents in the index are identified as possible relevant candidates based on the look up. A potential match candidate set is generated by filtering the possible relevant candidates. At least one of the documents that match the query is identified by comparing a semantic representation for each non-filtered potential match candidate in the set with a semantic representation for the query.

Abstract: Techniques for content marking are provided. An Application includes a plug-in which permits an offset location within a document to be marked as a content marker. The content marker is stored independent of the application and is subsequently processed by a content marking service. The content marking service permits the content marker to be selected causing the application to be initiated, the document to be loaded within the application, and the offset location to be presented within the document.

Abstract: Each file is assigned in advance with a WWUID, newly assigned to a file upon the creation or update of the file and inherited from a file to a copied file when it is copied. In a backup apparatus, a file name reception unit receives the file name of a backup target file. A WWUID reception unit receives a WWUID corresponding to the file name. A WWUID search unit searches for the same WWUID in backup management information of a previous day stored in a backup destination. Only if the search is failed, a file operation instruction unit instructs the storing of the backup target file into the backup destination. Then, an Rcnt update instruction unit instructs the updating of the number of references made to the WWUID within the backup destination. A second management information update instruction unit then instructs updating of backup management information of the current day.

Abstract: Embodiments of the present invention provide a novel and non-obvious method, server and computer program product for finding relevant content in a knowledge base. A method for finding items that are related to a user selected item in a knowledge base is provided. The method can include generating a first list of knowledge base items with a defined relationship to the user selected item and generating a second list of knowledge base items that belong to the same category as a category of the user selected item. The method can further include generating a third list of knowledge base items having one or more tags identical to one or more tags of the user selected item and selecting a first set of knowledge base items that are present in the first, second or third lists. The method can further include displaying the first set of knowledge base items as most relevant.

Abstract: The system receives a query and then identifies classifications of the data that may satisfy the received query. The system then displays the identified classifications. In response to selection of a displayed classification, the system displays sub-classifications when the selected classification has sub-classifications and displays the data within the classification when the selected classification has no sub-classifications. In another aspect, the system generates search results for items that are hierarchically classified. For classifications within the hierarchy of classifications, the system generates a search entry containing terms describing the items within that classification. The system then receives a search criteria. The system selects as initial search results those search entries whose terms most closely match the received search criteria. The system can then adjust the initial search results based on the hierarchy of classifications.

Abstract: In one aspect of the invention, a search engine parses files stored among one or more file servers in order to create and maintain index information used by the search engine to perform searches. For a given file server, the population of files presented to the search engine is reduced in size to facilitate the process of updating the index. In another aspect of the invention, the file server limits the files presented in a directory list request made by a search engine. This reduces the number of file s that need to be considered when performing an index update.

Abstract: In an embodiment, a first plurality of rows of a first table are read from memory in an order of page addresses of pages in the memory that comprise the first plurality of rows. First selected rows from the first plurality of rows that meet a query predicate are stored into a result set. After the reading the first plurality of rows in the order of the page addresses, a second plurality of rows of the first table are read from secondary storage, in an order of row identifiers of the second plurality of the rows in the first table. Second selected rows from the second plurality of rows that meet the query predicate are stored into the result set.

Abstract: A method for facilitating join operations between a first database table and a second database table within a database system. The first database table and the second database table share at least one common index column. The method includes creating a new index column in the second database table that is populated with a limited number of distinct calculated values for the purpose of increasing the overall number of distinct values collectively assumed by the columns common between the two tables. An intermediate table is created, the intermediate table including the common columns of the first database table, the second database table, and the new index column. An index is defined of the intermediate table to be the column(s) common between the first and second tables. An index is defined of the second table to be the column(s) common between the first database table, the second database table and the new index column.

Abstract: Generally speaking embodiments that dynamically expand the amount of information displayed with search or query results are disclosed. Some embodiments comprise a method for viewing information of a search that includes presenting a number of search results in response to a search, enabling a user to select one or more of the search results for a period of time, and dynamically expanding an amount of information associated with the selected search result based upon the period of time. Further embodiments comprise apparatuses having a display and a selection sensor to sense when a user selects one of the results and measure a period of time that the user selects the result. These embodiments also include a result expander to expand the amount of information displayed for a selected result as the period of time increases.

Abstract: An information retrieval system, including a natural language parser (3) for parsing documents of a document space (1) to identify key terms of each document based on linguistic structure, and for parsing a search query to determine the search term, a feature extractor (4) for determining an importance score for terms of the document space (1) based on distribution of the terms in the document space (1), an index term generator (5) for generating index terms using the key terms identified by the parser (3) and the extractor (4) and having an importance score above a threshold level, and a query clarifier (16) for selecting from the index terms, on the basis of the search term, index terms for selecting at least one document from the document space (1). A speech recognition engine (12) is used to generate the query, and a bi-gram language module (6) generates grammar rules for the speech recognition engine (12) using the index terms.

Abstract: A method and system for synchronizing data between a network server and a mobile device is provided. In an embodiment, a plurality of object instances may be received from the network server, and at least one object instance may be selected. For each selected object instance, the plurality of object instances may be recursively searched to identify related object instances, the related object instances may be sorted, and the sorted object instances may be sent to the mobile device, followed by the selected object instance. In this manner, data synchronization between the network server and the mobile device may advantageously include only those object instances that are needed by the mobile device, thereby preventing redundant, or omitted, data transfers.

Abstract: A processor-implemented method, system, and/or computer program product lemmatizes a phrase for a specific category. An initial phrase, which is associated with a specific category, is received by a processor. The processor removes a last letter or set of letters from a word in the initial phrase to form an initial truncated version of the phrase, and then runs a term frequency-inverse document frequency (TF-IDF) algorithm on the initial truncated version of the phrase. The processor lemmatizes subsequent truncated versions of the initial phrase, and then runs the TF-IDF algorithm until a highest TF-IDF value is identified for a specific truncated version of the initial phrase when compared to TF-IDF values of other truncated versions of the initial phrase. The specific truncated version of the initial phrase that is associated with the highest TF-IDF value is then associated with the specific category.

Abstract: A distributed database system providing data and space management methodology. In one embodiment a system for allocating resources amongst a plurality of database servers sharing resources comprises: an input module for receiving user input for allocating resources shared amongst a plurality of database servers and establishing thresholds for utilization of resources at each database server; a monitoring module at each database server for monitoring local resource utilization at each database server and sending a request for balancing resources to a second database server when local resource utilization reaches an established threshold at a first database server; and a load balancing module for receiving the request for balancing resources and determining whether to adjust resources allocated to the first database server and the second database server in response to the request.