Method for implementing tree storage and access by two-dimensional table

Abstract

The invention relates to a storing and accessing method of a tree implemented by 2D tables, including: (1) building 2D tables, including: a capacity allocation table, describing the capacity of tables in the system; a tree-structure relation table, describing the relation of the tree structure; several data storage area tables, recording the node attribute values in the tree structure; (2) loading and maintaining the data, including adding, deleting, amending and searching as well as the relative operations; (3) managing the data, including loading, synchronizing, changing and observing. It achieves the effects of flexibly configuring data and of making maximum use of the original mechanisms of the object-oriented database and enhances processing efficiency, flexibility and stability.

Description

technical field [0001] The invention relates to a configuration and storage method of a tree data structure, in particular to configuration, storage and management of protocol stack data in the communication field. Including configuration of existing routing data and IP bearer configuration adopted in 3G products, such as WCDMA RNC, MSC-S, MGW, SGSN, GGSN, etc., CDMA2000 PCF, PDSN and other network elements based on IP protocol stack configuration. Background technique [0002] There are generally two main storage methods for existing data about protocol bearer configuration: [0003] 1. The realization method of the tree structure+continuous buffer based on the linked list: please refer to the Chinese patent document CN 00125204.6. This method consists of a tree index structure (such as figure 1 ) and a single buffer. A tree node indicates attributes such as configuration type, data length, and data buffer address of the node. The address of the data buffer indicates th...

AI Technical Summary

Problems solved by technology

This has several disadvantages: (1) it is very difficult to use various constraint mechanisms and operations of existing object-oriented databases for the configuration parameter table; (2) in a long period of time, if the configuration table is added or deleted Many, will cause fragmentation of the buffer

(3) The number of tree structure nodes and the capacity and size of the data buffer cannot be flexibly configured

Dynamic upgrade of capacity cannot be realized

[0004] 2. Implemented purely with relational tables: This method is only suitable for some systems with few protocol data configurations, and because specific data attributes should be concerned about when designing tables, the scalability of protocol data configuration is poor, because The distribution of protocol data includes multiple levels, and the configuration requirements of the protocol data belonging to the application change (belonging to the design change of the relational table) quickly, so it is not very good to use

Images