Abstract: A system (100) is provided for storing knowledge, information and data (KID). The system includes a plurality of sources of KID (20), at least one receiver of KID (30) from the plurality of sources, a universal knowledge, information and data store (UKIDS 160) and an interface (150) coupling the receiver and the UKIDS. The interface provides a plurality of logical partitions (200) for storing KID within the UKIDS. In one embodiment, a first level of the logical partitions segregates information into personal and professional KID. A plurality of second personal levels under the first personal level (210) segregates KID storage into a teams of people subset (212), an activities and organization subset (214) and an organization and administration subset (216). A plurality of second professional levels under said first professional level (220) segregates KID storage into a clients subset (230), an output subset (250), a teams subset (270) and an administration subset (290).

Abstract: In registering operation of a document to be searched for, a document identifier management table for managing a range of a document identifier stored for each page and a page identifier of the page is created, and an individual-search-server's search range management table for managing the range of the document identifier in charge of each search server is created. In searching operation of each search server of the document to be searched for, the individual-search-server's search range management table is referred to acquire a range of the allocated document identifier. For each index key forming a query term specified as a query condition, the document identifier management table is referred to to acquire the page identifier storing the document identifier of the allocated range. The searching operation is carried out by referring to a page shown by the acquired page identifier.

Abstract: A monitoring system provided according to an aspect of the present invention enables a user to specify multiple resource elements as a resource pool, and view various aggregate information (e.g., sum, average) for attributes of interest for all the resource elements together. Such a feature is particularly useful in distributed environments where multiple independent resource elements need to be viewed as a single resource pool. The user is provided the flexibility to select the specific resource elements to be included in the resource pool.

Abstract: A method and apparatus are provided for distributing a database join operation across a plurality of processing nodes. The database join operation is performed between a first table having M1 rows and a second table have M2 rows and involves forming M1×M2 combinations of rows from the first and second tables. The method includes allocating across the plurality of processing nodes the M1×M2 combinations of rows from the first and second tables. Each of the M1×M2 combinations is present on one of the nodes, and each node stores combinations corresponding to a subset of the M1 rows from the first table and a subset of the M2 rows from the second table. The method further comprises performing for each processing node the join operation in respect of all combinations of rows allocated to that processing node and collating results across all the processing nodes to complete the join operation.

Abstract: A method for backup and restore using inconsistent state indicators comprises identifying, from among a plurality of data objects to be backed up, one or more data objects that are in an inconsistent state, and storing inconsistent state indicators (such as modified object attributes) associated with the data objects. The method may further include generating a backup aggregate such as a snapshot of the plurality of data objects, where the backup aggregate includes backup versions of the inconsistent data objects. Prior to restoring one or more data objects from the backup aggregation, the method may include using the inconsistent state indicators to identify the backup versions that correspond to the inconsistent data objects, e.g., to exclude backup versions corresponding to inconsistent data objects from a list of full restoration candidates.

Abstract: An abstraction for rich data access for consumers of a service in a service oriented system. The abstraction is created by the author of a service which owns the data, and includes a number of service-public properties and associations. Further, the abstraction can contain metadata and logic that provides for a rich, interactive experience for the consumer interacting with the data encapsulated by the entity agent. These can include verifying that the data conforms to the contract published by the owning service, validating and defaulting properties, and validating associated data. Also the abstraction can contains metadata and logic for transmitting of the data back to the owning service and optionally saving to the local data store of the consumer.

Abstract: A method of converting an XML file containing elements to a table, each element having an XPath, in which row-terminating conditions a column data sources are determined; a scope for each element is determined; one of the elements is tested to determine if the element matches a column data source, and if it does the element is stored in a table cache and the columns are updated. The tested element is then stored in a prototype row; and when the method exits the tested element, a depth is passed to the table cache; then if the tested element matches one of the row-terminating conditions, matches a row-terminating condition, and is in the prototype row, then the prototype row is written to the table cache; then if the scope of one of the column data source matches the tested element, a column is erased in the prototype row.

Abstract: System and method for the determination of the relevance of a content item to a query through the use of a machine learned relevance function that incorporates click-through features of the content items. A method for selecting a relevance function to determine a relevance of a query-content item pair comprises generating training set having one or more query-URL pairs labeled for relevance based on their click-through features. The labeled query-URL pairs are used to determine the relevance function by minimizing a loss function that accounts for click-through features of the content item. The computed relevance function is then applied to the click-through features of unlabeled content items to assign relevance scores thereto. An inverted click-through index of query-score pairs is formed and combined with the content index to improve relevance of search results.

Abstract: This invention provides an image processing system and image processing method which can promote efficient use of a memory by vectorizing all data of a representative object and, for the same or similar object, referring to the vectorized representative object and using difference data and also convert the same or similar objects at once by editing only the representative object. Input image information is vectorized. The vector data of a representative object is stored. Identity between a target object and the representative object is determined. If the two objects are identical, property information containing information about the reference destination of the vector data of the representative object is stored in place of the vector data of the target object.

Abstract: Systems and techniques for the creation and use of a complex data structure identifier thesaurus. In one aspect, an article comprises one or more machine-readable media storing instructions operable to cause one or more machines to perform operations. The operations include receiving, from a data processing system, a collection of mapping information identifying a first object and a first collection of two or more keys used to identify the first object, determining whether a first key in the first collection is found in a first mapping group of a mapping data store, determining whether second key in the first collection is found in a second mapping group of the mapping data store, and merging the first mapping group and the second mapping group to reflect that objects from the first mapping group and the second mapping group are related.

Abstract: A system, method, and computer-readable medium are disclosed for data processing. An exemplary method includes coupling a plurality of data warehouses to a data processing system. Each of the data warehouses may include key figures field catalogues and characteristics field catalogues. The method may further include selecting a sub-set of the plurality of data warehouses, selecting at least one of the key figures field catalogues and characteristics field catalogues of a selected one of the data warehouses, and storing data indicative of the selected sub-set and the selected at least one key figures field catalogue and characteristics field catalogue for definition of a data domain.

Abstract: A computer implemented method of constructing a social network, the method including constructing the social network from a plurality of disparate, heterogenous data sources, wherein at least one of the plurality of disparate, heterogenous data sources includes a user generated data source; identifying a plurality of nodes and linkages; determining attributes of the nodes and linkages based on a plurality of disparate, heterogenous data sources, wherein the plurality of disparate, heterogenous data sources includes a combination of the user generated data source and at least one non-user generated source, wherein the attributes include at least one of a deterministic attribute, a probabilistic attribute, and a dynamic attribute; populating a mathemetical decision-making model based on the plurality of nodes and linkages, and the determined attributes of the plurality of nodes and linkages; determining attributes of the nodes and links at a second point in time; re-populating the mathematical decision-making m

Abstract: A system, method, and computer program product are provided for synchronizing configuration values between a database and a remote input utility by configuring the database for remote input and loading the configuration values to a control file at the server, and copying the configuration values to a control file at remote system including the input utility, executing the input utility at a remote system using configuration values from the control file at the remote system to prepare data for input to the database, and responsive to the configuration values at the control file of the server, updating the configuration values in the control file at the remote system before migrating the new data from the input utility to the database.

Abstract: A table, such as a database table can be partitioned into blocks that are conveniently sized for storage and retrieval. The amount of storage space required and the speed of storing and retrieving blocks is proportional to the size of the blocks. Compressing the blocks leads to less required space and more speed. The columns in a table, and therefore the rows in a transposed block, tend to contain similar data. Compression algorithms can work more efficiently when sequential data items are similar. Therefore, transposing the blocks before compression or compressing them in a column-wise manner leads to better compression. Different compression algorithms can be used for each set of columnar data to yield even better compression.

Abstract: The caching of heterogeneous sets of bean is accomplished using a single cache. The beans can be identified by generating a unique identifier that is a combination of the bean's primary key and a self-reference identifier of the bean manager associated with that bean. The average size of a bean set associated with a bean manager can be specified such that the cache allocates memory for that set based on the average size. A callback interface can also be used to shift knowledge of a bean life cycle back to the bean manager.

Abstract: An application consistent data protection method provides application-assist and replication-technology neutral mirroring that ensures that a remote data copy is application-consistent. The method comprises a coordination protocol to coordinate application hosts across heterogeneous hosts and heterogeneous storage devices. The method utilizes a disk layout and data record format that enables use of an underlying replication ability of a storage device, minimizing development cost and utilizing customer investment. The method comprises on-demand consistency point initiation to minimize performance impact and maximize system resource usage. The method can be applied to both synchronous and asynchronous mirroring and can be incorporated into any virtualization device.

Abstract: A method for recording information in an interlocking trees datastore having a plurality of K paths includes receiving an input particle and building a new K node in accordance with the received input particle. A K node is locked in accordance with the building of the new K node to provide a locked node. The locked node can be the Case node of the new K node. The Case bi-directional link between the locked Case node and the new K node is completed while the locked Case node is locked. A pointer is added to the new K node to an asCase list of the locked Case node. The locked node is locked only while adding the pointer to the new K node to the asCase list of the locked Case node. The locked node can also be a Result node of the new K node.