WO2004079989A1

WO2004079989A1 - Method of managing network management system object

Info

Publication number: WO2004079989A1
Application number: PCT/CN2004/000129
Authority: WO
Inventors: Hongzhi Guo; Guangyu Shi
Original assignee: Huawei Technologies Co., Ltd.
Priority date: 2003-03-03
Filing date: 2004-02-18
Publication date: 2004-09-16
Also published as: CN1527537A

Abstract

The invention discloses a method of managing network management system object, the method includes steps: (1) according to inclusion relation between each object in network management system, establishing object binary tree; (2) defining recursion operator for object binary tree established in step (1), using the recursion operator to traverse the object binary tree, handling and managing each node in the object binary tree. The method of managing network management system object in the invention enhances the space efficiency and function efficiency of management, convenient for impolder´s study and use. Since the implement of the invention is independent of operation system, especially is adapted to opening implement requirement of telecom network management is independent of material system. At the same time, the invention accords requirement and characteristic of telecom network management, implement is easy, capability is steady.

Description

一种对网络管理***对象进行管理的方法技术领域 Method for managing network management system object Technical field

本发明涉及电信管理网的网絡管理技术，特别涉及一种对网络管理 ***对象进行管理的方法。发明背景 The present invention relates to a network management technology of a telecommunication management network, and in particular, to a method for managing a network management system object. Background of the invention

在电信管理网 ( TMN ) 中, 网络管理***的核心是对于被管对象 ( Managed Object, MO )的管理，现在的网络规模越来越大，一个网管中的被管对象的数目可能达到百万量级或者更高，如何对这些对象进行有效管理是一个很大的难题。 . In the telecommunication management network (TMN), the core of the network management system is the management of managed objects (MOs). The current network scale is getting larger and larger, and the number of managed objects in a network management may reach millions. On the order of magnitude or higher, how to effectively manage these objects is a big problem. .

目前，对于网络管理***的大部分管理信息，这里的管理信息就是被管对象的集合，它们都被保存在网络管理***中。而这种保存的方式通常采用关系型数据库，需要开发人员通过各种数据库提供的编程接口，或者基于这些接口之上的开放式数据库互接（ODBC )、 Java数据库连接（JDBC )等方式直接操作数据库中的数据，这样对于当前主流的面向对象设计，如 C + +和 Java对象等，这些面向对象设计和关系数据库的行、列之间存在很大程度上的不匹配，而面向对象的数据库虽然解决了这个问题，却由于性能和稳定性的原因至今在电信网管中很少得到应用。 At present, for most management information of a network management system, the management information here is a collection of managed objects, and they are all stored in the network management system. This storage method usually uses a relational database, which requires developers to operate directly through various database programming interfaces provided by the database, or open database interconnection (ODBC), Java database connection (JDBC) based on these interfaces. The data in the database. For the current mainstream object-oriented designs, such as C ++ and Java objects, there is a large mismatch between the rows and columns of these object-oriented designs and relational databases. Object-oriented databases Although this problem is solved, it is rarely used in telecommunication network management because of performance and stability.

才艮据 X.732协议，电信网络管理***中的 MO以包容关系存在，对应用而言，开发人员看到的是一个包容关系的对象树。参见图 1 , 图 1 为一个筒单的包容关系对象树结构示意图。从上到下，第一个对象，也可以称为父对象在最上面一层，是根节点；第一个对象的子对象在第二层，是才艮节点的子节点；第二层子对象的子对象，也称为第一个对象的孙对象在第三层，是第二层的子节点。举例来说，在电信管理***中，子网 - >网元- >单板，依次就是包容关系。 According to the X.732 protocol, the MO in the telecommunications network management system exists in an inclusive relationship. For applications, developers see an object tree of inclusive relationships. Referring to FIG. 1, FIG. 1 is a schematic diagram of a simple inclusion relationship object tree structure. From top to bottom, the first object, which can also be referred to as the parent object at the top level, is the root node; the child objects of the first object are at the second The layer is a child of the node; the child of the child of the second layer, also called the grandchild of the first object, is the child of the second layer. For example, in the telecommunications management system, subnet-> network element-> single board, in order, is the tolerance relationship.

现有^ f支术中网络管理***对被管对象的处理方法有以下两种： There are currently two methods for the network management system to process the managed objects in the current operation:

1 )直接面向关系型数据库中一个个数据库记录编程，这种方式没有使用对象的概念, 造成应用逻辑与数据库层紧密绑定，扩展性很差, 对开发人员的开发技能要求比较高，开发效率比较低； 1) Directly programming one-by-one database records in a relational database. This method does not use the concept of objects, which causes the application logic to be tightly bound to the database layer and has poor scalability. It requires high development skills and development efficiency for developers. Relatively low

2 )面向对象编程，但是对象之间的包容关系 , 是通过在父对象内部直接包含子对象的方法来实现的，例如：在网元对象中包含单板对象，这种方式不具备通用性和灵活性，可管理性比较差，并且对一个对象的访问需要从最高层的对象一个个开始定位，运行效率比较低；同时因为子对象中必须保存一些父对象的定位信息，否则无法从一个子对象定位到父对象，所以在对象层次比较深的时候，占用的内存空间也会比较大。 2) Object-oriented programming, but the containment relationship between objects is achieved by directly including child objects inside the parent object. For example: Including single board objects in the network element object, this method does not have universality and Flexibility, poor manageability, and access to an object needs to be located from the highest-level object one by one, and the operation efficiency is relatively low; at the same time, the child object must save the positioning information of some parent objects, otherwise it is impossible to start from a child The object is positioned to the parent object, so when the object level is deeper, the memory space occupied will be larger.

因此，现有技术对 MO的管理比较复杂，空间效率和运行效率都不理想。发明内容 Therefore, the management of MO in the prior art is complicated, and the space efficiency and operation efficiency are not ideal. Summary of the Invention

有鉴于此，本发明的目的在于提供一种对网络管理***对象进行管理的方法，该方法能够简化 MO的管理，提高空间效率和运行效率。 In view of this, an object of the present invention is to provide a method for managing a network management system object, which can simplify management of a MO and improve space efficiency and operation efficiency.

为达到上述目的，本发明的技术方案具体是这样实现的: To achieve the above object, the technical solution of the present invention is specifically implemented as follows:

一种对网络管理***对象进行管理的方法，该方法包括以下步骤: 1 )根据网络管理***中每个对象之间的包容关系，建立对象二叉树； 2 )为步骤 1 )建立的对象二叉树定义迭代算子，通过该迭代算子遍历该对象二叉树 , 对对象二叉树上的各个对象进行操作管理。 A method for managing a network management system object, the method includes the following steps: 1) establishing an object binary tree according to the containment relationship between each object in the network management system; 2) defining an iteration of the object binary tree established in step 1) The operator traverses the object binary tree through the iterative operator, and performs operation management on each object on the object binary tree.

步骤 1 )所述的建立对象二叉树的过程可以为： 11 )将包容关系中的第一个对象作为对象二叉树的根节点； The process of establishing an object binary tree as described in step 1) may be: 11) Use the first object in the containment relationship as the root node of the object binary tree;

12 )根据网络管理***对象包容关系，对包容关系中从上至下的每一个对象，将当前对象的子对象从左到右逐个添加到对象二叉树上，第一个子对象作为当前对象的左节点，其它子对象依次作为前一个子对象的右节点。 12) According to the object containment relationship of the network management system, for each object in the containment relationship, the child objects of the current object are added to the object binary tree one by one from left to right, and the first child object is used as the left of the current object. Node, and other child objects in turn serve as the right node of the previous child object.

步骤 1 )可以进一步包括为对象二叉树上的每个对象设置一个与该对象——对应的对象标识号，同时建立包含对象名称和对象标识号的对象标识号索引表。 Step 1) may further include setting an object identification number corresponding to the object-for each object on the object binary tree, and establishing an object identification number index table including the object name and the object identification number.

该方法可以进一步包括，在***中设置对象工厂实体，该方法添加新对象的过程可以为： The method may further include setting an object factory entity in the system, and the process of adding a new object by this method may be:

A、由用户指定新对象的对象类型和父对象； A. The user specifies the object type and parent object of the new object;

B、对象工厂实体创建一个该对象类型的新对象； B. The object factory entity creates a new object of the object type;

C、为该新对象分配一个对象标识号并添加到对象标识号索引表中； C. Assign an object identification number to the new object and add it to the object identification number index table;

D、将该新对象根据包容关系***到对象二叉树上。 D. Insert the new object into the object binary tree according to the containment relationship.

该方法中访问对象的过程可以进一步包括：如果没有得到要访问对象的对象标识号，则根据要访问对象的类型和特征信息，到对象二叉树上查找该要访问的对象; 如果已经得到要访问对象的对象标识号，则根据该对象标识号，通过索引表查找到对象二叉树上该对象标识号对应的对象。 The method of accessing the object in the method may further include: if the object identification number of the object to be accessed is not obtained, then searching the object binary tree according to the type and characteristic information of the object to be accessed; if the object to be accessed has been obtained According to the object identification number, the object corresponding to the object identification number on the object binary tree is found through an index table according to the object identification number.

该方法可以进一步包括删除对象的过程为：先在对象二叉树上查找到该对象；判断其是否有子对象，如果有则使用迭代算子遍历其子对象 , 将其所有子对象删除后, 再删除该对象; 如果没有子对象，则直接将该对象删除。 The method may further include a process of deleting an object: firstly finding the object on the object binary tree; judging whether it has child objects, and if so, using an iteration operator to traverse its child objects, deleting all its child objects, and then deleting The object; if there are no child objects, delete the object directly.

该方法可以进一步包括，删除对象时，删除其在对象标识号索引表中的信息，并回收被删除对象的对象标识号。该方法可以进一步包括，通过迭代算子，得到被访对象的下一个子对象的信息，和该子对象是否为最后一个对象的信息。 The method may further include deleting the information in the object identification number index table when the object is deleted, and recovering the object identification number of the deleted object. The method may further include, by iterating an operator, obtaining information about a next sub-object of the visited object, and information about whether the sub-object is the last object.

该方法步驟 2 )所述的迭代算子，可以按照标准模板库（STL )中迭代算子的定义和使用方法来定义和使用。 The iterative operator described in step 2) of the method may be defined and used according to the definition and use method of the iterative operator in the Standard Template Library (STL).

由上述的技术方案可见，本发明的这种对网络管理***对象进行管理的方法，建立了对象二叉数，并为该二叉树定义了迭代算子，将对网络管理***对象的管理，筒化为对该二叉树的操作管理。因此，能够提高管理的空间效率和运行效率，便于开发人员的学***台无关的开放性实现的要求。同时，本发明完全吻合电信网管的需求和特点，实现简单，性能稳定。附图简要说明 As can be seen from the above technical solution, the method for managing a network management system object of the present invention establishes a binary number of objects, and defines an iterative operator for the binary tree, which will simplify the management of the network management system object. Manage for the operation of the binary tree. Therefore, the space efficiency and operation efficiency of management can be improved, and it is convenient for developers to learn and use. Since the implementation of the present invention is independent of the operating system, it is particularly suitable for the requirements of open implementation that are independent of the telecommunications network management and specific platforms. At the same time, the present invention completely meets the needs and characteristics of telecommunication network management, and is simple to implement and stable in performance. Brief description of the drawings

图 1为一个简单的包容关系对象树结构示意图； Figure 1 is a schematic diagram of a simple containment relationship object tree structure;

图 2为本发明根据图 1所示包容关系建立的对象二叉树结构示意图；图 3为本发明添加新对象流程图； FIG. 2 is a schematic diagram of an object binary tree structure established according to the containment relationship shown in FIG. 1 according to the present invention; FIG. 3 is a flowchart of adding a new object according to the present invention;

图 4为本发明访问对象流程图； FIG. 4 is a flowchart of an access object of the present invention;

图 5为本发明删除对象流程图。实施本发明的方式 FIG. 5 is a flowchart of deleting an object according to the present invention. Mode of Carrying Out the Invention

为使本发明的目的、技术方案和优点更加清楚明白，下面结合实施例和附图，对本发明进一步详细说明。 In order to make the objectives, technical solutions, and advantages of the present invention clearer, the present invention is further described in detail below with reference to the embodiments and the accompanying drawings.

本发明以具有如图 1所示对象包容关系的网络管理***为实施例，也可以将图 1所示筒单包容关系对象树视为整个网络管理***包容关系对象树的一棵子树。首先，根据图 1所示包容关系对象树中每个对象之间的包容关系，将该树上所有网络管理***对象逐个挂在一个规则的对象二叉树上 , 可称为管理对象实例树 ( Managed Object Instances Tree, MIT )。由于上述的包容关系对象树在逻辑上是一个多叉树，这种结构难于管理，所以根据一定的逻辑将具有包容关系的多叉树转换成一个规则的对象二叉树。该对象二叉树的结构参见图 2，图 2为本发明 >据图 1所示包容关系对象树建立的对象二叉树结构示意图; 在对象二叉树中，每个节点涉及三个指针，分别为上层节点指下来的指针、指向左节点的指针、指向右节点的指针。从包容树向对象二叉树的转换逻辑为: 在包容树中，从上向下，对每一个节点，将其子节点从左到右逐个挂在对象二叉树上，第一个子节点作为父节点的左节点，其它子节点依次作为前面一个子节点的右节点。， In the present invention, a network management system having an object containment relationship as shown in FIG. 1 is taken as an example. The tube single containment relationship object tree shown in FIG. 1 can also be regarded as a subtree of the entire network management system containment relationship object tree. First, according to the containment relationship between each object in the containment relationship object tree shown in FIG. 1, all network management system objects in the tree are hung on a regular object binary tree one by one, which can be called a managed object instance tree (Managed Object Instances Tree, MIT). Because the above-mentioned containment relationship object tree is a multi-tree logically, this structure is difficult to manage, so the multi-tree with containment relationship is converted into a regular object binary tree according to certain logic. The structure of the object binary tree is shown in FIG. 2. FIG. 2 is a schematic diagram of the object binary tree structure established according to the inclusive relation object tree shown in FIG. 1. In the object binary tree, each node involves three pointers, which are respectively pointed down by the upper node. Pointer, pointer to left node, pointer to right node. The transformation logic from the containment tree to the object binary tree is: In the containment tree, from top to bottom, for each node, its child nodes are hung on the object binary tree one by one from left to right, and the first child node is used as the parent node. The left node and other child nodes are in turn the right node of the previous child node. ,

如图 2所示，父 M0做为根节点，根据图 1所示对象包容关系，将子 M01作为父 MO的左节点，子 M02作为子 M01的右节点，子 M03 作为子 M02的右节点，孙 MOl作为子 M02的左节点，孙 M02作为孙 M01的右节点，孙 M03作为孙 M02的右节点。 As shown in FIG. 2, parent M0 is used as the root node, and according to the object tolerance relationship shown in FIG. 1, child M01 is used as the left node of parent MO, child M02 is used as the right node of child M01, and child M03 is used as the right node of child M02. Sun MO1 is the left node of the child M02, Sun M02 is the right node of the sun M01, and Sun M03 is the right node of the sun M02.

图 2顺时针旋转 45度，就是一个二叉树，每个节点的左节点是其子对象，右节点是其兄对象。这样，每个对象的管理信息只包括三个指针，加上一些辅助信息，仅占用了 24 个字节内存；所以，容器类管理信息开销很小，就使得本发明的空间效率很高。 Figure 2 Rotating 45 degrees clockwise is a binary tree. The left node of each node is its child object, and the right node is its sibling object. In this way, the management information of each object includes only three pointers, plus some auxiliary information, and only occupies 24 bytes of memory; therefore, the overhead of container-type management information is small, which makes the space efficiency of the present invention very high.

然后，为对象二叉树上的每个对象设置一个与该对象——对应的对象标识号（OID ), 并建立对象标识号索引表，可以通过查询该索引表根据对象标识号获得对象二叉树上的各个对象。 Then, for each object in the object binary tree, an object identification number (OID) corresponding to the object is set, and an object identification number index table is established. Each index object can be obtained by querying the index table according to the object identification number. Object.

同时，为上述的对象二叉树定义迭代算子（Iterator ), 这个迭代算子可以按照 C++程序语言中的标准模板库（ Standard Template Library, STL ) 定义迭代算子的方法来定义, 通过该迭代算子遍历该对象二叉树, 对对象二叉树上的各个对象进行访问、添加、删除、修改等操作管理。 At the same time, iterative operator (Iterator) is defined for the above object binary tree. This iterative operator can be based on the Standard Template Library (STL) in the C ++ programming language. A method of defining an iterative operator is used to define, through the iterative operator to traverse the object binary tree, and to access, add, delete, modify and other operations management on the object binary tree.

另外在网络管理***中设置一个对象工厂实体 ( MOFactory ), 用于根据对象类型创建对象。 In addition, an object factory entity (MOFactory) is set in the network management system to create an object according to the object type.

这样，创建对象的过程参见图 3 , 图 3为本发明创建对象流程图。如图 3所示，由用户指定创建一个新对象 , 先执行步骤 301 , 对象二叉树 ( MIT ) 向 MOFactory要求创建对象实例， MOFactory创建一个包含新对象所有信息的对象实例；然后，执行步骤 302二叉树向自身申请一个 OID; 再执行步骤 303 , 为该对象实例分配一个 OID, 并将该 OID与该 MO的——对应关系写入 0ID索引表; 最后，执行步骤 304将该对象实例根据包容关系***到对象二叉树上。 In this way, the process of creating an object is shown in FIG. 3, which is a flowchart of creating an object according to the present invention. As shown in FIG. 3, a new object is specified by a user. First, step 301 is performed. An object binary tree (MIT) requests MOFactory to create an object instance. MOFactory creates an object instance that contains all the information about the new object. Then, step 302 is performed. Apply for an OID by itself; then perform step 303 to assign an OID to the object instance, and write the corresponding relationship between the OID and the MO into the 0ID index table; finally, perform step 304 to insert the object instance into the 0ID index table according to the containment relationship Object on a binary tree.

访问对象的过程参见图 4, 图 4为本发明访问对象流程图。如图 4 所示，如果不知道对象的 0ID, 先根据对象的类型和特征等信息，在对象二叉树中查找得到该对象；如果已知对象的 OID,则可以根据该 OID, 通过对象标识号索弓 1表查找到对象二叉树上的对象。 The process of accessing the object is shown in FIG. 4 and FIG. 4 is a flowchart of accessing the object according to the present invention. As shown in Figure 4, if you do n’t know the 0ID of the object, you can first find the object in the object binary tree according to the type and characteristics of the object; if the OID of the object is known, you can use the OID to obtain the object ID Bow 1 table finds objects on the object binary tree.

通过访问对象的过程查找到对象实例后，便可以对其进行修改、删除等操作。其中，删除对象的过程参见图 5，图 5为本发明删除对象流程图。先执行步骤 501判断要删除对象是否有子节点；如果没有子节点，则执行步骤 503 , 从对象树中删除该对象，再执行步骤 504, 回收该对象的 OID, 完成要删除对象的删除; 如果要删除对象有子节点 , 则执行步骤 502使用迭代算子遍历其子节点，查找到第一个子节点后，连续执行上述步驟 503和 504将第一个子对象删除；再执行步驟 505 , 判断是否遍历完成，如果遍历完成则删除要删除对象 ,完成要删除对象的删除，否则执行步骤 506遍历下一个子节点，查找到第二个子节点后₅ 连续执行上述步骤 503和 504将第二个子对象删除，直到删除所有子节点，最后删除要删除对象。对象删除后，修改对象标识号索引表，将所有被删除对象的索引信息删除。 After finding the object instance through the process of accessing the object, you can modify, delete, etc. it. The process of deleting an object is shown in FIG. 5, which is a flowchart of deleting an object according to the present invention. First execute step 501 to determine whether the object to be deleted has child nodes; if there are no child nodes, perform step 503 to delete the object from the object tree, and then perform step 504 to recover the OID of the object and complete the deletion of the object to be deleted; if To delete an object that has child nodes, execute step 502 to traverse its child nodes using an iterative operator. After finding the first child node, perform the above steps 503 and 504 continuously to delete the first child object; then perform step 505 to determine whether the traversal is complete, if the iteration completes deleting to delete an object, delete an object to be deleted is completed, otherwise the next step 506 traversing a child node, the child node to find the second ₅ consecutive above steps 503 and 504 the second child object Delete until all child nodes are deleted, most After deleting the object you want to delete. After the object is deleted, the object identification number index table is modified to delete the index information of all deleted objects.

例如，删除图 2中节点子 M02, 首先判断其是否有子节点, 然后用迭代算子遍历所有子节点找到最后一个节点为孙 M03 , 则将孙 M03 节点删除，收回孙 M03的 OID, 删除孙 M03的对象实例, 将对象标识号索引表中孙 M03的索引信息删除；继续用迭代算子遍历所有子节点，找到孙 M02为当前最后一个节点，则按上述方法将其删除；用同样的方法删除节点孙 M01; 最后删除节点子 M02; 此时需要将节点子 M01 指向右节点的指针指向节点子 M03。 For example, delete the node child M02 in Figure 2, first determine whether it has child nodes, and then use an iterative operator to traverse all child nodes to find the last node as the grandson M03, then delete the grandson M03 node, reclaim the OID of grandson M03, and delete the grandson M03 object instance, delete the index information of grandson M03 in the object identification number index table; continue to iterate through all child nodes, find grandson M02 as the current last node, then delete it according to the above method; use the same method Delete the node grandson M01; finally delete the node grandchild M02; At this point, you need to point the node grandchild M01 to the right node pointer to the grandchild M03.

由于通过迭代算子，可以得到一个对象、该对象的下一个节点和该节点是否为最后一个节点的信息。所以，通过迭代算子完成对一个对象所有子节点的遍历，可以用一个以是否为最后一个节点为条件的简单的循环来实现。如果先从对象标识号索引表得到该对象的 OID, 可以按先父后子的顺序来遍历，如果先查找到该对象最<|氏层子节点的 OID, 可以按先子后父的顺序来遍历。对于图 2中的二叉树，如果按照先父后子的顺序，应该依次访问：父 MO、子 M03、子 M02、孙 M03、孙 M02、孙 M01、子 M01; 如果按照先子后父的顺序，应该依次访问：子 M01、孙 M01、孙 M02、孙 M03、子 M02、子 M03、父 MO。 Because iterative operators can obtain information about an object, the next node of the object, and whether the node is the last node. Therefore, iterating the operator to complete the traversal of all the child nodes of an object can be achieved by a simple loop with the condition of whether it is the last node. If the OID of the object is obtained from the object identification number index table first, it can be traversed in the order of the first parent and then the child. If the OID of the child node of the object with the lowest level first Iterate. For the binary tree in FIG. 2, if the order of the father and the son is followed, the parent tree, the child M03, the child M02, the grandchild M03, the grandchild M02, the grandchild M01, and the grandchild M01; You should visit: Child M01, Sun M01, Sun M02, Sun M03, Child M02, Child M03, and Parent MO.

修改对象的过程很筒单，只需要在对象二叉树上查找到要修改的对象，直接对该对象进行修改即可。 The process of modifying an object is simple. You only need to find the object to be modified in the object binary tree, and you can modify the object directly.

以上的实施例，可以通过用标准 C + +语言或标准 JAVA语言编程来实现。 The above embodiments can be implemented by programming in standard C ++ language or standard JAVA language.

由上述实施例可见，本发明方法提高了空间效率、运行效率，便于开发人员的学习和使用。 It can be seen from the foregoing embodiments that the method of the present invention improves space efficiency and operation efficiency, and is convenient for developers to learn and use.

由于本发明的实现和操作***无关，在 WINDOWS, U IX( Solaris, HP-UX ), LINUX, pSOS, VxWorks操作***上均已实现, 尤其适合电信网管和具体平台无关的开放性实现的要求。同时，本发明完全吻合电信网管的需求和特点，实现筒单，性能稳定。 Since the implementation of the present invention has nothing to do with the operating system, in WINDOWS, U IX (Solaris, HP-UX), LINUX, pSOS, VxWorks operating systems have been implemented, especially suitable for telecommunication network management and platform-independent open implementation requirements. At the same time, the present invention completely meets the needs and characteristics of the telecommunications network management, and achieves simple and stable performance.

Claims

权利要求书 Claim

K一种对网络管理***对象进行管理的方法，其特征在于，该方法包括以下步驟： A method for managing a network management system object, which is characterized in that the method includes the following steps:

I )根据网络管理***中每个对象之间的包容关系 ,建立对象二叉树； 2 )为步骤 1 )建立的对象二叉树定义迭代算子，通过该迭代算子遍历该对象二叉树，对对象二叉树上的各个对象进行操作管理。 I) Establish an object binary tree according to the tolerance relationship between each object in the network management system; 2) Define an iterative operator for the object binary tree established in step 1), traverse the object binary tree through the iterative operator, and Each object is operated and managed.

2、如权利要求 1所述的管理方法，其特征在于，步骤 1 )所述的建立对象二叉树的过程为： 2. The management method according to claim 1, wherein the process of establishing an object binary tree in step 1) is:

II )将包容树中第一个对象作为对象二叉树的根节点； II) using the first object in the containment tree as the root node of the object binary tree;

3、如权利要求 1或 2所述的管理方法，其特征在于：步骤 1 )进一步包括为对象二叉树上的每个对象设置一个与该对象——对应的对象标识号，同时建立包含对象名称和对象标识号的对象标识号索引表。 3. The management method according to claim 1 or 2, characterized in that: step 1) further comprises setting an object identification number corresponding to the object for each object on the object binary tree, and establishing an object identifier and Object identification number index table for object identification number.

4、如权利要求 3所述的管理方法，其特征在于，该方法进一步包括，在***中设置对象工厂实体，该方法添加新对象的过程为： 4. The management method according to claim 3, wherein the method further comprises: setting an object factory entity in the system, and the method of adding a new object is:

Α、由用户指定新对象的对象类型和父对象； A. The user specifies the object type and parent object of the new object;

Β、对象工厂实体创建一个该对象类型的新对象； Β, the object factory entity creates a new object of the object type;

5, 如权利要求 3所述的管理方法，其特征在于，步驟 2 )所述操作管理为访问对象时，该方法进一步包括：如果没有得到要访问对象的对象标识号，则 >据要访问对象的类型和特征信息，到对象二叉树上查找该要访问的对象；如果已经得到要访问对象的对象标识号，则根据该对象标识号，通过索引表查找到对象二叉^ "上该对象标识号对应的对象。 5. The management method according to claim 3, wherein when the operation management is an access object in step 2), the method further comprises: if no pair of objects to be accessed is obtained Icon identification number, then according to the type and feature information of the object to be accessed, search the object binary tree for the object to be accessed; if the object identification number of the object to be accessed has been obtained, according to the object identification number, find it through the index table The object corresponding to the object identification number on the object binary ^ ".

6、如权利要求 5所述的管理方法，其特征在于，步骤 2 )所述操作管理为删除对象时, 该方法进一步包括: 先在对象二叉树上查找到该对象; 判断其是否有子对象, 如果有则使用迭代算子遍历其子对象，将其所有子对象删除 /修改后，再删除该对象；如果没有子对象, 则直接将该对象删除。 6. The management method according to claim 5, characterized in that, when the operation management is deleting an object in step 2), the method further comprises: first finding the object on the object binary tree; judging whether it has child objects, If so, iterate over its child objects using an iterative operator, delete / modify all its child objects, and then delete the object; if there are no child objects, delete the object directly.

7、如权利要求 6所述的管理方法，其特征在于：该方法进一步包括，删除对象时，删除其在对象标识号索引表中的信息，并回收被删除对象的对象标识号。 7. The management method according to claim 6, further comprising: when deleting the object, deleting its information in the object identification number index table, and recovering the object identification number of the deleted object.

8、如权利要求 7所述的管理方法，其特征在于：该方法进一步包括，通过迭代算子，得到被访对象的下一个子对象的信息, 和该子对象是否为最后一个对象的信息。 8. The management method according to claim 7, further comprising: obtaining information of a next sub-object of the visited object and information of whether the sub-object is the last object through an iterative operator.

9、如权利要求 1所述的管理方法，其特征在于：步骤 2 )所述的迭代算子按照标准模板库 ( STL )定义和使用迭代算子的方法定义和使用。 9. The management method according to claim 1, wherein: the iterative operator in step 2) is defined and used in accordance with a method of defining and using an iterative operator according to the Standard Template Library (STL).