Mechanism for creating member private data in a global namespace

• US 7,672,945 B1
• Filed: 11/25/2002
• Issued: 03/02/2010
• Est. Priority Date: 04/08/2002
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Srivastava, Alok K., Chatterjee, Surojit
• Primary Examiner(s): Pham; Khanh B
• Application Number:
  US10/304,449
• Time in Patent Office: 2,654 Days
• Field of Search: 707/9
• US Class Current: 1/1
• CPC Class Codes: G06F 16/907 Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
• CPC Class Codes: Y10S 707/99939 Privileged access

Abstract

A system and techniques are described for creating member private data in a global namespace. According to one aspect, first data that is associated with a key is stored in a repository shared by multiple members. After the first data has been stored, second data that is associated with the key is stored without overwriting the first data. Mapping data is stored. The mapping data maps the key, relative to a first member, to a first data structure that stores the first data. The mapping data also maps the key, relative to a second member, to a second data structure that stores the second data. Based on the mapping data, the first member is allowed to access the first data and not the said second data. Based on the mapping data, the second member is allowed to access the second data and not the first data. The first data and the second data may include key values and subtrees of child keys.

Claims

1. A method for creating member private data in a global namespace, the method comprising:

a computer processor storing, in a repository shared by a plurality of members of a distributed system, first data that is associated with a key that is specified in a namespace;

after storing said first data, said computer processor storing, in said repository, second data that is associated with said key;

said computer processor storing, on a volatile or non-volatile computer-readable storage medium, mapping data that;

(a) maps said key to a first member of the distributed system and to a first data structure that stores said first data, thereby forming a first association between said key, said first member, and said first data, and (b) maps said key to a second member of the distributed system and to a second data structure that stores said second data, thereby forming a second association between said key, said second member, and said second data;

after storing said second data associated with said key, said computer processor receiving from the first member a request for the value of said key and sending said first data to said first member due at least in part to an existence of said first association;

said computer processor, in response to said request from said second member, sending said second data to said second member due at least in part to an existence of said second association; and

said computer processor, based on said mapping data, preventing first member from accessing said second data and preventing second member from accessing said first data;

wherein said first member is separate from said second member; and

wherein said first data differs from said second data.

2. The method of claim 1, further comprising:

receiving a first request to store said first data in association with said key;

receiving a second request to store said second data in association with said key;

wherein said first request is received from said first member;

wherein said second request is received from said second member;

wherein said storing of said first data is performed in response to receiving said first request; and

wherein said storing of said second data is performed in response to receiving said second request.

3. The method of claim 1, wherein storing said mapping data comprises:

storing, in a third data structure, a first association between said key, said first member, and first location data; and

storing, in said third data structure, a second association between said key, said second member, and second location data that differs from said first location data.

4. The method of claim 3, wherein:

said first location data is for locating said first data structure; and

said second location data is for locating said second data structure.

5. The method of claim 3, further comprising:

storing, in a parent data structure of said first and second data structures, location data for locating said first association within said third data structure; and

storing, in said parent data structure, location data for locating said second association within said third data structure.

6. The method of claim 1, further comprising:

receiving a request to create a member-dependent key; and

in response to said request to create a member-dependent key, creating said key.

7. The method of claim 1, further comprising:

receiving a request from said first member to delete said key; and

in response to said request from said first member to delete said key, modifying a data structure to cause said key to be deleted relative to said first member but not said second member.

8. The method of claim 1, further comprising:

receiving a request from said first member to read said key; and

in response to said request from said first member to read said key, returning said first data to said first member but not returning said second data to said first member.

9. The method of claim 1, further comprising:

receiving a request from said first member to set a value of said key; and

in response to said request from said first member to set a value of said key, modifying said first data but not said second data.

10. The method of claim 1, further comprising:

receiving a request from said first member to convert said key into a key that is not a member-dependent key; and

in response to said request to convert said key into a key that is not a member-dependent key, causing a key component entry to point to said first data instead of said mapping data.

11. The method of claim 1, further comprising:

receiving a request from said first member to convert a key that is not a member-dependent key into a member-dependent key; and

in response to said request to convert a key that is not a member-dependent key into a member-dependent key, replicating a data structure that stores data that is associated with said key that is not a member-dependent key.

12. A volatile or non-volatile computer-readable storage medium that carries instructions to be executed by a processor for creating member private data in a global namespace, the instructions comprising instructions for performing the steps of:

storing, by a computer processor, in a repository shared by a plurality of members of a distributed system, first data that is associated with a key that is specified in a namespace;

after storing said first data, storing, in said repository, second data that is associated with said key;

storing, on a volatile or non-volatile computer-readable medium, mapping data that;

(a) maps said key to a first member of the distributed system and to a first data structure that stores said first data, thereby forming a first association between said key, said first member, and said first data, and (b) maps said key to a second member of the distributed system and to a second data structure that stores said second data, thereby forming a second association between said key, said second member, and said second data;

after storing said second data associated with said key, receiving from the first member a request for the value of said key and sending said first data to said first member due at least in part to an existence of said first association;

response to said request from said second member, sending said second data to said second member due at least in part to an existence of said second association; and

based on said mapping data, preventing said first member from accessing said second data, and preventing said second member from accessing said first data;

wherein said first member is separate from said second member; and

wherein said first data differs from said second data.

13. The volatile or non-volatile computer-readable storage medium of claim 12, wherein the instructions comprise instructions for performing the steps of:

receiving a first request to store said first data in association with said key;

receiving a second request to store said second data in association with said key;

wherein said first request is received from said first member;

wherein said second request is received from said second member;

wherein said storing of said first data is performed in response to receiving said first request; and

wherein said storing of said second data is performed in response to receiving said second request.

14. The volatile or non-volatile computer-readable storage medium of claim 12, wherein storing said mapping data comprises:

storing, in a third data structure, a first association between said key, said first member, and first location data; and

storing, in said third data structure, a second association between said key, said second member, and second location data that differs from said first location data.

15. The volatile or non-volatile computer-readable storage medium of claim 12, wherein:

said first location data is for locating said first data structure; and

said second location data is for locating said second data structure.

16. The volatile or non-volatile computer-readable storage medium of claim 12, wherein the instructions comprise instructions for performing the steps of:

storing, in a parent data structure of said first and second data structures, location data for locating said first association within said third data structure; and

storing, in said parent data structure, location data for locating said second association within said third data structure.

17. The volatile or non-volatile computer-readable storage medium of claim 12, wherein the instructions comprise instructions for performing the steps of:

receiving a request to create a member-dependent key; and

in response to said request to create a member-dependent key, creating said key.

18. The volatile or non-volatile computer-readable storage medium of claim 12, wherein the instructions comprise instructions for performing the steps of:

receiving a request from said first member to delete said key; and

in response to said request from said first member to delete said key, modifying a data structure to cause said key to be deleted relative to said first member but not said second member.

19. The volatile or non-volatile computer-readable storage medium of claim 13, wherein the instructions comprise instructions for performing the steps of:

receiving a request from said first member to read said key; and

in response to said request from said first member to read said key, returning said first data to said first member but not returning said second data to said first member.

20. The volatile or non-volatile computer-readable storage medium of claim 12, wherein the instructions comprise instructions for performing the steps of:

receiving a request from said first member to set a value of said key; and

in response to said request from said first member to set a value of said key, modifying said first data but not said second data.

21. The volatile or non-volatile computer-readable storage medium of claim 12, wherein the instructions comprise instructions for performing the steps of:

receiving a request from said first member to convert said key into a key that is not a member-dependent key; and

in response to said request to convert said key into a key that is not a member-dependent key, causing a key component entry to point to said first data instead of said mapping data.

22. The volatile or non-volatile computer-readable storage medium of claim 12, wherein the instructions comprise instructions for performing the steps of:

receiving a request from said first member to convert a key that is not a member-dependent key into a member-dependent key; and

in response to said request to convert a key that is not a member-dependent key into a member-dependent key, replicating a data structure that stores data that is associated with said key that is not a member-dependent key.