9254results about "Database design/maintainance" patented technology

An informatics system permits data entities from a wide range of data sources to be accessed and evaluated. The sources of the data entities may be simply data sources, such as for articles and other non-patient or population specific information, as well as controllable and prescribable sources, such diagnostic imaging, clinical and other sources forming part of the patient care path. The entities are organized, analyzed in accordance with a domain framework, which may be altered by a user to focus on factors and informational components of interest. Holistic and integrated understanding of such factors are there fore available, and refinement of healthcare processes can be made to provide improved care in a more time and cost effective manner.

The content metadata directory system connects consumers of identified content to managed metadata databases and other digital resources. The system manages links between identifiers in content objects and metadata sources. It supports a variety of different type of content identifiers and allows for overlap among different content identification schemes. One method of associating a content object with metadata uses a combination of a content identifier and a bounding identifier to enable handling of disparate sets of content identifiers for content objects with potentially conflicting content identifiers. The method receives a content identifier for a content object from among a set of content identifiers and provides a unique bounding identifier for the set of content identifiers. This unique bounding identifier is used in combination with the content identifier to form a globally unique identifier for the content object. This globally unique identifier is associated with a metadata source, which enables routing of a user to the metadata source.

Conventional file-based engineering design data for an engineering model are represented by a plurality of components. Each component has a unique identifier, a set of fields, each field having a data type and a data value, and a program which interprets and modifies the fields. The plurality of components are stored in a repository of a server. The repository also stores a history of any changes made to the components. A plurality of client computers are bidirectionally connected to the server. Each client computer may obtain the current version of the components and may send locally edited versions of the components back to the server to replace the current versions in the repository. At the client computer, the user interacts with the components using conventional file-based software. Before locally edited versions of the components are committed to the server to replace the current versions, a synchronization and merging process occurs whereby the latest version of the components are downloaded to the client computer and are compared to the locally edited version of the components to detect resolvable (compatible) and unresolvable (incompatible) conflicts therebetween. The commit process is performed only if no unresolvable conflicts exist between the two versions of the components. To facilitate translation between file-based data and components, a schema is written to "wrap" each of the engineering file formats. Each schema is a set of classes that capture all of the information in the file-based data.

An online social network is provided in which members of the online social network control who may view their personal information and who may communicate with them. The members control who may view their personal information by setting a visibility preference. A member may not view another member's full personal profile if the measure of relatedness between the two is greater than the visibility preference of the other member. The members also control who may communicate with them by setting a contactability preference. A member may not communicate with another member if the measure of relatedness between the two is greater than the contactability preference of the other member.

An archive cluster application runs in a distributed manner across a redundant array of independent nodes. Each node preferably runs a complete archive cluster application instance. A given nodes provides a data repository, which stores up to a large amount (e.g., a terabyte) of data, while also acting as a portal that enables access to archive files. Each symmetric node has a set of software processes, e.g., a request manager, a storage manager, a metadata manager, and a policy manager. The request manager manages requests to the node for data (i.e., file data), the storage manager manages data read/write functions from a disk associated with the node, and the metadata manager facilitates metadata transactions and recovery across the distributed database. The policy manager implements one or more policies, which are operations that determine the behavior of an “archive object” within the cluster. The archive cluster application provides object-based storage. Preferably, the application permanently associates metadata and policies with the raw archived data, which together comprise an archive object. Object policies govern the object's behavior in the archive. As a result, the archive manages itself independently of client applications, acting automatically to ensure that all object policies are valid.

A method for generating performance alerts in a database system. The method includes collecting a predefined set of performance data, and comparing the performance data to one or more predefined thresholds. The method also includes determining if any of the performance data exceeds the one or more predefined thresholds, and generating an alert if any of the data exceeds one of the predefined thresholds.

Mechanisms and methods for pushing data to a plurality of devices of a plurality of organizations are provided. Queries are handled in bulk for a group of users of an organization or the entire organization, and limited results are sent to a middle tier server between the database system and the user devices. These mechanisms and methods for pushing data to a plurality of devices enable an efficient and transparent transfer of data to user devices. This efficient and transparent transfer of data can enable mobile devices of many organizations to seamlessly have the data that is required to perform business.

This method relates to the generation of manipulation requests of an initialization and administration database of a server cluster comprising several nodes interconnected between each other by at least one data transmission network. It comprises steps of generating from a logical distribution of the nodes of the cluster, from a geographical distribution and from a hardware definition of the nodes of the cluster at least one set of profiles of the nodes and of the data transmission network; defining an addressing policy of the nodes of the cluster; allocating from the set of profiles and according to the addressing policy, at least one address to each node of the server cluster and generating a set of parameters of the cluster; and generating from the set of parameters of the cluster and of the addresses of its nodes, at least one file of manipulation requests of the database.

Smart containers are disclosed. A definition is received of a logical structure configured to manage associated content. A policy or operation specified by the definition is applied to an item of content associated with an instance of the logical structure.

A database system with methodology for automated determination and selection of optimal indexes is described. In one embodiment, for example, in a database system, a method of the present invention is described for recommending database indexes to be created for optimizing system performance, the method comprises steps of: capturing a workload representative of database queries employed during system use; creating virtual indexes for optimizing system performance during execution of the database queries captured in the workload; computing cost benefits for different combinations of the virtual indexes; and recommending physical indexes to be created based on virtual indexes that have favorable cost benefits for the captured workload.

An intelligent database infrastructure wherein the management of all database components is performed by and within the database itself by integrating management of various components with a central management control. Each individual database component, as well as the central management control, is self-managing. A central management control module integrates and interacts with the various database components. The database is configured to automatically tune to varying workloads and configurations, correct or alert about bad conditions, and advise on ways to improve overall system performance.

In one embodiment of the present invention, a data-backup method includes partitioning a fingerprint namespace among a cluster of backup servers, the fingerprint namespace comprising fingerprints for representing units of data, each backup server of the cluster of backup servers managing units of data having fingerprints corresponding to an assigned partition of the fingerprint namespace. The method further includes receiving backup information from a client computing device for a block of data comprising units of data, the backup information including at least a fingerprint for each of the units of data and client-specific backup information. In addition, the method includes, utilizing the fingerprint for each of the units of data, deduplicating the units of data in parallel at the cluster of backup servers in accordance with the partitioning step, the deduplicating step comprising identifying ones of the units data already stored by the cluster of backup servers.

First data that represents a level associated with an element within an expression, such as an XPath expression, is generated from the expression, and stored in one or more columns of a table. Second data that represents a condition on an attribute of the element is generated from the expression, and stored in one or more columns of the same or a different table. A plurality of expressions can be processed as such, and a determination made whether any of the expressions match with a given hierarchical data item, such as an XML document, that includes a value that corresponds to an attribute that is associated with an element that resides at a particular level within the data item. Such determination is made based on whether the particular level matches the first data and the value satisfies the second data associated with a given expression.

A system includes an active node and a standby node and zero or more replica nodes. Each of the nodes includes a database system, such as an in-memory database system. Client updates applied to the active node are written through to the standby node, and the standby node writes the updates through to a primary database and updates the replica nodes. Commit ticket numbers tag entries in transaction logs and are used to facilitate recovery if either of the active node or the standby node fails. Updates applied to the primary database are autorefreshed to the active node and written through by the active node to the standby node which propagates the updates to the replica nodes. Bookmarks are used to track updated records of the primary database and are used to facilitate recovery if either of the active node or the standby node fails.

A data storage system backs up or protects virtual machines. For instance, the system identifies the different virtual machines executing in the system and provides a number of factors that can be used to create a backup policy. The system further creates specific rules for virtual machine backup policies using a user interface with drop down boxes of relevant criteria and Boolean operators. A preview of included virtual machines allows the rule to be refined. Particular virtual machines can be excluded during the preview. The system further dynamically updates the list of virtual machines satisfying the rules at time of backup.

A method, apparatus, and system for accessing units of storage that depends at least in part on an address of the unit of storage and the time that data was written to the unit of storage. By accessing units of storage in response to a time, prior images of a data store can be generated substantially instantaneously.

Techniques for fast recovery and/or balancing of connections to a clustered computing system provide management of such connections by determining a number of connections to load balance across nodes and by triggering creation of such connections. In one aspect, a notification of an event regarding the clustered computing system is received by a connection pool manager, a pool of connections to the system is identified based on the notification, and one or more connections from the pool are processed in response to the event. According to an embodiment, the notification comprises the identities of the service, database, server instance and machine that correspond to the event.

A topology information system, comprising a topology collection sub-system, a topology database, a topology query sub-system and a topology correlation sub-system. The topology collection sub-system includes at least one topology discovery agent. The topology collection sub-system automatically collects topology information from at least one topology layer of at least one managed world. The topology database is adapted to store the topology information collected by the topology collection sub-system. The topology query sub-system is adapted to query the topology information stored in the topology database using a topology pattern query created by a user. The topology correlation sub-system operates in parallel to the topology query sub-system, constantly monitoring the managed world for events and updating the Information Base accordingly.

A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into systems each having multiple nodes. A search index is provided in each system for locating objects within the system. A method of managing the search index comprises splitting the search index into shards to be divided among a plurality of regions (704). The regions are larger in number than the nodes in the system. Each region has a master and at least one backup copy of one of the shards. A shard core is a master or backup copy of a shard. The method further comprises distributing the shard cores to the nodes, and providing a region mapping table in each node in the system to map the shard cores to the nodes in which the shard cores are stored (706).

Embodiments of a method for managing entities include candidate selection by a transitive bucketing process where at least one attribute of an initial data record is used to determine a set of candidate data records corresponding to the initial data record. For each candidate data record thus determined, additional candidate data record(s) may be determined using attribute(s) not used in linking the candidate data record to the initial data record. This process may be repeated until no more candidate data records are returned. The initial data record and related candidates thus determined are then resolved into group entities, each having member records that match one another above a certain threshold. If no match is found, a group entity comprising a single data record may be created. These group entities are then reconciled with other entities in a master entity index system.