CN1851693A - Method for realizing system resources management - Google Patents

Abstract

The invention discloses a method for realizing the management of system resources, adopting the object relational tree technology, including the following steps: A. When establishing the object relational tree, if multiple child entity objects of a parent entity object belong to different resource groups, then Create a virtual object node corresponding to each resource group one by one, use the virtual object node as the child node of the parent entity object node, and use the child entity object node belonging to the same resource group as the child node of the virtual object node corresponding to the resource group , added to the object relational tree; B. When performing system resource management, according to the parent-child relationship between the virtual object node and the physical object node on the object relational tree, the physical object node belonging to the same resource group is found and operated. By applying the method of the invention, the correlation between processing program codes and specific entity objects can be reduced, and system maintenance and expansion are facilitated.

Description

A Realization Method of System Resource Management

technical field

The invention relates to a realization method for managing system resources by adopting object relational tree technology.

Background technique

At present, for a large-scale system containing many devices, the object relational tree technology is usually used to manage the resources of the system. For example: the communication system uses the object relational tree technology to manage the system resources.

The prior art will be described below by taking a method for managing communication system resources using the object relational tree technology as an example.

The communication system resources are managed by using the object relationship tree technology. Firstly, the object relationship tree is established according to the parent-child relationship list of each entity object of the communication system resources, and then the communication system resources are managed through the operation of the object relationship tree.

Referring to FIG. 1 , FIG. 1 is a flow chart of establishing a simple object relational tree in the prior art. The process includes the following steps:

Step 101, read an entry in the parent-child relationship list of entity objects.

Step 102, judging whether the parent entity object node in the entry has been established on the object relationship tree, if yes, execute step 103; otherwise, execute step 104.

Step 103, locate the parent entity object node on the object relationship tree, and execute step 105.

Step 104, on the object relationship tree, create the parent entity object node.

In step 105, the child entity object node in the entry is used as a child node of the parent entity object node, and a parent-child relationship is established, and added to the object relationship tree.

In step 106, it is judged whether all entries have been read, if yes, the establishment of the object relationship tree is completed, and the process ends; otherwise, return to step 101, and read the next entry.

The management of communication system resources is realized through the operation of the object relational tree, mainly including: the operation of node search, node deletion, node addition, etc. of the object relational tree.

The node search of the object relational tree: it can be searched according to the breadth-first algorithm, it can also be searched according to the depth-first algorithm, and it can also be searched by the method of indexing.

The node deletion of the object relational tree is relatively simple: first find the node, and then delete it. If the parent node with child nodes is deleted, first delete all child nodes of the parent node, and then delete the parent node; If the deletion is a child node, it can be deleted directly.

Adding nodes in the object relationship tree: first modify the parent-child relationship list of the entity object, and then find the parent entity object node of the added node according to the parent-child relationship in the list, and add the node to the object relationship tree.

At present, the method of managing system resources by using the object relational tree technology is limited by the object relational tree technology.

Assume that the parent-child relationship list of each entity object of the communication system resource is shown in Table 1, parent object child object A A1 A A2 A1 a11 A1 a12 A1 a13 A1 a14 A1 a15 A1 a16 A2 a21 A2 a22 A2 a23

Table 1

The object relationship tree established according to the list is shown in FIG. 2 , and FIG. 2 is a schematic diagram of the object relationship tree established by using the process shown in FIG. 1 .

Assume that A identifies base station system resources, A1 represents base station downlink resources, and a11-a16 identify entity objects, wherein a1-a3 constitute a group of resource pools, and a4-a6 constitute another group of resource pools. A2 represents the uplink resources of the base station, and a22-a23 identify entity objects, and a22-a23 belong to the same resource pool.

In a group of resource pools such as a1-a3, as long as the available resources are not less than a given requirement (assumed to be 2), even if any one of them fails, it will not affect the normal work of the entire resource pool group. The above-mentioned resource object relationship tree does not clearly reflect this point, so this kind of logic needs to be "implemented" in the processing code.

That is to say, the resource object relationship tree only reflects the relationship between some entity objects, and another part of the relationship, such as the group relationship of the resource pool, is realized during the processing of the program, causing the information expressing the relationship between resource objects to be distributed in several places. . In this way, if the system resource object and the object relationship change, not only the object relationship tree needs to be modified, but also the program code needs to be re-modified, which is not convenient for the adjustment and change of the resource object relationship during system maintenance or expansion; and the relationship between the program code and the specific entity Objects are closely related, so it is not easy to maintain and expand the system.

In addition, in actual implementation, for the convenience of implementation, a general agreement is generally made on the fan-out degree of object tree nodes. This solution often only selects the node with the largest fanout as the agreed fanout. For the above example, and assuming that the fan-out degree of other nodes is generally 2 to 3, this solution can only choose 6 as the agreed fan-out degree. Since the general object relational tree is stored in memory, for nodes with a fan-out degree of 2 to 3, a part of the memory space must be wasted. For example, in Figure 2, assuming that the fan-out width of A2 is 3, also Only the memory space for storing 6 child nodes can be reserved for A2, which obviously wastes resources.

Contents of the invention

In view of this, the main purpose of the present invention is to provide a method for implementing system resource management, which can reduce the correlation between processing programs and entity objects, and facilitate system maintenance and expansion.

In order to achieve the above object, the technical solution of the present invention is specifically realized in the following way:

A method for implementing management of system resources, using object relational tree technology, comprising the following steps:

A. When building an object relationship tree, if multiple sub-entity objects of a parent entity object belong to different resource groups, create a virtual object node corresponding to each resource group one by one, and use the virtual object node as the parent entity object node Sub-nodes, adding sub-entity object nodes belonging to the same resource group as sub-nodes of virtual object nodes corresponding to the resource group into the object relationship tree;

B. When performing system resource management, according to the parent-child relationship between the virtual object node and the entity object node on the object relationship tree, the entity object node belonging to the same resource group is found and operated.

In the present invention, entity object parent-child relationship list and entity object group relationship table can be stored in advance; said step A includes:

A1. Read an entry in the parent-child relationship list of the entity object, judge whether the parent entity object node in the entry has been established on the object relationship tree, if so, find the parent entity object node on the object relationship tree, and execute step A2; Otherwise, create the parent entity object node on the object relational tree;

A2. Search the entity object group relationship table, and judge whether the child entity object in the parent-child relationship table item of the entity object belongs to a resource group, and if so, perform step A3; otherwise determine the parent entity object node in the parent-child relationship table item of the entity object As the parent node of the sub-entity object node, add the sub-entity object node into the object relationship tree; perform step A5;

A3. Determine whether the virtual object node corresponding to the resource group has been established on the object relational tree, and if so, find the virtual object node and perform step A4; otherwise, create a virtual object node corresponding to the resource group on the object relational tree, and perform step A3. A4;

A4. Determine that the virtual object node is the parent node of the sub-entity object node in the parent-child relationship entry of the entity object, and add the sub-entity object node to the object relationship tree;

A5. Determine whether the entries in the parent-child relationship list of all entity objects have been read. If yes, the object relationship tree is established; otherwise, return to step A1 and read the next entry.

The method may further include: adding a flag to the node information, the flag being a different number in the node information of the entity object node and the virtual object node; judging whether the node in the object relation tree is a virtual object node according to the flag.

The method may further include: dividing the object node type number into sections, each node type corresponds to a different number section; judging the node type according to which number section the type number belongs to between the entity object node and the virtual object node.

The method for adding the sub-entity object node into the object relation tree may include:

a1. Determine whether the fan-out width of the parent node of the sub-entity object node has reached a predetermined limit, and if so, perform step a2; Add to the object relational tree and complete the join operation;

a2. The parent node is added to the breadth-first traversal queue;

a3. Take out the first object node in the queue, use the width-first traversal algorithm to traverse its child nodes, and judge whether to find a shadow object node whose fan-out width is smaller than the predetermined limit, if the child entity object node is used as the shadow object child node, join the object relational tree, and complete the join operation; otherwise, execute step a4;

a4. Judging whether an entity object node is found, if yes, then execute step a5; otherwise, add all child nodes of the parent node to the breadth-first traversal queue according to the breadth-first algorithm, and return to step a3;

a5. Create a shadow object node, remove the parent-child relationship between the found entity object node and the parent node; use the found entity object node as the child node of the shadow object; then use the shadow object node as the child node of the above-mentioned parent node, and establish a relationship with the parent node Parent-child relationship between parent nodes; join the object relational tree to complete the join operation.

The method may further include: adding a sign to the node information, the sign is a different number for the node information of the entity object node, the virtual object node and the shadow object node; judging the node type in the object relational tree according to the sign.

The method may further include: dividing the object node type number into sections, each node type corresponds to a different number section; judging the node type according to which number section the type number belongs to among the entity object node, the virtual object node and the shadow object node.

In step B, if the node deletion operation is performed on the object relational tree, the following steps may be included:

B1, finding the object node to be deleted;

B2. Delete the node from the object relational tree;

B3. Determine whether the parent node of the deleted node is a virtual object node or a shadow object node, and if so, execute step B4; otherwise, end the deletion operation.

B4. After judging whether the virtual object node or shadow object node has child nodes after the object node is deleted, if so, then end the deletion operation, otherwise, use the virtual object node or shadow object node as the node to be deleted, and return to step B2 .

The method for searching the object node may be: searching according to a breadth-first algorithm, or using a depth-first algorithm, or using an indexing method to search.

It can be seen from the above-mentioned technical solution that in the method for realizing the management of system resources in the present invention, when establishing the object relationship tree, virtual object nodes that reflect the group relationship between each device in the system are added, and when system resource management is performed, virtual object nodes are added. According to the parent-child relationship between the virtual object node and the entity object node on the object relational tree, the entity object node belonging to the same resource group is found, and the operation is performed. In this way, if the system resource object and the object relationship change, only the object relation tree needs to be modified, and the program code does not need to be re-modified, which reduces the correlation between the processing program code and the specific entity object, and facilitates the maintenance and expansion of the system.

In addition, the present invention can also solve the problem of waste of memory space caused by the fixed fan-out width by adding shadow object nodes when building an object relation tree and adding new nodes.

Description of drawings

Fig. 1 is the processing flowchart of setting up a simple object relational tree for the prior art;

Fig. 2 is a schematic diagram of an object relationship tree established by adopting the process shown in Fig. 1;

Fig. 3 is the processing flowchart of establishing object relation tree in the first preferred embodiment of the present invention;

Fig. 4 is a schematic diagram of the object relationship tree established by adopting the process shown in Fig. 3;

FIG. 5 is a flowchart of the process of deleting an object node from the object relationship data shown in FIG. 3 .

Fig. 6 is the processing flowchart of adding object nodes on the object relational tree in the second preferred embodiment of the present invention;

FIG. 7 is a schematic diagram of an object relationship tree established by using the processes shown in FIG. 3 and FIG. 6 .

Detailed ways

In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings and examples.

In the method for realizing the management of system resources in the present invention, when establishing the object relationship tree, add virtual object nodes that reflect the group relationship between each device in the system, and when performing system resource management operations, determine according to the virtual object nodes Group relationship between entity object nodes of individual devices.

The present invention will be described in detail below with two preferred embodiments of managing communication system resources.

First preferred embodiment:

In this embodiment, the parent-child relationship list and the object group relationship table of each entity object of the communication system resource are stored in advance, and the object relationship tree is established according to these two tables. Hereinafter, the node corresponding to the entity object in the entity object parent-child relationship list in the object relationship tree is referred to as the entity object node.

Referring to FIG. 3 , FIG. 3 is a flowchart of the process of establishing an object relational tree in the first preferred embodiment of the present invention. The process includes the following steps:

Step 301, read an entry of the entity object parent-child relationship list.

Step 302, judging whether the parent entity object node in the entry has been established on the object relationship tree, if yes, execute step 303; otherwise, execute step 304.

Step 303, locate the parent entity object node on the object relationship tree, and execute step 305.

Step 304, on the object relationship tree, create the parent entity object node.

Step 305 , go to the object group relationship table to find out whether the child object in the parent-child relationship list item of the object belongs to a certain group, if yes, go to step 306 ; otherwise, go to step 309 .

Step 306 , judging whether the virtual object node of the group has been established on the object relationship tree, if yes, execute step 308 ; otherwise, execute step 307 .

In this embodiment, in order to distinguish the virtual object node from the physical object node, a mark is added to the node information, and whether it is a virtual object node is judged according to the mark.

Node information usually includes 3 types of information:

(1) The basic information of the object node; such as the basic positioning parameters of the object node;

(2) The state information of the object node; used to describe the state information of the object node;

(3) The node relationship information of the object node, reflecting the basic relationship between nodes;

For a given object node, the first type of information is the key information that distinguishes this node from other object nodes in the object relational tree, so this information cannot be dynamically modified, that is, once the information is initialized, it cannot be modified; the third Class information is generally maintained by the object node itself according to certain rules, which reflects the relationship information between objects;

The second type of information reflects some states during the operation of the object node, which changes with the change of the object itself; it also depends on the above third type of information, for example, when the "group relationship" is not satisfied, You can thus set the corresponding state of its immediate parent node.

For entity object nodes and virtual object nodes, there is no difference in information processing between the two.

In this embodiment, a flag is specially added in the node information to indicate the object node type. For example, the flag values in the nodes correspond to: 0-entity object node type; 1-virtual object node type.

Step 307, creating a virtual object node of the group on the object relational tree.

Step 308, determine that the virtual object node is the parent node of the child entity object node in the entry, establish a parent-child relationship, add the child entity object node to the object relationship tree, and execute step 310.

Step 309, determine that the parent entity object node in the entry is the parent node of the child entity object node in the entry, establish a parent-child relationship, and add the child entity object node to the object relationship tree.

Step 310, judging whether all entries have been read, if yes, the object relationship tree is established, and the process ends; otherwise, return to step 301, and read the next entry.

It is assumed that the parent-child relationship list of each entity object of the communication system resource is shown in Table 2, and the object group relationship table is shown in Table 3. In this embodiment, when establishing the parent-child relationship list of entity objects, according to the order of seniority, the entry of the parent node with higher seniority is set in front of the list. For example: Suppose the relationship of A-a1-@ is that A is the parent node of a1, and a1 is the parent node of @. When creating the parent-child relationship table, set the parent-child relationship of A-a1 before a1-@. In this way, in the process of building the tree, there will be no need to add @ to the object relationship tree, and when the parent-child relationship of a1-@ is established, the parent-child relationship of A-a1 has not yet been established. parent object child object A a1 A a2 A a3 A a4 A a5 A a6

Table 2 Group No object G1 a1 G1 a2 G1 a3 G2 a4 G2 a5 G2 a6

table 3

Then, the object relationship tree established according to the above two tables is shown in FIG. 4 , and FIG. 4 is a schematic diagram of the object relationship tree established by using the process shown in FIG. 3 . Among them, the node A1-1 and the node A1-2 are virtual object nodes reflecting the group relationship.

The node search operation of the object relationship tree after the virtual object node is added is the same as the prior art, and can be searched according to the breadth-first algorithm, or can be searched according to the depth-first algorithm, or can be searched by the method of indexing find.

In practical applications, assuming that a physical device in a certain group fails, and other physical devices in the same group need to be used to complete the function of the physical device, it is necessary to find the physical object node that belongs to the same group as the faulty device object node to perform configuration etc.

If the method in the prior art is used, more complicated program codes are needed to realize it. And apply the method of the present invention, just be easy to realize, only need first find out the object node of faulty equipment, then find its parent node, if this parent node is a virtual object node, then find another entity object child node of this virtual object node That's it.

There are some improvements in the node deletion operation of the object relational tree, see FIG. 5 , which is a flow chart of deleting object nodes for the object relational data shown in FIG. 3 . The process includes the following steps:

Step 501, find the object node to be deleted.

Step 502, delete the node from the object relational tree.

This step is the same as the prior art. If the deletion is a parent node with child nodes, first delete all child nodes of the parent node, and then delete the parent node; if the deletion is a child node, then delete it directly.

Step 503, judging whether the parent node of the deleted node is a virtual object node, if so, execute step 504; otherwise, end the deletion operation.

Step 504, after the object node is deleted, it is judged whether the virtual object node has other child nodes, if so, the deletion operation is ended, otherwise step 505 is executed.

Step 505, set the virtual object node as a node to be deleted, and return to step 502.

Adding nodes in the object relationship tree: first modify the parent-child relationship list of the entity object, if the newly added node belongs to a certain group, then modify the object group relationship table at the same time, and then find the added node according to the parent-child relationship and group relationship of the list The parent node of the node is added to the object relational tree with reference to the process of establishing the object relational tree shown in FIG. 3 .

Second preferred embodiment:

In this embodiment, in order to solve the problem of limited fan-out width, in the object relational tree, in addition to adding virtual object nodes, shadow object nodes are also added.

In the process of building the object relationship tree, shadow object nodes can be added according to the fan-out width requirements; similarly, after the object relationship tree is established, when new entity object nodes need to be added, shadow objects can also be added according to the fan-out width requirements node.

This embodiment is an improvement on the first preferred embodiment. Specifically, in step 308 and step 309 in the process shown in Figure 3, after determining the parent node of the child node to be added, before adding the child node to the object relational tree, the question of whether to add a shadow object node is added deal with. Refer to FIG. 6 for the specific process. FIG. 6 is a flow chart of adding an object node on the object relational tree in the second preferred embodiment of the present invention. The process includes the following:

Step 601, determine the parent node of the object node to be added.

Step 602, judging whether the fan-out width of the parent node has reached the predetermined limit k; if yes, execute step 604; otherwise, execute step 603.

The fan-out width of a parent node is the number of child nodes of the parent node.

Step 603, determine that the parent node is the parent node of the object node to be added, establish a parent-child relationship, add the object node to the object relationship tree, and complete the adding operation.

Step 604, adding the parent node to the breadth-first traversal queue. The queue is a first-in first-out queue.

In this embodiment, a breadth-first traversal algorithm is used to traverse child nodes. This algorithm is a commonly used traversal method, and this embodiment is implemented according to this algorithm, and the algorithm will not be described in detail here.

Step 605, taking out the first object node in the queue, and traversing its child nodes using a breadth-first traversal algorithm.

Step 606 , judging whether a shadow object node with a fan-out width<k is found, and if yes, execute step 607 ; otherwise, execute step 608 .

In this embodiment, a flag can also be specially added to the node information to indicate the type of the object node. For example, the flag values in the node correspond to:

0 - entity object node type;

1- virtual object node type;

2-Shadow object node type.

In addition, it is also possible to adopt a segmented approach to the object node type number. There is no agreement on the size of each section, and it is allocated according to the estimated actual possible usage ratio of each section. For example, when 32bit data is used to represent the type number, the expected use ratio of entity object nodes, virtual object nodes, and shadow object nodes is 4:2:2. Considering scalability, all numbers with the highest bit of 1 are reserved first, and the following allocation can be performed:

0xFFFFFFF0～0xFFFFFFFF The system is used for special definition

0x80FFFFFF～0xFFFFFFEF reserved

0x60FFFFFF～0x7FFFFEF Used for allocation of shadow object nodes

0x40FFFFFF～0x5FFFFEF Used for the allocation of virtual object nodes

0x00FFFFFF～0x3FFFFFEF for the allocation of entity object nodes

Of course, in the first preferred embodiment, the method of segmenting object node type numbers may also be adopted.

In step 607, the object node to be added is added to the object relational tree as a child node of the shadow object, and the adding operation is completed.

Step 608, judge whether an entity object node is found, if yes, go to step 609; otherwise go to step 610.

Step 609, create a shadow object node, remove the parent-child relationship between the entity object node found in step 608 and the parent node; use the found entity object node and the object node to be added as the child node of the shadow object; then use the shadow object node as the above-mentioned The child node of the parent node establishes a parent-child relationship with the parent node; joins the object relationship tree to complete the join operation.

Step 610, add all child nodes of the parent node to the breadth-first traversal queue according to the breadth-first algorithm, and return to step 605.

Assume that the uplink resources of the base station are divided into left and right half boxes, and the half boxes work in a resource pool mode; the left and right half boxes are configured with a maximum of 7 resource boards. The parent-child relationship list of each entity object is shown in Table 4, and the object group relationship table is shown in Table 5. parent object child object A a1 A a2 A a3 A a4 A a5 A a6 A a7 A b1 A b2 A b3 A b4 A b5 A b6 A b7

Table 4 Group No object G1 a1 G1 a2 G1 a3 G1 a4 G1 a5 G1 a6 G1 a7 G2 b1 G2 b2 G2 b3 G2 b4 G2 b5 G2 b6 G2 b7

table 5

When the width of the restricted object tree is 4, the object relationship tree established according to the method of this embodiment is shown in FIG. 7 . FIG. 7 is a schematic diagram of an object relationship tree established by using the processes shown in FIG. 3 and FIG. 6 .

Among the nodes in FIG. 7 , A represents uplink resources; A1 and B1 respectively correspond to virtual object nodes, respectively representing uplink resources in the left and right half boxes; A2 and B2 respectively correspond to shadow object nodes.

Taking the left half frame as an example, the algorithm for adding A1 refers to the algorithm for introducing virtual object nodes; then add object nodes a1~a7 according to the shadow object node algorithm, and the order of adding is:

1. Add a1~a4;

2. When a5 is added, it is found that the width is limited. According to the shadow object node algorithm, a1 is found and the parent-child relationship with A1 is separated, and the A2 shadow object node is added to establish the parent-child relationship between a1, a5 and A2;

3. Add nodes a6 and a7.

The node search operation for the object relation tree after adding virtual object nodes and shadow object nodes is the same as that of the first preferred embodiment, and will not be repeated here.

The operation of deleting a node in the object relational tree is basically the same as that shown in Figure 5, except that in step 503, it is not only necessary to determine whether it is a virtual object node but also whether it is a shadow object node. Nodes are handled similarly.

Adding nodes in the object relationship tree: first modify the parent-child relationship list of the entity object, if the newly added node belongs to a certain group, then modify the object group relationship table at the same time, and then find the added node according to the parent-child relationship and group relationship of the list The parent node of the node is added to the object relational tree with reference to the processes shown in FIG. 3 and FIG. 6 .

It can be seen from the above embodiments that the implementation method for managing system resources of the present invention reduces the correlation between processing program codes and specific entity objects, and facilitates system maintenance and expansion. In addition, the present invention can also solve the problem of waste of memory space caused by the fixed fan-out width by adding shadow object nodes when building an object relation tree and adding new nodes.

Claims (9)

1, a kind of implementation method that system resource is managed adopts object relationship tree technology, it is characterized in that, may further comprise the steps:

A, setting up object relationship when tree, if a plurality of fructification objects of father's entity object belong to the different resource group, then create respectively and each resource group virtual objects node one to one, with the child node of virtual objects node as father's entity object node, to belong to the child node of the fructification Object node of same resource group, join in the object relationship tree as this resource group corresponding virtual Object node;

B, when carrying out system resource management, go up the set membership of virtual objects node and entity object node according to object relationship tree, find the entity object node that belongs to same resource group, operate.

2, implementation method as claimed in claim 1 is characterized in that: storage entity object set membership tabulation in advance and entity object group relation table; Described steps A comprises:

A1, read the entity object set membership list item of tabulating, judge whether on the object relationship tree, to set up the father's entity object node in this list item, if then find the object relationship tree to go up this father's entity object node, execution in step A2; Otherwise on the object relationship tree, create this father's entity object node;

A2, search entity object group relation table, judge whether the fructification object in this entity object set membership list item belongs to a resource group, if execution in step A3 then; Otherwise determine that the father's entity object node in this entity object set membership list item is the father node of this fructification Object node, this fructification Object node is joined in the object relationship tree; Execution in step A5;

A3, judge whether on the object relationship tree, to set up this resource group corresponding virtual Object node, if then find this virtual objects node execution in step A4; Otherwise on the object relationship tree, create this resource group corresponding virtual Object node, execution in step A4;

A4, determine the father node of this virtual objects node, this fructification Object node is joined in the object relationship tree for the fructification Object node in this entity object set membership list item;

A5, judge whether to have read the list item of all entity object set memberships tabulations, if then the object relationship tree is set up and finishes; Otherwise return steps A 1, read next list item.

3, implementation method as claimed in claim 2 is characterized in that, this method further comprises: increase a sign in nodal information, this is masked as different numerals in the nodal information of entity object node and virtual objects node; Judge according to this sign whether the node in the object relationship tree is the virtual objects node.

4, implementation method as claimed in claim 2 is characterized in that, this method further comprises: divide section to the Object node type number, the corresponding jack per line section not of every kind of node type; Which number section that belongs to entity object node and virtual objects node according to type number is come the decision node type.

5, implementation method as claimed in claim 2 is characterized in that, the described method that the fructification Object node is joined in the object relationship tree comprises:

A1, judge whether the fan-out width of the father node of this fructification Object node has reached predetermined limits, if execution in step a2 then; Otherwise determine that this father node is the father node of this fructification Object node, this fructification Object node is joined in the object relationship tree, finish to add and operate;

A2, this father node join in the breadth first traversal formation;

First Object node in a3, the taking-up formation, adopt the ergodic algorithm of breadth-first to travel through its child node, and judge whether to find the shadow object node of a fan-out width less than predetermined limits, if with the child node of this fructification Object node as this shadow object, add the object relationship tree, finish to add and operate; Otherwise execution in step a4;

A4, judge whether to find an entity object node, if, execution in step a5 then; Otherwise with all child nodes of father node, add the breadth first traversal formation, return step a3 by the breadth-first algorithm;

A5, shadow object node of establishment, the entity object node that dismounting is found and the set membership of father node; With the entity object node that finds child node as shadow object; Again with the child node of shadow object node as above-mentioned father node, set up and this father node between set membership; Add the object relationship tree, finish to add and operate.

6, implementation method as claimed in claim 5 is characterized in that, this method further comprises: increase a sign in nodal information, this is masked as different numerals the nodal information of entity object node, virtual objects node and shadow object node; According to the node type in this sign judgement object relationship tree.

7, implementation method as claimed in claim 5 is characterized in that, this method further comprises: divide section to the Object node type number, the corresponding jack per line section not of every kind of node type; Which number section that belongs to entity object node, virtual objects node and shadow object node according to type number is come the decision node type.

8, implementation method as claimed in claim 5 is characterized in that, if the object relationship tree is carried out the knot removal operation, then comprises following steps among the step B:

B1, find the Object node that to delete;

B2, from object relationship tree this node of deletion;

B3, judge whether the father node of deleted node is virtual objects node or shadow object node, if execution in step B4 then; Otherwise finish this deletion action.

B4, judge the deletion Object node after, whether this virtual objects node or shadow object node also have child node, if, then finish this deletion action, otherwise with this virtual objects node or shadow object node as treating deletion of node, return step B2.

9, implementation method as claimed in claim 8 is characterized in that, described method of searching Object node is: take to search according to the algorithm of breadth-first, or take to search according to the algorithm of depth-first, or adopt the method for setting up index to search.

Images