Abstract: Systems, methods, and computer-readable media for representing and processing inter-slot co-occurrence constraints on component selection for dynamically generated content items are disclosed. Components available for constructing the content items are organized into a hierarchy of categories. Co-occurrence constraints are specified in terms of categories in the hierarchy rather than explicit enumerated black-lists or white-lists at the component-to-component level. A set of processing rules based on the hierarchical taxonomy are used to expand a set of co-occurrence constraints specified in terms of categories into explicit enumerations of allowed component combinations, and to resolve potential conflicts in the set of co-occurrence constraints in a predictable manner. The explicit enumerations of allowed component combinations can be stored in a relational data table. When constructing a content item, candidate components can be obtained by querying the relational data table.

Abstract: Systems and methods for managing mapping information for objects maintained in a distributed storage system are provided. The distributed storage system can include a keymap subsystem that manages the mapping information according to object keys. Requests for specific object mapping information are directed to specific keymap coordinators within the keymap subsystem. Each keymap coordinator can maintain a cache for caching mapping information maintained at various information sources. To manage the cache, the keymap system can utilize generation identifiers that identify the component within the distributed storage system that last updated information sources. Additionally, the keymap subsystem can utilize multiple generation identifiers to manage different classes of data. Each keymap coordinator can determine whether cached version of a class of keymap information is valid based on an analysis of generation identifiers.

Abstract: One aspect of the present invention can include a method, a computer program product, an apparatus, and a system for handling Universal Description, Discovery and Integration (UDDI) updates to entities. The aspect can receive at least one update to be applied to a UDDI entity within a UDDI registry. Each received update can be applied to the related UDDI entity. At least one subscriber of the updated entity can be determined. A status indicator for each detected subscriber can be changed to indicate that a subscription to the entity has been deleted, wherein the change to the status indicator negates a need to scan the subscriptions associated with the entity for each received update to the entity.

Abstract: A method for writing a data block to a storage pool. The method including receiving a write operation for a block, determining whether the block comprises metadata, and if the block comprises metadata: determining a first replication type for the block, and writing the block to the storage pool in accordance with the first replication type. If the block does not comprise metadata: determining a second replication type for the block and writing the block to the storage pool in accordance with the second replication type.

Abstract: A database system that issues a reference transaction by designating a time stamp. Data structures are provided for making an inquiry about the latest value at a designated time using a database in which values and information on times associated with the individual values are contained in a table. One of the data structures includes, for each of IDs associated with the values in the database, at least one time stamp that is sorted in chronological order (hereinafter referred to as a first time stamp); values belonging to the individual first time stamps; and a pointer that designates one of the first time stamps, the first time stamps indicating the times when the values become valid. The other of the data structures includes, for each of the IDs, the designated first time stamp and a value belonging to the designated first time stamp.

Abstract: In one embodiment, a method for compression is disclosed, including receiving source data, creating at least one template based upon common data, and creating a compressed record including a reference to the at least one template and a template delta that represents a difference between the at least one template and source data.

Abstract: A searcher can be configured to improve relevance ranking of search results through iterative weighting of search ranking results. A Search Auto Categorizer (SAC) operates on a base query to return a probabilistic distribution of leaf categories of a taxonomy in which relevant products may reside. A Search Logic Unit (SLU) can compute a relevance of any particular leaf category to the base query. The SLU can then determine an initial relevance of a particular product to the query based on the probabilistic distribution and the relevance of leaf category to query. The SLU weights the relevance of a product to the query to establish an updated probabilistic distribution. The SLU then repeats the relevance and weighting until convergence upon a relevance list.

Abstract: Construct a plurality of first binary decision diagrams (BDDs), each representing a different one of a plurality of words. Construct a plurality of second BDDs, each representing a different one of a plurality of search queries, each of the search queries comprising one or more of the words. Construct a plurality of third BDDs, each representing a different one of a plurality of web pages. Construct a plurality of fourth BDDs, each representing a different one of a plurality of search results, each search result comprising one or more web pages. Construct a plurality of fifth BDDs each representing a different one of a plurality of search tuples, each of the search tuples comprising a different one of the search queries and a different one of the search results. Construct a sixth BDD representing the search queries and the search results.

Abstract: A data processing apparatus capable of transmitting or receiving file data to or from a server, the apparatus comprises a memory which stores file data, a receiver which receives file name data transmitted from the server, a conversion unit which reads from the memory file data which is indicated by the received file name data, and converts the read file data to file data conforming to a format specified by the file name data, and a transmitter which transmits the converted file data to the server.

Abstract: Methods, systems, and apparatus, including computer program products, for identifying the language of a search query. In one embodiment, the language of each term of a query is determined from the query terms and the language of the user interface a user used to enter the query. In another embodiment, an automatic interface language classifier is generated from a collection of past queries each submitted by a user. In some embodiments, a score is determined for each of multiple languages, each score indicating a likelihood that the query language is the corresponding one of the multiple languages.

Abstract: The present invention is directed towards systems and methods for trust propagation. The method according to one embodiment comprises calculating a first feature vector for a first user, calculating a second feature for a second user and comparing the first feature vector with the second feature vector to calculate a similarity value. A determination is made as to whether the similarity value falls within a threshold. If the similarity value falls within the threshold, a relationship is recorded between the first user and the second user in a first user profile and a second user profile.

Abstract: Methods for transforming a query to simulate a bushy tree execution plan for queries containing joins in series are provided. Left deep tree execution plans are supported by most relational database systems but are inefficient at processing queries directed to databases with snowstorm schema. A snowstorm schema contains several large fact tables and many smaller dimension tables, which make reference to one another. Bushy tree execution plans can be much more efficient for processing queries to snowstorm schema. The decision to choose between left-deep and bushy tree execution plans are based on the relative costs of the two execution plans. The methods provided transform queries which are otherwise executed with left deep tree execution plans into queries which are executed with simulated bushy tree execution plans.

Abstract: A computer-readable recording medium containing a database copying program for making a copy of a database on a remote computer being connected over a network, without causing a delay in replying to an application program. A mirroring unit copies data written on a plurality of local disks onto corresponding remote disks in the same sequence as the data was written. Upon reception of a data writing request, a data writing unit stores the data in a local disk selected as a current disk. When the data stored in the current disk reaches a maximum data capacity, the current disk manager switches the current disk to another local disk. In addition, when the data stored in the current disk reaches the maximum data capacity, an operation information manager stores operation information requesting backup of the data stored in the current disk, in a local disk selected as an operation information storage disk.

Abstract: A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.

Abstract: An electronic data system comprises memory storage having stored data, file system software, and a transaction file. The transaction file is maintained by the file system software, and includes a plurality of transaction records corresponding to transactions that have been or are to be executed on one or more files and/or the or more directories of the file system. The file system software operates to organize and maintain the stored data in the files and directories and also to coalesce multiple transaction records meeting one or more criteria into fewer coalesced transaction records. The physical memory space required by the transaction file is reduced by the transaction record coalescing. The coalesced transaction records may be constructed so that they represent a logical result of applying each transaction record of a transaction record set in chronological order.

Abstract: A method comprises receiving, by a processor, a copy of a database containing records, each record having a plurality of attributes. The method also comprises determining, by the processor, whether a first attribute in each record results in a predetermined value in modulo P when hashed with a key and determining, by the processor, whether a second attribute in each record results in the predetermined value in modulo P when hashed with a key. For a first record whose first attribute results in the predetermined value in modulo P when hashed with a key and a second record whose second attribute also results in the predetermined value in modulo P when hashed with a key, the method further comprises swapping by the processor the second attributes between the first and second records.

Abstract: A searching apparatus includes a memory unit which stores transposed indexes representing appearing positions of all n-grams in plural pieces of document data subjected to searching and appearing frequencies, an n-gram extracting unit that extracts all n-grams extractable from a searching character string, a smallest-frequency deriving unit which refers to the appearing frequency of the n-gram represented by the transposed index, and derives an n-gram with the smallest appearing frequency among all of the extracted n-grams, a searching n-gram selecting unit that selects, from all extracted n-grams, a plurality of searching n-grams which form the searching character string and include the n-gram with the smallest appearing frequency, and a document specifying unit that specifies, based on the plurality of selected searching n-grams and the appearing position of the searching n-gram represented by the transposed index, document data including the searching character string among the plural pieces of document da

Abstract: A computer system and method are provided to promote the creation of a dynamically alterable taxonomy supporting query based database investigations is select fields. The system operates seamlessly and transparent to the underlying system search functions. A query that uses search terms unrecognized by the then extant taxonomy triggers a series of operations that test the new terms and updates the taxonomy as appropriate. To facilitate speed and accuracy, the system creates incentives to promote the enhancement of the taxonomy for an emerging technology.

Abstract: Multi-threaded access to a collection is synchronized without locking the collection for long periods of time. In one implementation, a collection is locked briefly to allow safe creation of a resource entry (or a placeholder entry) in the collection and then unlocked prior to the start of the resource build operation. As such, the collection is unlocked during the potentially long period of time required to build the resource (e.g., a data object) into the collection. Furthermore, during the build operation, access attempts to the same resource in the collection by other threads are forced to wait until the resource build is completed. Nevertheless, the collection itself is not locked during the resource build operation, so that other threads can access other resources within the collection without waiting.

Abstract: Activity data is analyzed or evaluated to detect behavioral patterns and anomalies. When a particular pattern or anomaly is detected, a system may send a notification or perform a particular task. This activity data may be collected in an information management system, which may be policy based. Notification may be by way e-mail, report, pop-up message, or system message. Some tasks to perform upon detection may include implementing a policy in the information management system, disallowing a user from connecting to the system, and restricting a user from being allowed to perform certain actions. To detect a pattern, activity data may be compared to a previously defined or generated activity profile.