CN1851693A - Method for realizing system resources management - Google Patents
Method for realizing system resources management Download PDFInfo
- Publication number
- CN1851693A CN1851693A CN 200510098777 CN200510098777A CN1851693A CN 1851693 A CN1851693 A CN 1851693A CN 200510098777 CN200510098777 CN 200510098777 CN 200510098777 A CN200510098777 A CN 200510098777A CN 1851693 A CN1851693 A CN 1851693A
- Authority
- CN
- China
- Prior art keywords
- node
- relationship tree
- father
- entity
- virtual objects
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invented method adopts object relationship tree technology, including A, if one father solid object's plurality of sub solid object belonging to different resource group when in establishing object relationship tree, then establishment virtual object node one to one corresponded with each resource group, using virtual object node as father solid object's sub node, using sub solid object belonging to same resource group as said resource group corresponded virtual object nodal sub node to add to object relationship tree, B, in system resource management, according to the parent-child relationship between virtual object node and solid object node, finding solid object node belonging to same resource group, to make operation. The present invention can reduce correlation between processing program code and specific solid object, convenient systematical maintenance and expansion.
Description
Technical field
The present invention relates to a kind of implementation method that adopts object relationship tree technology that system resource is managed.
Background technology
At present,, adopt object relationship tree technology usually, the resource of this system is managed comprising the large scale system of more equipment.For example: communication system just adopts object relationship tree technology to carry out the management of system resource.
Below be example to adopt object relationship tree technology to the method that telecommunication system resources manages, prior art is described.
Adopt object relationship tree technology that telecommunication system resources is managed, at first set up the object relationship tree, by operation, realize telecommunication system resources is managed then the object relationship tree according to the set membership tabulation of each entity object of telecommunication system resources.
Referring to Fig. 1, Fig. 1 sets up the processing flow chart of a simple object relational tree for prior art.This flow process may further comprise the steps:
Operation by to object relationship tree realizes the management to telecommunication system resources, mainly comprises: the node to the object relationship tree is searched, the operation of knot removal, node increase etc.
The node of object relationship tree is searched: can take to search according to the algorithm of breadth-first, also can take to search according to the algorithm of depth-first, also can adopt the method for setting up index to search.
The knot removal of object relationship tree is fairly simple: be exactly to find this node earlier, then with its deletion, if deletion is the father node that has child node, then delete all child nodes of this father node earlier, delete this father node again; If deletion is child node, then directly deletion gets final product.
The node of object relationship tree increases: revise the set membership tabulation of entity object earlier, again according to the set membership of this tabulation, find father's entity object node of this increase node, this node is joined on the object relationship tree.
At present, adopt object relationship tree technology, be subjected to object relationship tree technology limitation the method that system resource manages.
Suppose that the set membership tabulation of each entity object of telecommunication system resources is as shown in table 1,
| Parent object | Subobject |
| A | A1 |
| A | A2 |
| A1 | a11 |
| A1 | a12 |
| A1 | a13 |
| A1 | a14 |
| A1 | a15 |
| A1 | a16 |
| A2 | a21 |
| A2 | a22 |
| A2 | a23 |
Table 1
Then the object relationship of setting up according to this tabulation is set as shown in Figure 2, the object relationship tree synoptic diagram that Fig. 2 sets up for adopting flow process shown in Figure 1.
Suppose wherein A sign base station system resource, A1 represents the base station down resource, and by a11～a16 identified entities object, wherein a1～a3 constitutes one group of resource pool, and a4～a6 constitutes another group resource pool.A2 represents the base station ascending resource, and by a22～a23 identified entities object, a22～a23 belongs to same resource pool.
In one group of resource pool such as a1～a3, as long as available resources when being not less than to provisioning request (being assumed to be 2), even so wherein any one is bad, do not influence the operate as normal of whole resource pool group.Just unclear this point that embodies of above-mentioned resource object relational tree, thus need in handling code, come " realization " this logic of class.
That is to say that the resource object relational tree has only embodied the relation between a part of entity object, another part relation is closed as the group of resource pool in the processing procedure of the program that ties up to and is realized, causes and expresses the information distribution that concerns between the resource object at several places.Like this, if when system resource object and object relationship change, then not only need to revise the object relationship tree, also need to remodify program code, the resource object relation when being not easy to system maintenance or expansion is adjusted and change; And handler code and concrete entity object be closely related, and therefore is not easy to the maintenance and expansion of system.
In addition, when reality realizes,, object tree node fan-out degree is generally done a general agreement often for the convenience on realizing.This scheme is often only selected the fan-out degree of the node of fan-out degree maximum as this agreement.At top example, hypothesis considers that other node fan-out degree is generally 2～3 simultaneously, and this scheme just can only be selected the 6 fan-out degree as this agreement.Because general object relationship tree all is stored in the internal memory, it for the fan-out degree 2～3 node, must just waste a part of memory headroom, for example among Fig. 2, the fan-out width of supposing A2 is exactly 3, also can only reserve the memory headroom of 6 child nodes of storage to A2, obviously waste resource.
Summary of the invention
In view of this, fundamental purpose of the present invention is to provide a kind of implementation method that system resource is managed, and uses the correlativity that this method can reduce handling procedure and entity object, makes things convenient for the maintenance and expansion of system.
For achieving the above object, technical scheme of the present invention specifically is achieved in that
A kind of implementation method that system resource is managed adopts object relationship tree technology, 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.
Among the present invention, 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.
This method may further include: 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.
This method can further include: 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.
The described method that the fructification Object node is joined in the object relationship tree can comprise:
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.
This method can further include: 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.
This method can further include: 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.
If the object relationship tree is carried out the knot removal operation, then can comprise 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.
Described method of searching Object node can for: take to search, or take to search, or adopt the method for setting up index to search according to the algorithm of depth-first according to the algorithm of breadth-first.
As seen from the above technical solutions, this implementation method that system resource is managed of the present invention, when setting up the object relationship tree, increase the virtual objects node of the relation of the group between each equipment in the embodiment system, when carrying out system resource management, set the set membership that goes up virtual objects node and entity object node according to object relationship, find the entity object node that belongs to same resource group, operate.Like this,, then only need to revise the object relationship tree, do not need to remodify program code, reduced the correlativity of handler code and concrete entity object, made things convenient for the maintenance and expansion of system if when system resource object and object relationship change.
In addition, the present invention can also be when setting up object relationship tree and increasing new node, by increasing the shadow object node, solves the problem that memory headroom that fixing fan-out width brings is wasted.
Description of drawings
Fig. 1 sets up the processing flow chart of a simple object relational tree for prior art;
The object relationship tree synoptic diagram that Fig. 2 sets up for adopting flow process shown in Figure 1;
Fig. 3 sets up the processing flow chart of object relationship tree for the present invention's first preferred embodiment;
Fig. 4 shows the object relationship tree synoptic diagram that flow process is set up for adopting Fig. 3;
Fig. 5 is for deleting the processing flow chart of Object node to object relationship data shown in Figure 3.
Fig. 6 is for increasing the processing flow chart of Object node on the object relationship tree in the present invention's second preferred embodiment;
The object relationship tree synoptic diagram that Fig. 7 sets up for adopting Fig. 3 and flow process shown in Figure 6.
Embodiment
For making purpose of the present invention, technical scheme and advantage clearer, below with reference to the accompanying drawing embodiment that develops simultaneously, the present invention is described in more detail.
This implementation method that system resource is managed of the present invention, when setting up the object relationship tree, increase the virtual objects node of the relation of the group between each equipment in the embodiment system, carry out system resource management when operation, determining the group relation between the entity object node of each equipment according to the virtual objects node.
Below lift two in the preferred embodiment that telecommunication system resources is managed the present invention is described in detail.
First preferred embodiment:
In the present embodiment, stored telecommunication system resources each tabulation of entity object set membership and group of objects relation table in advance, set up the object relationship tree according to these two tables.Below the corresponding node in the object relationship tree of the entity object in the entity object set membership tabulation is called the entity object node.
Referring to Fig. 3, Fig. 3 sets up the processing flow chart of object relationship tree for the present invention's first preferred embodiment.This flow process may further comprise the steps:
Step 301 reads a list item of entity object set membership tabulation.
Step 302 judges that whether the father's entity object node in this list item is set up on the object relationship tree, if execution in step 303 then; Otherwise execution in step 304.
Step 304 on the object relationship tree, is created this father's entity object node.
Step 306 is judged on the object relationship tree, whether has set up the virtual objects node of this group, if then execution in step 308; Otherwise execution in step 307.
In the present embodiment,, in nodal information, add mark, judge whether to be the virtual objects node according to this mark in order to distinguish virtual objects node and entity object node.
Generally include 3 category informations in the nodal information:
(1) essential information of Object node; Basic fixed position parameter as Object node;
(2) status information of Object node; Be used to portray the status information of Object node;
(3) the node relationships information of Object node embodies the fundamental relation between the node;
The 1st category information is the key message that this node is different from other Object node in the object relationship tree concerning given Object node, therefore can not on-the-fly modify these information, in case promptly these information initialization are finished, just can not be modified again; The 3rd category information generally safeguarded according to certain rule by Object node self, its embodiment be relation between objects information;
The 2nd category information, reflection be some states in the Object node operational process, these information change along with the variation of object s own situation; Also depend on simultaneously the 3rd top category information, for example when not satisfying, the corresponding state of its direct father node can be set thus when " group relation ".
For entity object node, virtual objects node, in information processing, there is not any difference between the two.
Be sign of special increase in nodal information in the present embodiment, show the Object node type.For example the sign value is corresponding respectively in node: 0-entity object node type; 1-virtual objects node type.
Step 308 is determined the father node of this virtual objects node for the fructification Object node in this list item, sets up set membership, the fructification Object node is joined in the object relationship tree execution in step 310.
Step 309 determines that the father's entity object node in this list item is with the father node of the fructification Object node in this list item, sets up set membership, and the fructification Object node is joined in the object relationship tree.
Step 310 judges whether that all list items have all read, if then the object relationship tree is set up and finishes process ends; Otherwise return step 301, read next list item.
Suppose that the set membership tabulation of each entity object of telecommunication system resources is as shown in table 2, the group of objects relation table is as shown in table 3.In the present embodiment, when the set membership tabulation of setting up entity object, according to seniority in the family order, the list item of the father node that the seniority in the family is high is arranged on the front of tabulation.For example: the relation of supposing A-a1-@ is that A is the father node of a1, and a1 is the father node of @, when setting up the set membership form, the set membership of A-a1 is arranged on before a1-@.Like this, in the process of setting up tree, the object relationship tree just can not occur @ need being added, when setting up the set membership of a1-@, the set membership of A-a1 does not also have the situation of foundation.
| Parent object | Subobject |
| A | a1 |
| A | a2 |
| A | a3 |
| A | a4 |
| A | a5 |
| A | a6 |
Table 2
| Group number | Object |
| G1 | a1 |
| G1 | a2 |
| G1 | a3 |
| G2 | a4 |
| G2 | a5 |
| G2 | a6 |
Table 3
Then the object relationship of setting up according to above-mentioned two tables is set as shown in Figure 4, the object relationship tree synoptic diagram that Fig. 4 sets up for adopting flow process shown in Figure 3.Wherein, node A1-1 and node A1-2 are exactly the virtual objects node of embodiment group relation.
Same as the prior art to the node search operation that has increased the object relationship tree behind the virtual objects node, can take to search according to the algorithm of breadth-first, also can take to search, also can adopt the method for setting up index to search according to the algorithm of depth-first.
In actual applications, suppose that certain entity device in certain group is out of order, need finish the function of this entity device with other entity devices of same group, then need to find and belong to same group entity object node with the faulty equipment Object node and operation such as be configured.
If use the method for prior art, need complicated program code to realize.And application the inventive method just is easy to realize, only need find the Object node of faulty equipment earlier, finds its father node again, if this father node is the virtual objects node, then finds other an entity object child node of this virtual objects node to get final product.
The operation of the knot removal of object relationship tree has some improvement, and referring to Fig. 5, Fig. 5 is for deleting the processing flow chart of Object node to object relationship data shown in Figure 3.This flow process may further comprise the steps:
Step 501 finds the Object node that will delete.
This step is the same with prior art, if deletion is the father node that has child node, then deletes all child nodes of this father node earlier, deletes this father node again; If deletion is child node, then directly deletion gets final product.
Step 503 judges whether the father node of deleted node is the virtual objects node, if execution in step 504 then; Otherwise finish this deletion action.
Step 505 as treating deletion of node, returns this virtual objects node to step 502.
The node of object relationship tree increases: revise the set membership tabulation of entity object earlier, if the node that increases newly belongs to certain group, then revise the group of objects relation table simultaneously, set membership and group according to this tabulation concerns again, find the father node of this increase node, with reference to the flow process of setting up the object relationship tree shown in Figure 3, this node is joined on the object relationship tree.
Second preferred embodiment:
In the present embodiment,, in the object relationship tree, except increasing the virtual objects node, also increase the shadow object node in order to solve the problem of fan-out restricted width.
In setting up object relationship tree process,, can increase the shadow object node according to fan-out width needs; Equally, after the object relationship tree is set up well, when needing to increase new entity object node,, also can increase the shadow object node according to fan-out width needs.
Present embodiment is the improvement to first preferred embodiment.Specifically, be exactly in the step 308 and step 309 in flow process shown in Figure 3, determine the father node of the child node that will increase after, child node joined the object relationship tree before, increased the processing that whether increases the shadow object node.Detailed process is referring to Fig. 6, and Fig. 6 is for increasing the processing flow chart of Object node on the object relationship tree in the present invention's second preferred embodiment.This flow process comprises following:
Step 602 judges whether the fan-out width of this father node has reached predetermined limits k; If execution in step 604 then; Otherwise execution in step 603.
The fan-out width of father node is exactly the number of the child node of this father node.
Step 603 is determined the father node of this father node for the Object node that will increase, and sets up set membership, and Object node is joined in the object relationship tree, finishes to add operation.
Step 604 joins this father node in the breadth first traversal formation.This formation is a First Input First Output.
In the present embodiment, adopt the ergodic algorithm of breadth-first, the traversal child node.This algorithm is a kind of traversal method commonly used, and present embodiment is carried out according to this algorithm, is not described in detail this algorithm here.
Step 605 is taken out first Object node in the formation, adopts the ergodic algorithm of breadth-first to travel through its child node.
Step 606 judges whether to find the shadow object node of a fan-out width＜k, if execution in step 607 then; Otherwise execution in step 608.
Also can in nodal information, increase a sign specially in the present embodiment, show the Object node type.For example the sign value is corresponding respectively in node:
0-entity object node type;
1-virtual objects node type;
2-shadow object node type.
In addition, can also take sectional method to the Object node type number.The size of each section is not arranged, and the actual capabilities usage ratio of each section is distributed according to expectation.For example, adopting the 32bit data to characterize style number, entity object node, virtual objects node, shadow object node usage ratio according to expectation are 4: 2: 2.Considering extensibility, is that all numberings of 1 keep earlier with most significant digit, can carry out following distribution:
0xFFFFFFF0～0xFFFFFFFF system is used for specifically defined
0x80FFFFFF～0xFFFFFFEF keeps
0x60FFFFFF～0x7FFFFFEF is used for the distribution of shadow object node
0x40FFFFFF～0x5FFFFFEF is used for the distribution of virtual objects node
0x00FFFFFF～0x3FFFFFEF is used for the distribution of entity object node
Certainly, in first preferred embodiment, also can adopt the Object node type number is taked sectional method.
Step 608 judges whether to find an entity object node, if then execution in step 609; Otherwise execution in step 610.
Step 609 is created a shadow object node, the entity object node that dismounting step 608 finds and the set membership of father node; With entity object node that finds and the Object node that will add 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.
Step 610 with all child nodes of father node, adds the breadth first traversal formation by the breadth-first algorithm, returns step 605.
Suppose that half frame about the base station ascending resource divides is worked in the resource pool mode in half frame; About 7 resource boards of half frame maximum configured.The set membership tabulation of each entity object is as shown in table 4, and the group of objects relation table is as shown in table 5.
| Parent object | Subobject |
| 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 number | 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 restriction object tree width is 4, set as shown in Figure 7 according to the object relationship that the method for present embodiment is set up.The object relationship tree synoptic diagram that Fig. 7 sets up for adopting Fig. 3 and flow process shown in Figure 6.
In the node of Fig. 7, A represents ascending resource; A1, B1 is corresponding virtual objects node respectively, respectively the ascending resource of half frame about the expression; A2, B2 is corresponding shadow object node respectively.
With a left side half frame is example, and the algorithm that adds A1 is referring to introducing the virtual objects algorithm of nodes; Add a1～a7 Object node according to shadow object node algorithm subsequently, addition sequence is:
1, adds a1～a4;
Find restricted width when 2, adding a5,, find a1 and separate it and the set membership of A1, add A2 shadow object node, set up the set membership of a1, a5 and A2 according to shadow object node algorithm;
3, add a6, a7 node.
Identical to the node search operation that has increased the object relationship tree behind virtual objects node, the shadow object node with first preferred embodiment, no longer repeat specification here.
The operation and the flow process shown in Figure 5 of the knot removal of object relationship tree are basic identical, just in step 503, not only need to judge whether to handle equally for the subsequent treatment and the virtual objects node of shadow object node for the virtual objects node also will judge whether to be the shadow object node.
The node of object relationship tree increases: revise the set membership tabulation of entity object earlier, if the node that increases newly belongs to certain group, then revise the group of objects relation table simultaneously, set membership and group according to this tabulation concerns again, find the father node of this increase node, with reference to Fig. 3 and flow process shown in Figure 6, this node is joined on the object relationship tree.
By the above embodiments as seen, this implementation method that system resource is managed of the present invention has reduced the correlativity of handler code and concrete entity object, has made things convenient for the maintenance and expansion of system.In addition, the present invention can also be when setting up object relationship tree and increasing new node, by increasing the shadow object node, solves the problem that memory headroom that fixing fan-out width brings is wasted.
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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100987777A CN100383788C (en) | 2005-09-07 | 2005-09-07 | Method for realizing system resources management |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100987777A CN100383788C (en) | 2005-09-07 | 2005-09-07 | Method for realizing system resources management |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1851693A true CN1851693A (en) | 2006-10-25 |
| CN100383788C CN100383788C (en) | 2008-04-23 |
Family
ID=37133172
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100987777A Expired - Fee Related CN100383788C (en) | 2005-09-07 | 2005-09-07 | Method for realizing system resources management |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100383788C (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100383789C (en) * | 2005-09-07 | 2008-04-23 | 华为技术有限公司 | Method for realizing system resources management |
| CN101217763B (en) * | 2008-01-15 | 2011-11-30 | 中兴通讯股份有限公司 | An expanding device and method from logic tree to physical tree in fault analysis |
| CN103092889A (en) * | 2011-11-07 | 2013-05-08 | 阿里巴巴集团控股有限公司 | Determining method of entity object and establishing method and device of condition node tree |
| CN103186568A (en) * | 2011-12-28 | 2013-07-03 | 金蝶软件（中国）有限公司 | Method and system for accessing tree-structured data |
| WO2013190562A1 (en) * | 2012-06-22 | 2013-12-27 | Hewlett-Packard Development Company, L.P. | Optimal assignment of virtual machines and virtual disks using multiary tree |
| CN104217309A (en) * | 2014-09-25 | 2014-12-17 | 中国人民解放军信息工程大学 | Method and device for managing information objects of system resources |
| CN104901328A (en) * | 2015-05-21 | 2015-09-09 | 北京四方继保自动化股份有限公司 | Multi-terminal flexible DC control mode automatic identification method based on complex control network |
| CN102243660B (en) * | 2011-07-18 | 2017-07-07 | 中兴通讯股份有限公司 | A kind of data access method and equipment |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US12086261B2 (en) * | 2020-03-13 | 2024-09-10 | International Business Machines Corporation | Displaying cyber threat data in a narrative-like format |
| US11503047B2 (en) | 2020-03-13 | 2022-11-15 | International Business Machines Corporation | Relationship-based conversion of cyber threat data into a narrative-like format |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7743074B1 (en) * | 2000-04-05 | 2010-06-22 | Microsoft Corporation | Context aware systems and methods utilizing hierarchical tree structures |
| US20020091819A1 (en) * | 2001-01-05 | 2002-07-11 | Daniel Melchione | System and method for configuring computer applications and devices using inheritance |
| CN100383789C (en) * | 2005-09-07 | 2008-04-23 | 华为技术有限公司 | Method for realizing system resources management |
-
2005
- 2005-09-07 CN CNB2005100987777A patent/CN100383788C/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100383789C (en) * | 2005-09-07 | 2008-04-23 | 华为技术有限公司 | Method for realizing system resources management |
| CN101217763B (en) * | 2008-01-15 | 2011-11-30 | 中兴通讯股份有限公司 | An expanding device and method from logic tree to physical tree in fault analysis |
| CN102243660B (en) * | 2011-07-18 | 2017-07-07 | 中兴通讯股份有限公司 | A kind of data access method and equipment |
| CN103092889A (en) * | 2011-11-07 | 2013-05-08 | 阿里巴巴集团控股有限公司 | Determining method of entity object and establishing method and device of condition node tree |
| CN103092889B (en) * | 2011-11-07 | 2016-01-06 | 阿里巴巴集团控股有限公司 | The defining method of entity object, the method for building up of condition node tree and device |
| CN103186568A (en) * | 2011-12-28 | 2013-07-03 | 金蝶软件（中国）有限公司 | Method and system for accessing tree-structured data |
| WO2013190562A1 (en) * | 2012-06-22 | 2013-12-27 | Hewlett-Packard Development Company, L.P. | Optimal assignment of virtual machines and virtual disks using multiary tree |
| CN104604187A (en) * | 2012-06-22 | 2015-05-06 | 惠普发展公司，有限责任合伙企业 | Optimal assignment of virtual machines and virtual disks using multiary tree |
| CN104217309A (en) * | 2014-09-25 | 2014-12-17 | 中国人民解放军信息工程大学 | Method and device for managing information objects of system resources |
| CN104901328A (en) * | 2015-05-21 | 2015-09-09 | 北京四方继保自动化股份有限公司 | Multi-terminal flexible DC control mode automatic identification method based on complex control network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100383788C (en) | 2008-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1851693A (en) | Method for realizing system resources management | |
| CN1115644C (en) | Method of implementing an acyclic directed graph structure using a relational database | |
| CN101047556A (en) | Integral maintaining method and system for multi-equipment | |
| CN1917504A (en) | Method for preventing deadlock caused by accessing shared data of resources | |
| CN1866250A (en) | Method and system for managing system data | |
| CN1229944A (en) | System and method for reducing footprint of preloaded classes | |
| CN1946075A (en) | Method and system to determine a user specific relevance score of a message within a messaging system | |
| CN1866252A (en) | Method and system for transformation between different version configuration data | |
| CN101038640A (en) | Worksheets priority level administration method and system, and worksheets process method and system | |
| CN1949221A (en) | Method and system of storing element and method and system of searching element | |
| CN1975772A (en) | Method and device for integrating information in multi-system | |
| CN1848111A (en) | Realizing method of a data operating interface used in internal-memory database | |
| CN1852261A (en) | Method for maintenance of neighbor entry | |
| CN1866219A (en) | System and method for testing measured object based on automatic test script | |
| CN1731401A (en) | A method of feature selection based on mixed mutual information in data mining | |
| CN1851694A (en) | Method for realizing system resources management | |
| CN1901467A (en) | Method and system for quick processing warning | |
| CN1677932A (en) | Network management configuration method and apparatus thereof | |
| CN1725707A (en) | Method for managing distribution network equipment | |
| CN1719769A (en) | Method for classifying received data pocket in network apparatus | |
| CN1862534A (en) | Method for managing and maintaining tatic range matching table | |
| CN1878123A (en) | Bit-map aggregated recursive stream sorting method and its system | |
| CN1863085A (en) | Method and system for ensuring network managment and element configuration data consistency | |
| CN1753389A (en) | Method of real time soft seizing wave length route photo network | |
| CN1905727A (en) | Method for network managing resource message access |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080423 Termination date: 20170907 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |