CN1545048A - Method for implementing tree storage and access by two-dimensional table - Google Patents
Method for implementing tree storage and access by two-dimensional table Download PDFInfo
- Publication number
- CN1545048A CN1545048A CNA2003101136602A CN200310113660A CN1545048A CN 1545048 A CN1545048 A CN 1545048A CN A2003101136602 A CNA2003101136602 A CN A2003101136602A CN 200310113660 A CN200310113660 A CN 200310113660A CN 1545048 A CN1545048 A CN 1545048A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- record
- tree
- storage
- 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 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
The present invention relates to a kind of configuration, storage means of tree data structure, relate in particular to protocol stack data configuration, storage and the management of communication field.Comprise the IP carrying configuration that existing route data is disposed and adopts in the 3G product, resemble the RNC of WCDMA, MSC-S, MGW, SGSN, GGSN etc., PCF among the CDMA2000, the configuration based on the IP stack carrying of network elements such as PDSN.
Background technology
Existing data about agreement carrying configuration generally have two kinds of main storage modes:
1. based on the implementation of buffer zone of the tree structure of chained list+continuously: please refer to No. 00125204.6 the manner of Chinese patent literature CN and form by tree index structure (as Fig. 1) and single buffer zone.Tree node is indicated attributes such as the Configuration Type, data length, data buffer address of this node.Wherein data buffer address has been indicated the position of this configuration parameter at buffer zone, the continuous space size that data length indicates this parameter to take in buffer zone.Several shortcomings are arranged like this: (1) is used the various tied mechanisms of existing OODB Object Oriented Data Base and is operated very difficulty the configuration parameter table; (2) in a long time, if allocation list is increased, deletes operation too much, can cause the fragment of buffer zone.(3) cannot flexible configuration for tree construction interstitial content and data buffer capacity and size.Cannot realize the dynamic update of capacity.
2. use the relation table implementation purely: this mode only is fit to some systems with protocol data configuration seldom, and owing to when the table design, will be concerned about concrete data attribute, the expandability of protocol data configuration is relatively poor, because distributing, protocol data comprises many levels, it is very fast that the protocol data configuration needs that belongs to application changes (design variation that belongs to relation table), thus use neither be fine.
Summary of the invention
The technical problem to be solved in the present invention is the limitation that overcomes protocol configuration data management of the prior art, has proposed a kind of method that realizes quick storage, visit and the management of tree construction in conjunction with bivariate table.
Bivariate table among the present invention comprises capacities chart, capacities chart index, tree structure concordance list, a plurality of two-dimentional buffered data tables and various state table (these state tables have been described current the taking and idle condition of various tables).
The storage of the tree that the present invention realizes with bivariate table, the method for visit may further comprise the steps:
(1) create bivariate table, comprising: capacity allocation table is used for the capacity that descriptive system is shown; The tree structure relation table is used to describe the relation of tree construction; Several data storage area tables are used for writing down the node attribute values of tree construction;
(2) loading data and data are safeguarded comprises increase, deletes, revises and searches data, and the associative operation that causes thus;
(3) data are managed, comprise the loading of data, synchronously, data change notice and observe part.
Described capacity allocation table field attribute is as shown in the table:
| Field name | Type | Explain |
| wModule | ?WORD | The module No. of resident data |
| dwNetType | ?DWORD | The NE type of resident data |
| dwModuletype | ?DWORD | The module type of resident data |
| ucInfoType | ?BYTE | Record type 0: nodes records＞0: data buffer numbering |
| wTreeNodeNum | ?WORD | The tree node maximum number |
| wBufferSize | ?WORD | The size of the data buffer of record |
| wBufferNum | ?WORD | The buffering number of this data field size |
Described tree structure relation literary name section attribute is as shown in the table:
| Field name | Type | Explain |
| FATHER | ?WORD | The attribute field of father node |
| NODENAME | ?LPSTR | The node name of writing down in the relation table |
| NODEINDEX | ?WORD | Write down the tick lables of present node in relation table |
| DATATYPE | ?BYTE | Attribute field value type |
| DATALEN | ?WORD | The length of attribute field value |
| DATAHANDLE | ?DWORD | The sign of the stored buffer zone table of attribute field value |
| DATAMARK | ?WORD | Node data leaves the position in the corresponding buffer zone in |
| ISDUMMY | ?BYTE | Whether the record node dummy node |
| LCHILD | ?WORD | Left side child nodes record position |
| RCHILD | ?WORD | Right child nodes record position |
Described data storage area tables field attribute is as shown in the table:
| Field name | Type | Explain |
| Nodeindex | ?WORD16 | Write down node label in the data buffer |
| Nodevalue | ?LPSTR | Recorded content in the data buffer |
The storage of described tree of realizing with bivariate table, the method for visit also comprise the establishment capacities chart, create the capacity index data; The load capacity data load index.
The storage of described tree of realizing with bivariate table, the method for visit also comprise the establishment tree list, create tree construction node index data; Create data storage area tables, for creating index field in each data storage area; Load the data of tree construction and data storage area, load each index field.
The step of described increase comprises:
(1) synchronous or asynchronous transmission increases request message;
(2) receiving process is searched the father node record mark according to the parameter in the request message; If there is no father node increases the father node record of a void automatically in system;
(3) check whether the nodes records that will increase exists; Exist, return mistake;
(4) in the bivariate table of tree construction, increase a record, in record, describe the relevant information of his father's nodes records or brotgher of node record, simultaneously the relevant list item of change;
(5) according to the type and the length of the node attribute values of the nodes records that will increase, selects different data buffers, apply for that in the data buffer table of choosing the record space of a free time deposits current data;
(6) synchronous return result.
The step of described deletion comprises:
(1) synchronous or asynchronous transmission deletion request message;
(2) receiving process is searched the nodes records sign according to the parameter in the request message;
(3) check whether the nodes records that will delete exists; Do not exist, return mistake;
(4) delete the node that finds, discharge the data buffering area resource of node correspondence;
(5) whether this node of inquiry has the child nodes record in relation table, the child that circulation deletion is all and under nodes records;
(6) father node of cycle criterion present node records the necessity that does not have existence, this nodes records of deletion that it's not true.
(7) synchronous return result;
The step of described modification comprises:
(1) data request information is revised in synchronous or asynchronous transmission;
(2) receiving process is searched the father node record mark according to the parameter in the request message;
(3) check whether the nodes records that will revise exists; Existing, revise corresponding property value, mainly is the data maintenance of data buffer table, and possible operation comprises: revise content in the original data buffer (data in the past and new data in same buffer zone time); Deletion record item from original data buffer (new data no longer need be deposited in buffer zone, the log buffer data before discharging); Data buffer zone of new application increases attribute (data in the past do not leave in the buffer zone table, need leave in the buffer zone table now); Delete original data table items, increase by four kinds of operations of new data table items (data in the past require in different buffer zones with new data length);
(4) synchronous return results
Described searching comprises that simple search and insertion search, and simple search is in layer to search in table according to tree structure relation record, directly returns the result who searches; It is to begin to search from root node that insertion is searched, and runs into non-existent node, inserts record, until final record node location.
Bivariate table record load mode is adopted in the loading of described data; Data synchronization adopts the increase of table record and deletion to realize equally, in the loading of data and synchronous process, data in tree construction data and the buffer zone are relatively independent, equally loading, during data in the synchrodata buffer zone, only be responsible for indicating the attribute field of notebook data buffer zone.
The notice of change of described data is to be the notice of change that unit carries out data with a complete transactional applications, and this affairs definition is exactly the modification of a protocol data, carries out the notice of change of related data after affairs are finished again.
Dual mode is adopted in the observation of described data: (1) is similar to the record display mode of bivariate table; (2) adopt the structure display protocol data of tree type, become the logical schema of data to be shown to user application to check being stored in data conversion in the internal schema.
Adopt the method for the invention, compared with prior art, obtained progress at aspects such as configuration data dirigibility, caching mechanism simplification, reach the flexible configuration data and can maximize the effect of using the original mechanism of object-oriented database, improved the dirigibility and the stability of treatment effeciency and processing.Be embodied in the following aspects:
(1) combines the advantage of relation table and tree construction;
Configuration parameter has used the various tied mechanisms of existing OODB Object Oriented Data Base on the one hand, can control by record, comprise writing of triggers such as the pre-deletion of table record, pre-increase, deletion, increase, make the application scenario more extensive, processing ease;
Break away from the correlativity of relation table and application on the other hand, made things convenient for the expandability of application data configuration.
(2), can not cause the fragment of buffer zone to the operation of allocation list.The data computation that system distributes in can be according to capacities chart when starting goes out the size of each data buffer table (after system start-up, this is a definite value), the data length of depositing in each data buffer table is a fixed size, operation based on table just is based on the operation of writing down in the table, the data of a nodes records only can be kept in the buffer table record, discharging nodes records and also can discharge record corresponding in this buffer table, is compact between record and the record, can not produce fragment.This is one and sacrifices the method that internal memory (static allocation internal memory) realizes avoiding memory fragmentation.Adopt this method, can improve the stability of system's long-time running well.
(3) capacity and size can flexible configuration, can accomplish the do not upgrade upgrading of realization capacity of version, well improved the maintainability of system.Because in the 3G product, the network element that applies to IP carrying design is a lot, if capacity can not flexible configuration, the configuration of each network element certainly will have very big difference, and these difference are embodied in the code the stability of system and maintainable certain influence are arranged all.Adopt capacities chart dispose NE capacity with the difference shielding of this network element in user's configuration, systematic comparison is flexible; In addition, for a fixing network element, according to user's needs may capacity required upgrading, adopted this method after, can accomplish that the user disposes the increase capacity and need not change software version.
Description of drawings
Fig. 1 is an existing tree structure synoptic diagram;
Fig. 2 is the corresponding binary tree synoptic diagram in tree structure conversion back of Fig. 1;
Fig. 3 is storage mode and the corresponding data storage location synoptic diagram thereof of this tree structure in relation table;
Fig. 4 is the flow process that increases a node data in relation table;
Fig. 5 is the flow process of node of deletion and relevant node thereof in relation table;
Fig. 6 is the flow process of a node data of deletion in relation table;
Fig. 7 is a flow process of revising a node data in relation table;
Fig. 8 is the flow process of inquiring about a node and nodal value in relation table;
Fig. 9 is the flow process of a node of inquiry in relation table;
Figure 10 is the flow process of inquiring about and appending node in relation table.
Embodiment
In the accompanying drawings, the implication of each English word is as follows:
DWORD: represent that data are integer data types;
STREAM: the data type of a string code stream format of expression;
Fathercode: represent the current start node position that will search;
Lplocate: represent from the start node position to the complete trails of wanting running node.
In addition, the abbreviation meaning is as follows in the instructions:
GPRS:General Packet Radio System, the packet radio system
RNC:Radio NetWork Controller, wireless network control
MSC-S:Mobile Switching Center-SERVER, mobile switching centre-service end
MGW:Media Gateway, media gateway
SGSN:Serving GPRS Support Node, GPRS supports service node
GGSN:Gateway GPRS Support Node, GPRS gateway support node
PCF:Packet Control Function, Packet Control Function
PDSN:Packet Data Service Node, packet data serving node
The method of protocol data configuration of the present invention is as follows:
One. data structure is described:
Created three kinds of bivariate tables by function in system: a capacity allocation table has been described the capacity of showing in the system; A tree structure relation table has been described the relation of tree construction; Node attribute values in several data storage area table record tree constructions.
1. the capacity allocation table field attribute is as shown in Table 1:
Table one. field of each in the capacities chart and meaning thereof in the system have been described
| Field name | Type | Explain |
| wModule | ?WORD | The module No. of resident data |
| dwNetType | ?DWORD | The NE type of resident data |
| dwModuletype | ?DWORD | The module type of resident data |
| ucInfoType | ?BYTE | Record type 0: nodes records＞0: data buffer numbering |
| wTreeNodeNum | ?WORD | The tree node maximum number |
| wBufferSize | ?WORD | The size of the data buffer of record |
| wBufferNum | ?WORD | The buffering number of this data field size |
The explanation of each field in the table one:
First three field wModule, dwNetype, dwModuletype are general fields, can be used for distinguishing the capacity configuration of multimode
During ucInfoType=0: what represent this record description is tree construction node capacity configuration relation, followed by the wTreeNodeNum field description total number (capacity) of tree construction node in the system; Other field is invalid
UcInfoType＞0 o'clock: what represent this record description is corresponding data buffer capacity configuration relation, the wTreeNodeNum field is invalid, wBufferSize has described the size of this each record of data buffer, and wBufferNum has described the number of this data buffer record;
2. the tree construction field attribute is as shown in Table 2:
Table two. the mutual relationship between each field in the tree-shaped relation table in the system and record thereof has been described
| Field name | Type | Explain |
| FATHER | ?WORD | The attribute field of father node |
| NODENAME | ?LPSTR | The node name of writing down in the relation table |
| NODEINDEX | ?WORD | Write down the tick lables of present node in relation table |
| DATATYPE | ?BYTE | Attribute field value type |
| DATALEN | ?WORD | The length of attribute field value |
| DATAHANDLE | ?DWORD | The sign of the stored buffer zone table of attribute field value |
| DATAMARK | ?WORD | Node data leaves the position in the corresponding buffer zone in |
| ISDUMMY | ?BYTE | Whether the record node dummy node |
| LCHILD | ?WORD | Left side child nodes record position |
| RCHILD | ?WORD | Right child nodes record position |
The structure explanation:
The present invention is directed to existing tree index structure shown in Figure 1, be transformed into binary tree index structure shown in Figure 2 by evolution, further handle then and become relation table index structure shown in Figure 3, Fig. 2 is an evolution stage in this complete procedure, be for system integrality and increase, increase this figure and be convenient to understanding, do not do in the present invention and give unnecessary details whole process.
As can see from Figure 3, the value of NODEINDEX (node label) field in table is unique, can be as unique master index of this table with this field.
3. the data storage area tables field attribute is as shown in Table 3:
Table three. the storage mode of each data buffer in the system has been described
| Field name | Type | Explain |
| Nodeindex | ?WORD16 | Write down node label in the data buffer |
| Nodevalue | ?LPSTR | Recorded content in the data buffer |
The structure explanation:
Nodeindex: indicated this data buffering zone position; As can see from Figure 3, the value of this field in table is unique, can be as unique master index of this table with this field.
Nodevalue: a variable data array, length is determined by the record in the R_CONST table; Can realize a variable-length and variable-displacement data buffer.
Two. the operation of system
The first step: the establishment of bivariate table, data load
This step can comprise the following steps: again
1. the establishment capacities chart is created the capacity index data;
2. the load capacity data load index;
Carry out following operation according to the data in the capacities chart:
Create tree list, create tree construction node index data;
Create data storage area tables, for creating index field in each data storage area;
Load the data of tree construction and data storage area, load each index field.
So far, whole internal storage data table is created, loaded; Can carry out following operation.
Second step. the maintenance of tree node
Data have been loaded, tree construction in can his-and-hers watches is safeguarded, comprise increasing, delete, change, looking into of writing down in the his-and-hers watches, and the relevant sequence of operations that causes thus, such as: the record node of deleting the tree in the table causes the deletion of corresponding child nodes entry, the content in simultaneously can the deleted data memory block.
The process that increases a data node is the step in 4 with reference to the accompanying drawings:
1. (or asynchronous) sends the increase request message synchronously;
2. receiving process is searched the father node record mark according to the parameter in the request message (if there is no father node is increased the father node record of a void automatically in system.)
3. check whether the nodes records that will increase exists (exist, return mistake);
4. in the bivariate table of tree construction, increase a record, the relevant information of his father's nodes records or brotgher of node record is described in record, the list item that change simultaneously is correlated with, (if first sub-child of father node will revise the father node field of current record and the left child nodes field of father node record; Otherwise as long as revise right child's field of the previous brother's record of current record);
5. according to the type and the length of the node attribute values of the nodes records that will increase, select different data buffers, record space of application is deposited current data in the data buffer table of choosing.
6. synchronous return result;
The process with reference to the accompanying drawings 5 of a data node of deletion, the step in the accompanying drawing 6:
1. (or asynchronous) sends deletion request message synchronously;
2. receiving process is searched the nodes records sign according to the parameter in the request message;
3. check whether the nodes records that will delete exists (do not exist, return mistake);
4. delete the node that finds, the data in the data buffer of deletion of node correspondence;
5. whether this node of inquiry has the child nodes record in relation table, the child that circulation deletion is all and under nodes records;
6. the father node of cycle criterion present node records the necessity that does not have existence, this nodes records of deletion that it's not true.(node is dummy node record type and does not have child to write down necessity that the current record of expression does not have existence, can delete it, but except the ground floor root node)
7. synchronous return result;
The process of revising a data node is the step in 7 with reference to the accompanying drawings:
1. (or asynchronous) sends and revises data request information synchronously;
2. receiving process is searched father node record mark (if there is no father node record, return failure and failure cause according to the parameter in the request message.)
3. (existing, revise corresponding property value, mainly is the data maintenance of data buffer table, and possible operation comprises: revise the content in the original data buffer to check whether the nodes records that will revise exists; Deletion record item from original data buffer; Data buffer zone of new application increases attribute; Delete original data table items, increase new four kinds of operations such as data table items.If this nodes records does not exist, according to the mode newly-generated nodes records under current node that increases nodes records);
4. synchronous return results
The process of checking a table data section point value is with reference to the step among the figure 8:
1. (or asynchronous) sends the data query request message synchronously;
2. receiving process is searched nodes records sign (if there is no nodes records, return failure and failure cause according to the parameter in the request message.)
3. judge data buffer that this node data is deposited and the position in buffer zone thereof according to the storage data attribute in the nodes records data item that obtains and length, in corresponding buffer zone, take out data then.
4. synchronous return results
In the superincumbent description, each operation all needs the record location in the his-and-hers watches, so the efficient of query manipulation is important, has created the HASH index for each table in the system, adopts HASH and name method relatively, has improved search efficiency.According to the demand difference in the system, we provide searching of dual mode: simple search and insertion are searched.
Simple search: user's operation all can cause the action of simple search, its objective is in order to obtain wanting the nodes records of operand.
The process of a data node of simple search is the step in 9 with reference to the accompanying drawings:
1. search the record of coupling under the root node that in table, writes down according to input path first field;
2. if do not find record then return failure, otherwise first field is removed in the path, if the path is empty, then returns the node label of the table record that finds;
3. 1,2 operation circulates;
Insertion is searched: nodal operation of user's increase may cause the process that insertion is searched, and its objective is and if an object does not exist, no longer returns failure on the basis of simple search, but increase a virtual path.
The process that a data node is searched in insertion is the step in 10 with reference to the accompanying drawings:
1. search the record of coupling under the root node that in table, writes down according to input path first field;
2. if do not find record then jump to 4 and carry out, otherwise first field is removed in the path, if the path be a sky, then returns the node label of the table record that finds;
3. 1,2 operation circulates;
4. in table, increase corresponding dummy node according to first field in the path; First field is removed in the path
5. circulation carries out 4, until the path is empty;
The 3rd step. the management of data
The management of data comprise the loading of data, synchronously, data change notice and observe part.
In communication field, owing to adopted distribution process, and in order to improve the stability of system, much veneers employing 1+1 hot backup modes, so the loading of data, synchronous processing seem complicated, important more.
The protocol data physical storage structure is organized in the table mode, so bivariate table record load mode is adopted in the loading of data; Data synchronization adopts the increase of table record and deletion to realize equally, in the loading of line data and synchronous process, is indifferent to the relation of interdependence of concrete record data.Data in tree construction data and the buffer zone are relatively independent, such as loading, synchronously during as shown in Figure 1 data, can come store data according to the record position shown in the accompanying drawing 3, also can be by position store data mixed and disorderly in the actual motion, be indifferent to the position in the data buffer of concrete deposit data this moment, attribute field DATAHANDLE and DATAMARK in the buffer zone only in table, have been write down, loading equally, also need not be concerned about the node location in its corresponding tree construction during data in the synchrodata buffer zone, only be responsible for indicating the attribute field Nodeindex of notebook data buffer zone, be mapped by top three fields and the handle of buffer zone in system when the relation of these two kinds of tables is only moved in system.
The data change notice of agreement mainly is meant the application that needs to notify other after protocol data is successfully revised; Owing in protocol data, increase a node, may increase or delete many records in the bivariate table of its storage, therefore can not be with the increase of traditional bivariate table record and the notice of deletion trigger data, and be the notice of change that unit carries out data with a complete transactional applications, this affairs definition is exactly the modification of a protocol data, carries out the notice of change of related data after affairs are finished again.
The observation of protocol data can be adopted dual mode: (1) is similar to the record display mode of bivariate table, this mode is observed not directly perceived to concrete protocol data implication, but can check the storage organization of protocol data internal schema intuitively for the database professional, be convenient to the adjustment of the capacity of showing, and the tissue of some index.(2) adopt the structure display protocol data of tree type, become the logical schema of data to be shown to user application to check being stored in data conversion in the internal schema.
Claims (13)
1. the storage of a tree of realizing with bivariate table, the method for visit is characterized in that, comprising:
Step 1: create bivariate table, comprising: capacity allocation table is used for the capacity that descriptive system is shown; The tree structure relation table is used to describe the relation of tree construction; Several data storage area tables are used for writing down the node attribute values of tree construction;
Step 2: loading data is also safeguarded data, comprises increase, deletes, revises and search data, and the associative operation that causes thus;
Step 3: data are managed, comprise the loading of data, synchronously, data change notice and observe part.
2. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that it is as shown in the table for described capacity allocation table field attribute:
Field name Type Explain
wModule ?WORD The module No. of resident data
dwNetType ?DWORD The NE type of resident data
dwModuletype ?DWORD The module type of resident data
ucInfoType ?BYTE Record type 0: nodes records＞0: data buffer numbering
wTreeNodeNum ?WORD The tree node maximum number
wBufferSize ?WORD The size of the data buffer of record
wBufferNum ?WORD The buffering number of this data field size
3. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that it is as shown in the table for described tree construction field attribute:
Field name Type Explain
FATHER ?WORD The attribute field of father node
NODENAME ?LPSTR The node name of writing down in the relation table
NODEINDEX ?WORD Write down the tick lables of present node in relation table
DATATYPE ?BYTE Attribute field value type
DATALEN ?WORD The length of attribute field value
DATAHANDLE ?DWORD The sign of the stored buffer zone table of attribute field value
DATAMARK ?WORD Node data leaves the position in the corresponding buffer zone in
ISDUMMY ?BYTE Whether the record node dummy node
LCHILD ?WORD Left side child nodes record position
RCHILD ?WORD Right child nodes record position
4. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that it is as shown in the table for described data storage area tables field attribute:
Field name Type Explain
Nodeindex ?WORD16 Write down node label in the data buffer
Nodevalue ?LPSTR Recorded content in the data buffer
5. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that step 1 also comprises the establishment capacities chart, create the capacity index data; The load capacity data load index.
6. as claim 1 or the storage of 5 described trees of realizing with bivariate table, the method for visit, it is characterized in that step 1 also comprises the establishment tree list, create tree construction node index data; Create data storage area tables, for creating index field in each data storage area; Load the data of tree construction and data storage area, load each index field.
7. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that the step of the increase described in the step 2 comprises:
(1) synchronous or asynchronous transmission increases request message;
(2) receiving process is searched the father node record mark according to the parameter in the request message; If there is no father node increases the father node record of a void automatically in system;
(3) check whether the nodes records that will increase exists; Exist, return mistake;
(4) in the bivariate table of tree construction, increase a record, in record, describe the relevant information of his father's nodes records or brotgher of node record, simultaneously the relevant list item of change;
(5) according to the type and the length of the node attribute values of the nodes records that will increase, selects different data buffers, apply for that in the data buffer table of choosing a record space deposits current data;
(6) synchronous return result.
8. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that the step of the deletion described in the step 2 comprises:
(1) synchronous or asynchronous transmission deletion request message;
(2) receiving process is searched the nodes records sign according to the parameter in the request message;
(3) check whether the nodes records that will delete exists; Do not exist, return mistake;
(4) delete the node that finds, the data in the data buffer of deletion of node correspondence;
(5) whether this node of inquiry has the child nodes record in relation table, the child that circulation deletion is all and under nodes records;
(6) father node of cycle criterion present node records the necessity that does not have existence, this nodes records of deletion that it's not true.
(7) synchronous return result;
9. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that the step of the modification described in the step 2 comprises:
(1) data request information is revised in synchronous or asynchronous transmission;
(2) receiving process is searched the father node record mark according to the parameter in the request message;
(3) check whether the nodes records that will revise exists; Existing, revise corresponding property value, mainly is the data maintenance of data buffer table, and possible operation comprises: revise the content in the original data buffer; Deletion record item from original data buffer; Data buffer zone of new application increases attribute; Delete original data table items, increase by four kinds of operations of new data table items;
(4) synchronous return results
10. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit, it is characterized in that, searching described in the step 2 comprises that simple search and insertion search, and simple search is in layer to search in table according to tree structure relation record, directly returns the result who searches; It is to begin to search from root node that insertion is searched, and runs into non-existent node, inserts record, until final record node location.
11. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that bivariate table record load mode is adopted in the loading of data described in the step 3; Described data synchronization adopts the increase of table record and deletion to realize equally, in the loading of data and synchronous process, data in tree construction data and the buffer zone are relatively independent, equally loading, during data in the synchrodata buffer zone, only be responsible for indicating the attribute field of notebook data buffer zone.
12. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit, it is characterized in that, the notice of change of data described in the step 3 is to be the notice of change that unit carries out data with a complete transactional applications, this affairs definition is exactly the modification of a protocol data, carries out the notice of change of related data after affairs are finished again.
13. the storage of tree of realizing with bivariate table as claimed in claim 1, the method for visit is characterized in that dual mode is adopted in the observation of data described in the step 3: (1) is similar to the record display mode of bivariate table; (2) adopt the structure display protocol data of tree type, become the logical schema of data to be shown to user application to check being stored in data conversion in the internal schema.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101136602A CN1307584C (en) | 2003-11-17 | 2003-11-17 | Method for implementing tree storage and access by two-dimensional table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2003101136602A CN1307584C (en) | 2003-11-17 | 2003-11-17 | Method for implementing tree storage and access by two-dimensional table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1545048A true CN1545048A (en) | 2004-11-10 |
| CN1307584C CN1307584C (en) | 2007-03-28 |
Family
ID=34336948
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2003101136602A Expired - Fee Related CN1307584C (en) | 2003-11-17 | 2003-11-17 | Method for implementing tree storage and access by two-dimensional table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1307584C (en) |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009076854A1 (en) * | 2007-12-03 | 2009-06-25 | Tencent Technology (Shenzhen) Company Limited | Data cache system and method for realizing high capacity cache |
| CN101853278A (en) * | 2010-05-19 | 2010-10-06 | 苏州迈科网络安全技术有限公司 | Application method of data storage system |
| CN102024052A (en) * | 2010-12-17 | 2011-04-20 | 北京握奇数据系统有限公司 | Method and device for realizing transaction of data storage system |
| CN101241492B (en) * | 2007-02-06 | 2011-05-11 | 中兴通讯股份有限公司 | EMS memory data storage apparatus possessing capacity dynamic control function and its accomplishing method |
| CN102156743A (en) * | 2011-04-18 | 2011-08-17 | 北京神州数码思特奇信息技术股份有限公司 | Method for memorizing telecom mass telephone bill data |
| CN101620618B (en) * | 2009-07-24 | 2011-11-30 | 中兴通讯股份有限公司 | Method and device for maintaining data stored in memory |
| CN102508866A (en) * | 2011-10-09 | 2012-06-20 | 中国电子科技集团公司第二十八研究所 | Digital addressing-based method for structured storage and rapid processing of command relation tree |
| CN102567000A (en) * | 2010-12-31 | 2012-07-11 | 新奥特（北京）视频技术有限公司 | Method and device for special effect plug-in supporting dynamic parameter |
| CN102750265A (en) * | 2011-08-26 | 2012-10-24 | 新奥特（北京）视频技术有限公司 | Method and device for data replacing |
| CN101727320B (en) * | 2008-10-22 | 2013-01-30 | 国际商业机器公司 | Methods and tools for identifying impact of database changes on an application |
| CN102970152A (en) * | 2012-11-23 | 2013-03-13 | 上海斐讯数据通信技术有限公司 | Method for statically realizing Internet group management protocol (IGMP) Snooping |
| CN103020273A (en) * | 2012-12-27 | 2013-04-03 | 福建榕基软件股份有限公司 | Method and device for tree structure data presentation and relative index table generation |
| CN101751457B (en) * | 2008-11-28 | 2013-04-24 | 国际商业机器公司 | Information processing apparatus, database system and information processing method |
| CN103186568A (en) * | 2011-12-28 | 2013-07-03 | 金蝶软件（中国）有限公司 | Method and system for accessing tree-structured data |
| CN103207813A (en) * | 2012-01-11 | 2013-07-17 | 华为技术有限公司 | Method and device for managing resources |
| CN104850591A (en) * | 2015-04-24 | 2015-08-19 | 百度在线网络技术（北京）有限公司 | Data conversion storage method and device |
| CN107018077A (en) * | 2017-04-28 | 2017-08-04 | 烽火通信科技股份有限公司 | Data transmission method and system for router |
| CN108805527A (en) * | 2018-05-29 | 2018-11-13 | 郑州云海信息技术有限公司 | A kind of project management method and device |
| CN110019223A (en) * | 2017-12-21 | 2019-07-16 | 天津数观科技有限公司 | A method of the generation data family tree based on Data Storage Models |
| WO2019144852A1 (en) * | 2018-01-26 | 2019-08-01 | 拜椰特（上海）软件技术有限公司 | Novel computer programming language |
| CN113392089A (en) * | 2021-06-25 | 2021-09-14 | 瀚高基础软件股份有限公司 | Database index optimization method and readable storage medium |
| CN113434587A (en) * | 2021-06-30 | 2021-09-24 | 青岛海尔科技有限公司 | Data storage and data query method and system |
| CN114780325A (en) * | 2022-06-21 | 2022-07-22 | 新华三信息技术有限公司 | PCIe equipment detection method and device |
| CN115328366A (en) * | 2022-08-11 | 2022-11-11 | 北京智慧星光信息技术有限公司 | Million-level tree node searching and displaying method and system based on full path calculation |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH1139339A (en) * | 1997-07-24 | 1999-02-12 | Denso Corp | Navigation device |
| JP3589349B2 (en) * | 2001-01-12 | 2004-11-17 | 日本電気株式会社 | Route search system, search method thereof, and recording medium storing route search program |
| JP4501288B2 (en) * | 2001-02-23 | 2010-07-14 | ヤマハ株式会社 | Huffman code decoding method, decoding apparatus, Huffman code decoding table, and method for creating the same |
-
2003
- 2003-11-17 CN CNB2003101136602A patent/CN1307584C/en not_active Expired - Fee Related
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101241492B (en) * | 2007-02-06 | 2011-05-11 | 中兴通讯股份有限公司 | EMS memory data storage apparatus possessing capacity dynamic control function and its accomplishing method |
| WO2009076854A1 (en) * | 2007-12-03 | 2009-06-25 | Tencent Technology (Shenzhen) Company Limited | Data cache system and method for realizing high capacity cache |
| CN101727320B (en) * | 2008-10-22 | 2013-01-30 | 国际商业机器公司 | Methods and tools for identifying impact of database changes on an application |
| US8856183B2 (en) | 2008-11-28 | 2014-10-07 | International Business Machines Corporation | Database access using partitioned data areas |
| CN101751457B (en) * | 2008-11-28 | 2013-04-24 | 国际商业机器公司 | Information processing apparatus, database system and information processing method |
| CN101620618B (en) * | 2009-07-24 | 2011-11-30 | 中兴通讯股份有限公司 | Method and device for maintaining data stored in memory |
| CN101853278A (en) * | 2010-05-19 | 2010-10-06 | 苏州迈科网络安全技术有限公司 | Application method of data storage system |
| CN102024052A (en) * | 2010-12-17 | 2011-04-20 | 北京握奇数据系统有限公司 | Method and device for realizing transaction of data storage system |
| CN102024052B (en) * | 2010-12-17 | 2013-03-13 | 北京握奇数据系统有限公司 | Method and device for realizing transaction of data storage system |
| CN102567000A (en) * | 2010-12-31 | 2012-07-11 | 新奥特（北京）视频技术有限公司 | Method and device for special effect plug-in supporting dynamic parameter |
| CN102156743A (en) * | 2011-04-18 | 2011-08-17 | 北京神州数码思特奇信息技术股份有限公司 | Method for memorizing telecom mass telephone bill data |
| CN102750265A (en) * | 2011-08-26 | 2012-10-24 | 新奥特（北京）视频技术有限公司 | Method and device for data replacing |
| CN102508866A (en) * | 2011-10-09 | 2012-06-20 | 中国电子科技集团公司第二十八研究所 | Digital addressing-based method for structured storage and rapid processing of command relation tree |
| CN103186568B (en) * | 2011-12-28 | 2017-03-22 | 金蝶软件（中国）有限公司 | Method and system for accessing tree-structured data |
| CN103186568A (en) * | 2011-12-28 | 2013-07-03 | 金蝶软件（中国）有限公司 | Method and system for accessing tree-structured data |
| WO2013104181A1 (en) * | 2012-01-11 | 2013-07-18 | 华为技术有限公司 | Resource management method and device |
| CN103207813A (en) * | 2012-01-11 | 2013-07-17 | 华为技术有限公司 | Method and device for managing resources |
| CN103207813B (en) * | 2012-01-11 | 2018-08-14 | 华为技术有限公司 | The method and apparatus for managing resource |
| CN102970152A (en) * | 2012-11-23 | 2013-03-13 | 上海斐讯数据通信技术有限公司 | Method for statically realizing Internet group management protocol (IGMP) Snooping |
| CN103020273A (en) * | 2012-12-27 | 2013-04-03 | 福建榕基软件股份有限公司 | Method and device for tree structure data presentation and relative index table generation |
| CN104850591A (en) * | 2015-04-24 | 2015-08-19 | 百度在线网络技术（北京）有限公司 | Data conversion storage method and device |
| CN104850591B (en) * | 2015-04-24 | 2019-03-19 | 百度在线网络技术（北京）有限公司 | A kind of the conversion storage method and device of data |
| CN107018077A (en) * | 2017-04-28 | 2017-08-04 | 烽火通信科技股份有限公司 | Data transmission method and system for router |
| CN107018077B (en) * | 2017-04-28 | 2019-08-20 | 烽火通信科技股份有限公司 | Data transmission method and system for router |
| CN110019223A (en) * | 2017-12-21 | 2019-07-16 | 天津数观科技有限公司 | A method of the generation data family tree based on Data Storage Models |
| WO2019144852A1 (en) * | 2018-01-26 | 2019-08-01 | 拜椰特（上海）软件技术有限公司 | Novel computer programming language |
| CN108805527A (en) * | 2018-05-29 | 2018-11-13 | 郑州云海信息技术有限公司 | A kind of project management method and device |
| CN113392089A (en) * | 2021-06-25 | 2021-09-14 | 瀚高基础软件股份有限公司 | Database index optimization method and readable storage medium |
| CN113392089B (en) * | 2021-06-25 | 2023-02-24 | 瀚高基础软件股份有限公司 | Database index optimization method and readable storage medium |
| CN113434587A (en) * | 2021-06-30 | 2021-09-24 | 青岛海尔科技有限公司 | Data storage and data query method and system |
| CN113434587B (en) * | 2021-06-30 | 2023-08-18 | 青岛海尔科技有限公司 | Data storage and data query method and system |
| CN114780325A (en) * | 2022-06-21 | 2022-07-22 | 新华三信息技术有限公司 | PCIe equipment detection method and device |
| CN114780325B (en) * | 2022-06-21 | 2022-09-30 | 新华三信息技术有限公司 | PCIe equipment detection method and device |
| CN115328366A (en) * | 2022-08-11 | 2022-11-11 | 北京智慧星光信息技术有限公司 | Million-level tree node searching and displaying method and system based on full path calculation |
| CN115328366B (en) * | 2022-08-11 | 2023-09-19 | 北京智慧星光信息技术有限公司 | Tens of millions of tree node searching and displaying method and system based on full path calculation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1307584C (en) | 2007-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1545048A (en) | Method for implementing tree storage and access by two-dimensional table | |
| CN1256732C (en) | Flash memory and control method | |
| CN101055589A (en) | Embedded database storage management method | |
| CN1311363C (en) | Methods and apparatus for generating a content address to indicate data units written to a storage system proximate in time | |
| CN1292370C (en) | Method and apparatus for data processing | |
| CN101064630A (en) | Data synchronization method and system | |
| CN101042696A (en) | Smart card storage system and managing method for file creation in the system | |
| CN1852137A (en) | Method for realizing synchronization of client end data and server end data | |
| CN1955958A (en) | Sort data storage and split catalog inquiry method based on catalog tree | |
| CN1229944A (en) | System and method for reducing footprint of preloaded classes | |
| CN1804840A (en) | Data access layer class generator | |
| CN1167014C (en) | File processing method, data processing device and storage medium | |
| CN1379350A (en) | Distributed document retrieval method, device, procedure and recording medium for recording said program | |
| CN1740978A (en) | Method for realing sharing internal stored data base and internal stored data base system | |
| CN1852101A (en) | Parallel downloading method and terminal | |
| CN1577287A (en) | Synchronizing logical views independent of physical storage representations | |
| CN1540524A (en) | Method for accessing distributed and virtualized storage in local network | |
| CN1331817A (en) | Method and appts. for concurrent DBMS table operations | |
| CN1929451A (en) | Method and device for solving Hash collision | |
| CN1492362A (en) | Data back up and recovering method of embedded data bank | |
| CN1846207A (en) | Type path indexing | |
| CN1538324A (en) | Method of raising officiency of data processing | |
| CN1680926A (en) | Computing device with relatively limited storage space and operating / file system thereof | |
| CN1848851A (en) | Computer and method for establishing light weight catalog access data protocol exchange format fragment | |
| CN1374587A (en) | Information management arrangement for obtaining data bank matching and medium for recording the same bank program |
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: 20070328 Termination date: 20141117 |
|
| EXPY | Termination of patent right or utility model |