Lookup facility in distributed computer systems

• US 20040168169A1
• Filed: 11/03/2003
• Published: 08/26/2004
• Est. Priority Date: 05/03/2001
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Lutoff, Daniel, Perrot, Vincent, Ebro, Christophe
• Granted Patent: US 7,346,899 B2
• Time in Patent Office: Days
• US Class Current: 717/172
• CPC Class Codes: G06F 2209/462 Lookup
• CPC Class Codes: G06F 9/4493 Object persistence
• CPC Class Codes: G06F 9/465 Distributed object oriented systems remote method invocation [RMI] G06F9/548

Abstract

In an embodiment of the present invention, at a Deployer level, an application software component is provided with a tree representation 510 of objects it contains. An object is a leaf node, with the attributes of the object being in nexus between the root and the leaf node. An accessor object 511 has methods to access the tree 510. In one embodiment of the present invention, at an administrator level, a handler object 611 in turn accesses accessor object 511. Handler object 611 may be part of a handler home object 619. Client applications 710 have lookup services 711 to access handler objects like 611, e.g. via a lookup home object 719, and handler home object 619.

Claims

1. A method of aiding deployment in a distributed computer system, using application software components, comprising:

a. providing a tree representation (510) of objects existing in at least one of the application software components, the tree representation including an object as a leaf node, with at least one attribute of the object being in nexus between the root and the leaf node, and

b. providing an accessor object (511), comprising accessor methods to the tree representation, said accessor methods having predefined names and functions.

2. The method of claim 1, wherein:

stage a. comprises providing a tree representation (510) in which at least one of the tree nexus comprises data defining both an attribute name and an attribute value.

3. The method of claim 2, wherein stage b. comprises:

b1. converting the tree representation (510) into at least one set of data (E2-8;

E2-9) connecting an attribute with a corresponding location in the tree, and

b2. storing at least one set of data or a designation thereof in the accessor object (511).

4. The method of claim 3, wherein stage b1. comprises converting the tree representation into a set of data (E2-8) connecting an attribute name with a corresponding location in the tree.

5. The method of claim 3, wherein stage b1. comprises converting the tree representation into a set of data (E2-9) connecting an attribute value with a corresponding location in the tree.

6. The method of claim 4, wherein stage b1. comprises converting the tree representation into a set of data (E2-9) connecting an attribute value with a corresponding location in the tree.

7. The method as claimed in any of claim 1, wherein the attributes are arranged in the tree in accordance with a predefined order.

8. The method as claimed in any of claim 1, wherein stage b. comprises providing a plurality of accessor objects (511,521), with each accessor object comprising a domain identification, being readable through at least one (M1) of the accessor methods.

9. The method of claim 8, wherein at least two of the accessor objects (511,521) access different sub-trees in the tree representation.

10. The method as claimed in any of claim 8, further comprising the step of:

c. providing one or more handler objects (611,612), each accessing at least one of the accessor objects (511,521).

11. The method of claim 10, wherein stage c. comprises:

c1. configuring the handler objects (611,612) to access accessor objects (511,521) corresponding to application software components being currently in service in the distributed computer system.

12. The method of claim 11, wherein stage c1. uses attributes of the application software components.

13. The method of claim 10, further comprising the stage of:

d. in at least one client software application, providing a lookup service (711), adapted to communicate with at least one handler object (612).

14. The method as claimed in any of claim 1, wherein said accessor methods of stage b. comprise a method to retrieve supported attribute names.

15. The method as claimed in any of claim 1, wherein said accessor methods of stage b. comprise a method for exact search in the tree representation.

16. The method as claimed in any of claim 1, wherein said accessor methods of stage b. comprise a method for near search in the tree representation.

17. The method as claimed in any of claim 1, wherein said accessor methods of stage b. comprise a method capable of navigating up in the tree to find a leaf node.

20. The article of claim 17, wherein the accessor object (511) has a predefined name.

21. The article of claim 17 further comprising:

a second tree access code, adapted to access the first tree access code.

22. The article of claim 21, wherein said second tree access code comprises a handler object (612).

23. The article of claim 21 further comprising:

a third code for incorporation in at least one client software application, said third code providing a lookup service (711), adapted to communicate with the second tree access code.

18. An article of manufacture for reorganizing data in an original log file, the article comprising:

data defining a tree representation (510) of objects existing in at least one application software component, the tree representation including an object as a leaf node, with the attributes of the object being in nexus between the root and the leaf node, and

first tree access code (511) attaching accessor methods to the tree representation, said accessor methods having predefined names and functions.

19. The article of claim 18, wherein said first tree access code comprises an accessor object (511), comprising the accessor methods.