Abstract: An apparatus, system, and method are disclosed for replication of data management information. A base replication module replicates a base table on an active server to a first and second standby server. The base table comprises configuration parameters for storage devices, logical volumes, physical interconnections, logical interconnections, and logical subsystems of a storage system, and the like. A session replication module replicates first sessions from a session table stored on the active server to the first standby server and second sessions to the second standby server. The session table stores a plurality of sessions. Each session comprises a plurality of copy sets. The active server manages the sessions using the base table and the session table, and the first and second standby servers do not manage the sessions. A transfer module transfers management of the first sessions to the first standby server.

Abstract: Embodiments of the present invention provide a mechanism for converting an existing mirror relationship between an original dataset at a source storage system and a copy of the original dataset at a destination system to a new mirror without discarding the existing copy of the original dataset and without transferring data to create a new dataset to replace the copy of the original dataset at the destination storage system. Rather, a directory structure (including file attributes) of the source storage system is transferred to the destination storage system and a comparison is made to identify file attributes at the destination system that match the transferred file attributes. If a match is found, a mapping between the matched file attributes is created. Subsequent updates to the destination storage system can be done using a technique other than the one that was used to create a copy of the source dataset.

Abstract: In an embodiment, an upgrade rule associated with a configuration set is found, and a document associated with the upgrade rule is found. The configuration set includes a schema and an upgrade transformation, and the upgrade transformation specifies a change that was made to the schema. The document includes a lifecycle state and an element. If the upgrade rule indicates an automatic upgrade, then a mutability rule associated with the lifecycle state of the document is found and a decision is made whether the mutability rule allows the document to be changed. If the mutability rule allows the document to be changed, the element in the document is changed to include the change specified by the upgrade transformation at a time specified by the upgrade rule.

Abstract: A method and system are described for determining similar concept sets. An example method includes obtaining taxonomies, each including one root node and hierarchically ordered paths; receiving first and second sets each including set concepts; determining concept pairs, each including a first and second set concept; determining lengths of nondiverging intersections of first and second subpaths from the root node to first and second concept nodes, and associated lengths of first and second portions of the subpaths from a last concept node included in the nondiverging intersection to the first and second concept nodes; determining pairwise similarity values based on ratios based on associated lengths of nondiverging intersections and the associated lengths of the first and second portions; and determining a concept set similarity value based on a weighted sum of the pairwise similarity values associated with optimal selected ones of the concept pairs.

Abstract: A novel rules engine which automates many warehouse processes, and provides for efficient management of a warehouse. The rules engine provides a flexible and customizable structure for modeling the many different types of processes governing the function of a warehouse. The rules engine translates business level logic into code for manipulating the warehouse database. The rules engine allows a user to create their own user logic for working with the database, which operates at a level of abstraction more feasible for the user. The rules engine understands the user logic by the way the user decides how to string various restrictions together. The rules engine implements the translation via its internal understanding of the structure of the particular application. Thus, the rules engine allows the user to define logic without understanding how to manipulate a database.

Abstract: At least one implementation described herein relates to evaluating queries structured according to a first format against one or more objects structured according to a second, different format without serializing the object. Typically, evaluating an XML (eXtensible Markup Language) query against a CLR (Common Language Runtime) object required serializing the CLR object and deriving an XML construct from the serialized data. The query is then be evaluated against the XML construct. In the described implementations, significant system resources are realized by creating an infoset model that maps properties of an object to an object infoset. The query is then evaluated using the infoset to locate object values and, thus, no serialization is required. Dynamically generated IL is used and re-used to efficiently perform subsequent evaluation steps on similar queries.

Abstract: A tree-structured index to multidimensional data is created using naturally occurring patterns and clusters within the data which permit efficient search and retrieval strategies in a database of DNA profiles. A search engine utilizes hierarchical decomposition of the database by identifying clusters of similar DNA profiles and maps to parallel computer architecture, allowing scale up past to previously feasible limits. Key benefits of the new method are logarithmic scale up and parallelization. These benefits are achieved by identification and utilization of naturally occurring patterns and clusters within stored data. The patterns and clusters enable the stored data to be partitioned into subsets of roughly equal size. The method can be applied recursively, resulting in a database tree that is balanced, meaning that all paths or branches through the tree have roughly the same length.

Abstract: Architecture for security trimming results in a document version environment. Versioned documents are stored with metadata that includes associated access rights. All versions are searched using multiple user accounts of varying levels of access that correspond to the document versions. Result sets are returned for each user account and trimmed during a merge process by considering the user rights associated with each of multiple versions of objects or documents. Each document metadata includes a scope ID that defines security rights for that document. In a two-version document (major and minor) implementation, successive queries are run as a user with rights to all minor versions, and as a user with rights to all major items, but not the minor items. The result sets are merged into a final trimmed result set by examining the rights to each item in the versioned sets that align with rights of the current user.

Abstract: A mechanism for structured query language tagging is provided. The mechanism comprises a parsing unit for parsing a structured query language string into components, an analysis unit for analyzing the components and applying associated tags to the components, and a string generation unit for concatenating the components with associated tags into a new string.

Abstract: A method of operating a database management system for integrating data from a plurality of data sources comprising steps of: (a) selecting initial attributes for first and second data sources; (b) selecting a candidate matching function relating to a possible mapping between data in said first and second data sources; (c) applying said candidate matching function to data in said first data source to create possible data for said second data source; (d) deriving a disparity measure relating to an amount of disparity therebetween; (e) selecting different candidate matching functions and repeating steps (c) and (d); (f) designating a candidate matching function having a disparity measure indicative of the lowest amount of disparity as a probable candidate matching function; (g) selecting further attributes and performing steps (b) to (f) in respect thereof; and (h) determining a probable correspondence between data objects of said first and second data sources.

Abstract: A method and system for identifying information to be associated with content of a display page. The system provides a web service through which associates of a vendor can request and receive information such as product data to be displayed on the associate's display pages. The system may receive from an associate's computer a request for product data that may include content derived from a web page on which the product is to be displayed. Upon receiving the request, the system identifies a query based on popularity of the query among users, executes the query, and provides an associate with information relating to the results of the executed query.

Abstract: A database management system receives a request to perform an operation on a set of target data and, at some point after it begins executing that operation, places a lock on the target data to prevent concurrent execution of other operations on the target data. In some embodiments, the system receives an instruction from a user to perform a data-definition operation on a set of target data; places an initial lock on the target data at a level that allows at least one concurrent operation on the target data; begins executing the operation; and then places a final lock on the target data at a level that excludes all other concurrent operations on the target data.

Abstract: In a system in which a DB is built in a virtualization environment, a management server obtains DB processing information such as a DB processing execution plan and a degree of processing priority from a DBMS, predicts data to be accessed in the near future and the order of such accesses based on the information, instructs to read into caches of storage devices data to be accessed in the near future based on the prediction results, and reads the data that will be accessed in the nearest future into a cache memory within the management server.

Abstract: A method for optimizing the construction of a KStore includes providing a data set having a plurality of records with a plurality of fields, providing an optimization structure from a sample of the data set and analyzing the optimization structure to determine a field order for the records contained in the data set. A KStore is provided from the data set in accordance with the field order. The sample of the data set can include the entire data set, a random sample of the data set or a predetermined number of records from the data set. The data set has an initial order having earlier records and later records and the sample can include a plurality of the earlier records. The sample of the data set includes a user determined number of records from the data set. The optimization structure can be a KStore.

Abstract: A primary processor manages metadata of a production dataset and a snapshot copy, while a secondary processor provides concurrent read-write access to the primary dataset. The secondary processor determines when a first write is being made to a data block of the production dataset, and in this case sends a metadata change request to the primary data processor. The primary data processor commits the metadata change to the production dataset and maintains the snapshot copy while the secondary data processor continues to service other read-write requests. The secondary processor logs metadata changes so that the secondary processor may return a “write completed” message before the primary processor commits the metadata change. The primary data processor pre-allocates data storage blocks in such a way that the “write anywhere” method does not result in a gradual degradation in I/O performance.

Abstract: A technique capable of constructing a disaster recovery system reduced in performance degradation of a primary system is provided. The technique includes a step of conducting synchronous writing of log information into a secondary storage subsystem in a secondary system when a write request received from a host computer is a write request of log information, a step of temporarily storing a write request and conducting asynchronous writing into the secondary storage subsystem when the received write request is a write request of database data or status information, a step of modifying log information, data in a database area, and status information in the secondary storage subsystem according to contents of a write request received from a primary storage subsystem, and a step of recovering the database area according to contents of log information in a location indicated by the status information.

Abstract: A method of providing shared objects and node-specific objects in a cluster file system is described and provided. The method includes providing to a particular shared object an attribute, whereas the particular shared object can be a container-type shared object. The attribute indicates any object created in the particular shared object (including its sub-divisions or sub-containers) from this point in time will be designated as node-specific. Furthermore, when a node causes a file system operation that is node-specific to be performed by accessing the particular shared object, the file system operation is performed in an alternate directory corresponding to the node. The alternate directory supports a node-specific object. The shared objects and the node-specific objects can be directories. Additionally, the shared objects and the node-specific objects can be files.

Abstract: A plurality of metadata relating to digital contents is presented to a user as a package. A media capsule provision server which comprises a media capsule structure information database for storing metadata relating to the digital contents, contents list structure information, a Raw data database, media capsule providing means for packaging the plurality of metadata stored in the database, media capsule distribution processing means for distributing the media capsule to a user, and a media capsule destination information database for managing the destination information is provided.

Abstract: The present invention can include a data processing system-implemented method or a data processing system readable media having software code for carrying out the method. The method can comprise formulating queries, searching for a plurality of information objects, or a combination thereof. In a specific embodiment, an original query with at least one keyword can be automatically expanded to an expanded query that includes at least one keyword that is not in the original query. The expanded query may be used to search for information objects that are relevant to the expanded query.

Abstract: A versionable schema is both backward-compatible and forward-compatible. Such a schema is able to receive data expected by multiple versions of the schema; tolerates the absence of optional data, in accordance with other versions, and accept wildcard data in accordance with still further versions. Thus, a message or message may be validated by the versionable schema.