Method and system for managing partitioned data resources

• US 20020165727A1
• Filed: 05/22/2001
• Published: 11/07/2002
• Est. Priority Date: 05/22/2000
• Status: Active Grant

• Current Assignee: EKMK Limited Liability Company
• Original Assignee: MCI Incorporated (Verizon Communications Inc.)
• Inventors: Robertson, James A., Greene, William S.
• Granted Patent: US 6,922,685 B2
• Time in Patent Office: Days
• US Class Current: 705/1
• CPC Class Codes: G06Q 10/063112 Skill-based matching of a person or a group to a task
• CPC Class Codes: G06Q 10/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/06398 Performance of employee with respect to a job function
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 10/1093 Calendar-based scheduling for persons or groups
• CPC Class Codes: G06Q 20/3829 involving key management
• CPC Class Codes: G06Q 40/00 Finance; Insurance; Tax strategies; Processing of corporate or income taxes
• CPC Class Codes: H04L 41/0233 Object-oriented techniques, for representation of network management data, e.g. common object request broker architecture [CORBA]
• CPC Class Codes: H04L 41/0661 by reconfiguring faulty entities
• CPC Class Codes: H04L 41/0663 Performing the actions predefined by failover planning, e.g. switching to standby network elements
• CPC Class Codes: H04L 41/0843 based on generic templates
• CPC Class Codes: H04L 41/0856 by backing up or archiving configuration information
• CPC Class Codes: H04L 41/0893 Assignment of logical groups to network elements
• CPC Class Codes: H04L 41/0894 Policy-based network configuration management
• CPC Class Codes: H04L 41/40 using virtualisation of network functions or resources, e.g. SDN or NFV entities
• CPC Class Codes: H04L 41/5041 characterised by the time relationship between creation and deployment of a service
• CPC Class Codes: H04L 41/5058 Service discovery by the service manager
• CPC Class Codes: H04L 61/4553 Object oriented directories, e.g. common object request broker architecture [CORBA] name server
• CPC Class Codes: H04L 63/08 for authentication of entities cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32
• CPC Class Codes: H04L 63/102 Entity profiles
• CPC Class Codes: H04L 63/123 : received data contents, e.g. message integrity
• CPC Class Codes: H04L 67/01 : Protocols
• CPC Class Codes: H04L 67/1095 : Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/34 : involving the movement of software or configuration parameters network booting or remote initial program loading [RIPL] G06F9/4416
• CPC Class Codes: H04L 67/51 : Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 67/535 : Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34
• CPC Class Codes: H04L 67/54 : Presence management, e.g. monitoring or registration for receipt of user log-on information, or the connection status of the users
• CPC Class Codes: H04L 67/568 : Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: Y10S 707/99931 : Database or file accessing

Abstract

In accordance with an exemplary embodiment of the present invention, association forming entities are: a) maintained as objects in a like manner to the data objects being associated; and b) are themselves partitioned objects comprising two or more association fragments, each association fragment being mostly concerned with the interfaces to a particular data object participating in the association. In accordance with an exemplary embodiment of the present invention, each association fragment affiliated with a particular data object is stored in a location that enhances the ease of interaction between the association fragment and the data object. For example, where a first data object and second data object are maintained in data stores at some distance from one another, physically or logically, then a first association fragment will be located with or near to the first data object and a second association fragment will be located with or near the second data object, at least within the same partition. This arrangement may be preferable because the volume of interaction between a data object and its respective association fragment may far outweigh the interaction needed between the two association fragments. This arrangement may also be preferable as the volume of interaction between a client application and both the data object and respective association fragment may exceed the interaction needed between the two association fragments. Some interactions will employ only one of the association fragments with the net result being a reduction in communications requirements and an improvement in performance. The present invention further provides for defining logical domains which are arbitrary and entirely orthogonal to partitions.

Claims

1. In a computing environment, a method for implementing an association among a first data object and a second data object comprising the steps of:

forming a first association fragment which comprises information relevant to accessing the first data object; and

forming a second association fragment which comprises information relevant to accessing the second data object, wherein the first association fragment and second association fragment cooperate to cause an association to be effectively formed between the first data object and the second data object.

2. The method of claim 1 wherein the first association part and second associate part are maintained in the computing environment as data objects apart from, and in like manner as peers to, the first data object and the second data object.

3. The method of claim 1 wherein the first data object and second data object are maintained by separate processes in the computing environment.

4. The method of claim 1 wherein the first data object and second data object are maintained in separate data stores.

5. The method of claim 1 wherein the first association fragment is maintained substantially in proximity to the first data object to facilitate the interaction therebetween, and wherein the second association fragment is maintained substantially in proximity to the second data object to facilitate the interaction therebetween.

6. In a computing environment, a method for implementing an association between a first data object and a second data object comprising the steps of:

forming a first association fragment which comprises information relevant to accessing the first data object; and

forming a second association fragment which comprises information relevant to accessing the second data object, wherein the first association fragment and second association fragment cooperate to cause an association to effectively be formed between the first data object and the second data object.