CN1254069C - Method of storing and reading out data information through data information key field - Google Patents
Method of storing and reading out data information through data information key field Download PDFInfo
- Publication number
- CN1254069C CN1254069C CN 02146090 CN02146090A CN1254069C CN 1254069 C CN1254069 C CN 1254069C CN 02146090 CN02146090 CN 02146090 CN 02146090 A CN02146090 A CN 02146090A CN 1254069 C CN1254069 C CN 1254069C
- Authority
- CN
- China
- Prior art keywords
- equipment
- node
- data information
- leaf node
- data message
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention discloses a method for storing data information according to the key field of data information. When the method is used, a scattering tree which is formed by the connection of multistage non-leaf nodes and one-stage leaf nodes, is established in a network in advance and is reflected from a root node to a leaf node; the key field of the data information can be hashed and operated step by step according to the scattering tree, and the data information is reflected to the leaf node according to a step by step hashing and operation result; the data information is stored to a device corresponding to the leaf node. The present invention also discloses a method for correspondingly reading data information on the basis of data information storage, namely that the key field of the data information is hashed and operated step by step according to the scattering tree, the data information is reflected to the leaf node according to the step by step hashing and operation result, and the data information corresponding to the key field of the data information can be read in the device corresponding to the leaf node. When the present invention is used, the data information can be quickly and accurately read under the condition of the key field of the data information without device number information; thereby, the present invention is beneficial to the shift and the carrying of personal numbers.
Description
Technical field
The present invention relates to the data message access technique, be specifically related to a kind of method by storage of data message key and read data information.
Background technology
In today that telecommunications is popularized day by day, the quantity of telecommunication user also increases sharply.These users are after its telecommunication terminal of application adds communication network, and network needs the relevant information with all contracted users be placed on the network equipment such as location register etc.When call, the telephone number of network based calling is visited the equipment of these stored informations, and therefrom extracts the information relevant with call, thereby correctly continues this call.When number of users very for a long time, the quantity of these users' relevant information will be a very huge numeral.So how these lot of data are placed on respectively on the different equipment and manage, how these data that are stored on the equipment are carried out random access again, then directly have influence on the construction development and maintenance cost of whole telecommunication system and the efficient of running.
Present solution generally is for each data such as the telecommunication user personal information are numbered, for example telephone number or phone number, and this numbering is called as the key of these data.Realize coming the relevant data of random access according to key fully, for example pass through the CAMEL-Subscription-Information of phone number inquiring user etc., in the numbering that must guarantee to comprise in the key at present the equipment of storing this key corresponding data, the numbering of the attribution server of the data of key correspondence just, for example, the 4th to the 7th in the present phone number promptly is the numbering of the attaching position register of this phone number.
At present because user's migration geographically is very general, therefore also need to move with user-dependent data, like this after the data-moving equipment new to relocation site, corresponding equipment when Subscriber Number will no longer correspondingly be applied for number originally, therefore can not obtain user's current information by the original corresponding equipment of Subscriber Number, thereby force the user after moving to the other places, to need to apply for again new telephone number.And this will bring a lot of inconvenience to the user, and the user need tell the people that all need be got in touch with new telephone number, if the user moves frequent and need the people of contact a lot, this will be insufferable.Present mobile phone can be realized services of roaming, but when the roaming place is dialed or receive call, needs the payment roaming charges, has increased burden economically to the user.
If in the key of data such as telecom number, do not comprise device numbering, for example adopt the personal number technology, so just can address the above problem.No matter be landline telephone or mobile phone, after the user is moved to the other places, by personal information is moved to from existing equipment in the new equipment, can pass through to new equipment at new relocation site then and obtain data message and continue to use original personal number, will bring great convenience to the user.In order to satisfy this hope, can store user's personal information at random and adopt the method that all devices is carried out traversal queries to obtain user profile such as user's actual phone number, but this traversal visit needs a large amount of even all equipment of visit, and its efficient is very low.Simultaneously, also can adopt the mode of in network, broadcasting to solve this problem, but the data traffic between the increase equipment so significantly, for a lot of situation of equipment, this data traffic that rolls up might cause network paralysis, thereby communication network can not be run well.Therefore, at present these two kinds of ideas that propose are for solving this conception of adopting device independence coded access data message, all exist fatal defective and are difficult to realize.
Summary of the invention
In view of this, an object of the present invention is to overcome the deficiencies in the prior art, a kind of data storing method on equipment easily rapidly is provided.
Another object of the present invention provides a kind of method of obtaining data message rapidly easily.
The objective of the invention is to be solved by the following technical solutions:
A kind of method according to data message key storing data information comprises the steps:
A. in network, set up in advance and storage is mapped to the data message key scattering tree that is connected to form by multistage non-leaf node and one deck leaf node of leaf node from root node, the scattering tree is the table of comparisons of mapping step by step that reflects the equipment the network that is mapped to from the data message key, leaf node in the scattering tree points to equipment in the network, the hash operation method information that non-leaf node comprises child node quantity information at least and shines upon to child node;
B. according to scattering tree the key of data message is carried out hash computing step by step, and the data message key is mapped to the respective leaves child node according to hash operation result step by step;
C. in the network that will point to leaf node corresponding to the data information memory of data message key on the equipment.
In the method for above-mentioned storing data information, the child node quantity information that each non-leaf node comprises in the scattering tree can be identical with hash operation method information, also can be different.
In the method for above-mentioned storing data information, when the use capacity of data information stored in the equipment reaches the heap(ed) capacity threshold value of this equipment, can carry out dilatation to this equipment.
In the method for above-mentioned storing data information, when data message need be moved, can be that unit moves the total data information of this leaf node correspondence in the equipment in the destination device with the leaf node, and in the scattering tree, this leaf node corresponding equipment numbering is revised as the destination device numbering.
In the method for above-mentioned storing data information, when the use capacity of data information stored in the equipment reached the heap(ed) capacity threshold value of this equipment, the total data information that a leaf node of this equipment correspondence can be shone upon was moved in other equipment with respective stored space.
In the method for above-mentioned storing data information, when the use capacity of data information stored in the equipment reaches the heap(ed) capacity threshold value of this equipment, can a newly-built equipment, and will reach the total data information that the part leaf node is shone upon in the equipment of capacity threshold and move in the newly-built equipment.
In the method for above-mentioned storing data information, when the use capacity of data information stored in the existing equipment reaches the only corresponding leaf node of the heap(ed) capacity threshold value of this equipment and this existing equipment, can this leaf node be become non-leaf node by the growth pattern of scattering tree, and the son node number and the hash operation method of definite this node, then by this hash operation method, data message in this existing equipment is scattered in each child node of this node, and the pairing data of parton node are moved respectively in the miscellaneous equipment that comprises newly-built equipment, the data of other child node correspondences are retained in the existing equipment, other child node corresponding equipment are set in the scattering tree are numbered this existing equipment numbering.
In the method for above-mentioned storing data information, when the use capacity of data information stored is lower than the minimum capacity threshold value of equipment respectively in greater than 1 equipment, will merge in one of them described equipment by moving mode greater than all data messages in 1 the equipment.
In the method for above-mentioned storing data information, when all data message capacity of a non-leaf node mapping residual capacity less than another equipment, the total data information of this non-leaf node mapping is moved in another equipment, all leaf nodes in the scattering tree under this non-leaf node of deletion, make non-leaf node become leaf node, and make this node point to another equipment.
In the method for above-mentioned storing data information, when the data message of a non-leaf node correspondence has focused in some child nodes of this node, cancel this non-leaf node and other child nodes except that this child node, move on to the position of non-leaf node on the child node of in the scattering tree, data message being concentrated.
In the method for above-mentioned storing data information, the data message key can not comprise device numbering information.
A kind of at the read method of data information stored according to the method described above, comprise the steps:
A. according to the scattering tree data message key is carried out hash computing step by step;
B. according to hash operation result step by step the data message key is mapped to the respective leaves child node;
C. from the leaf node corresponding equipment, read data message corresponding to the data message key.
In the method for read data information, the data message key can not comprise device numbering information.
By technical scheme of the present invention as can be seen, owing to give data message distribute data information key in advance and the table of comparisons of mapping step by step of storing data information key and device numbering in network, when needs are stored certain data message, the data message key is carried out the hash computing, on the relevant device that data information memory is shone upon to the hash operation result according to operation result.If this equipment does not have enough memory spaces, then can move, methods such as equipment dilatation are solved by newly-built equipment, data message.Therefore, use the present invention data message can be stored in certain equipment quickly and easily.When needs during according to data message key read data information, by the table of comparisons between data information stored key and the data message, can determine the equipment of stored information according to the hash operation result apace by the some branches in the table, no longer need in network, visit all equipment, also no longer need in whole network, broadcast data, so just solved the shortcoming of prior art effectively, made the storage of whole data message and quick, the convenience, accurate and effective of the process that reads.
Description of drawings
Below in conjunction with the drawings and specific embodiments the present invention is further detailed.
Fig. 1 is the schematic diagram according to scattering tree of the present invention;
Fig. 2 is the schematic diagram according to a simple scattering tree of the present invention;
Fig. 3 is that the root node of the scattering tree of Fig. 2 is told child node schematic diagram afterwards;
Fig. 4 is that newly-built data equipment schematic diagram is afterwards gone up on the scattering tree basis of Fig. 3;
Fig. 5 is with the flow chart of the corresponding personal information storage of personal number to the data equipment process;
Fig. 6 is that the schematic diagram of basic enterprising line data information after moving set in the scattering of Fig. 1;
Fig. 7 is that the newdata equipment schematic diagram of line data information after moving of going forward side by side gone up on the scattering tree basis of Fig. 1;
Fig. 8 is the newdata equipment schematic diagram of line data information after moving of going forward side by side once more on the scattering tree basis of Fig. 7;
Fig. 9 is that data equipment merging schematic diagram is afterwards gone up on the scattering tree basis of Fig. 8.
Embodiment
In communication network, with personal information attribution server (PIHLR) storage user's personal information, the key of this personal information---do not comprise the numbering of PIHLR in the personal number.How following mask body introduction is by under the situation that does not comprise the PIHLR numbering in the key of personal information, rapidly the userspersonal information is assigned to some PIHLR, and when needs obtain user profile, directly navigate to the relevant PIHLR address of this personal number fast and therefrom obtain user profile.
After telephone network is set up, in the regional coverage scope that the local telephone network ruton reaches, set up PIHLR, be used to store the personal information data of all users in this area.The table of comparisons of personal number and PIHLR numbering is set, and is stored in the switch or other network equipments of network.Because the corresponding relation between personal number and the PIHLR numbering is tree, therefore is called the scattering tree.Fig. 1 shows the structure of a scattering tree.As can be seen, root node and 5 nodes of this scattering tree have direct corresponding relation, just have solid line directly to connect in the drawings in Fig. 1.The root node of scattering tree is called 0 grade of node, and 5 nodes that it comprised all are called 1 grade of node.In these 51 grade of nodes, the 3rd 1 grade of node and the 4th 1 grade of node comprise 5 child nodes and 7 child nodes again respectively, these are included in 1 grade of child node in the node are called 2 grades of nodes.As can see from Figure 1, in these all nodes, the all directly corresponding actual network equipment of the 1st 1 grade of node, the 2nd 1 grade of node and the 5th 1 grade of node and all 2 grades of nodes, be PIHLR, they are called leaf node, the just oval node that with dashed lines is connected with PIHLR among the figure, the wherein numbering of the PIHLR of their correspondences of Biao Zhu numeral.In the scattering tree, a root node can only be arranged, under root node, a plurality of 1 grade of node can be arranged according to power system capacity and number of users, simultaneously, below each 1 grade of node a plurality of 2 grades of nodes can be arranged, a plurality of 3 grades of nodes can also be arranged below each 2 grades of node, the rest may be inferred.Direct corresponding PIHLR equipment be leaf node, other nodes all are non-leaf nodes.Each non-leaf node of scattering tree all comprises this node method of traversal downwards, just be stored in by this non-leaf node in the table of comparisons of personal number in the network equipment and PIHLR numbering, all marked the method for how to locate its child node from this node downwards, this method comprises packet count under this node and the information such as hash operation method that are suitable for.
Fig. 1 is a scattering tree schematic diagram of basic forming.And at the beginning of network is set up, when number of users is also fewer, may have only a PIHLR, and the scattering tree also has only a root node, does not have child node, the direct corresponding PIHLR of root node, this situation is as shown in Figure 2.As can be seen, root node is exactly a leaf node in Fig. 2, and all users' personal information directly is mapped to PIHLR1 by root node.At this moment, because root node does not comprise child node, so it does not comprise grouping information and hash computing information yet.If in communication network, will increase a userspersonal information, directly this personal number is mapped to PIHLR1 by root node, and the personal information storage of this personal number correspondence is got final product to PIHLR1.
If because number of users increases, the maximum size threshold value that the stored amount of user information of PIHLR1 has reached its present maximum storage capacity or set in advance, for example 80% of the maximum storage capacity.So Xin Zeng user profile can not be inserted among the PIHLR1 again.In this case, can at first consider PIHLR1 is carried out dilatation.That is to say,, can carry out dilatation such as the way of memory banks such as database to it by increasing if when the present operable capacity of PIHLR1 does not reach its design maximum capacity as yet.Like this, just can renew the newly-increased userspersonal information of storage at original PIHLR1 relaying.
If original PIHLR has reached the design maximum capacity, can not be by the new personal information of way storage of dilatation, so just needing has increased new PIHLR.At first, newly-increased PIHLR is called PIHLR2.Because the leaf node of PIHLR1 correspondence has only a root node, at this moment, need select suitable packet count G and hash operation method according to Subscriber Number distribution characteristics among this PIHLR1, during the personal number packet map among the PIHLR1 divided into groups to G.Create a node with each grouping, be respectively Nodel～NodeG, and with the child node of this G node as root node.G node is divided into two groups of 1～m and m+1～G, allow the corresponding original PIHLR1 of first group of 1～m node, allow second group of m+1～G PIHLR2 that the node correspondence increases newly, and the personal number corresponding informance in m+1 among the original PIHLR1～G grouping is transferred among the newly-increased PIHLR2.
In this example, packet count G is 5, just is divided into 51 grade of nodes below root node, and they all point to PIHLR1, as shown in Figure 3.The hash operation method here is a known technology, can adopt a kind of concrete hash operation method at some nodes as the case may be in practical operation, and the hash operation method of different nodes can be different.Here can cite a plain example, for example personal number is made up of 6 bit digital, and the preceding 3 item sign indicating numbers of personal number are got remainder divided by 5, according to remainder personal number is mapped to respectively in 1 grade of different nodes.For example, remainder is 0 and is mapped to the 1st 1 grade of node that remainder is 1 and is mapped to the 2nd 1 grade of node that remainder is 2 and is mapped to the 3rd 1 grade of node that the rest may be inferred.Like this, just original all personal numbers of corresponding root node are mapped to respectively among 1 grade of different nodes.
In this example, m gets 3, is exactly the 1st, the 2nd and the 3rd the still corresponding PIHLR1 of 1 grade of node like this, all the other 2 then corresponding PIHLR2 of 1 grade of node.The corresponding personal information of personal number that will be mapped to all the other 21 grade of nodes is simultaneously moved the PIHLR2 from PIHLR1, and scattering tree structure afterwards as shown in Figure 4.
Introduced moving of data among PIHLR dilatation, the newly-built and PIHLR by simple example above.In order to be without loss of generality, at the scattering of Fig. 1 tree technical scheme of the present invention is carried out more comprehensively narration with system below.
In Fig. 1, according to the hash operation method that root node comprises, for example be that the preceding 3 item sign indicating numbers of personal number are got remainder divided by 5, the difference according to remainder is mapped to 1 grade of different nodes respectively with personal number then.If some 1 grade of pairing personal numbers of node are more, for example because local personal number is moved in the other places concentrates in this number segment, the node grouping method of so can be under this 1 grade of node telling about in again according to aforementioned newly-built PIHLR is divided into 2 grades of nodes of different numbers.The PIHLR that these 2 grades of nodes are corresponding different respectively.
As shown in Figure 5, on the basis of present scattering tree, if newly-increased people's number one by one need distribute its personal information and store among some PIHLR, then execution in step 501 at first promptly is mapped to some leaf nodes by the hash computing with personal number.Specifically, exactly personal number is calculated according to the hash operation method of root node, it is mapped to some 1 grade of nodes according to result of calculation.If this 1 grade of node is corresponding some PIHLR directly, that is to say that this 1 grade of node is a leaf node, then corresponding personal information is mapped directly to this PIHLR.If this 1 grade of node is not a leaf node, then proceed the hash computing according to this 1 grade of hash operation method that node comprised, this personal number is mapped to some 2 grades of nodes under this 1 grade of node, if these 2 grades of nodes are leaf nodes, then personal information is mapped among the PIHLR of these 2 grades of node correspondences.If these 2 grades of nodes also are not leaf nodes, then proceed the hash computing according to these 2 grades of hash operation methods that node comprised, this personal number is mapped to some 3 grades of nodes under these 2 grades of nodes.This process continues to carry out, till the some leaf nodes that this personal number are mapped to the scattering tree.
Then, system judges whether the PIHLR capacity of this leaf node correspondence full, if this PIHLR can also stored information, promptly execution in step 510, with the personal information storage of personal number correspondence in the PIHLR of this leaf node correspondence.
If the maximum size threshold value that this PIHLR has reached heap(ed) capacity or set in advance, for example 80% of heap(ed) capacity, and can not personal information be inserted among this PIHLR again, can consider so the data among the PIHLR are moved, it is execution in step 503, judge whether the data among this PIHLR can be moved, judge just whether other PIHLR have enough capacity to hold a part of data.If can store new personal information by data-moving, then execution in step 504 and 505 is moved the data among the corresponding PIHLR by the method that aforementioned data is moved, and revises the PIHLR numbering of interdependent node correspondence.Execution in step 510 then.
For example, with reference to the scattering of Fig. 1 set basic enterprising line data information move after and formation Fig. 6, the 4th 2 grades of nodes under the 3rd 1 grade of node among Fig. 1 corresponded to PIHLR2 originally.If the capacity of PIHLR2 has not allowed to store the operation of data again, the PIHLR2 that can search which leaf node correspondence, and calculate the personal number quantity of each node mapping of PIHLR2 correspondence, search the residual capacity of all the other each PIHLR then, the personal number quantity of each node mapping of the residual capacity of all the other PIHLR and above-mentioned PIHLR2 correspondence is compared, from all the other PIHLR, determine a suitable PIHLR, make its residual capacity can hold whole personal number corresponding informances of above certain 2 grades of suitable node mapping, for example find that PIHLR3 can hold all information of the 4th 2 grades of nodes under the 3rd 1 grade of node.Then, the corresponding information of the personal number of the mapping of the 4th 2 grades of node under the 3rd 1 grade of node is moved PIHLR3 from original PIHLR2, in mapping table, the PIHLR of this node correspondence is changed to PIHLR3 simultaneously.Through the scattering tree structure after the above-mentioned data-moving as shown in Figure 6.If newly-increased personal number is mapped to the 4th 2 grades of nodes the 3rd 1 grade of node under by the hash computing, then corresponding personal information storage is arrived PIHLR3.If newly-increased personal number is mapped to the 3rd all the other nodes under 1 grade of node by the hash computing, then still store corresponding personal information into PIHLR2.
If the capacity of judging all PIHLR in step 503 is all near saturated, and should not adopt the method for data-moving to insert newly-increased data, then execution in step 506, consider by aforementioned expansion method some PIHLR to be carried out dilatation.Can increase the total capacity of system like this, thereby newly-increased data can be stored among some PIHLR.If can be to the PIHLR dilatation, then execution in step 507, according to aforementioned expansion method corresponding PIHLR carried out dilatation.And then execution in step 510.
If judge that in step 506 PIHLR can not dilatation near the higher limit of design capacity, then execution in step 508, be newly-built PIHLR, then in step 509, with the data-moving in original PIHLR in newly-built PIHLR, execution in step 510 then, and the corresponding personal information of personal number is inserted among the corresponding PIHLR.
With reference to newdata equipment on the scattering of Fig. 1 tree basis go forward side by side line data information move after Fig. 7 of formation.For example, the PIHLR5 capacity of the 5th 1 grade of node correspondence among Fig. 1 has reached the threshold value of design capacity, and can not by data-moving and to PIHLR dilatation store newly-increased data, so needing has increased new PIHLR.At first, newly-increased PIHLR is called PIHLR6 in this example.The PIHLR5 that searched which leaf node correspondence then, the leaf node that can find corresponding PIHLR5 comprise the 6th and the 7th 2 grades of nodes under the 5th 1 grade of node, the 4th 1 grade of node.Calculate the personal number quantity of these three leaf node mappings, the maximum pairing user profile of that leaf node of mapping number of users is all moved among the newly-built PIHLR6, the personal number quantity that for example is the 5th 1 grade of node mapping is maximum, then all move its user information corresponding among the PIHLR6, and making this node point to PIHLR6, its result is as shown in Figure 7.
With reference on the scattering of Fig. 7 tree basis once more newdata equipment go forward side by side line data information move after Fig. 8 of formation.Has only one if reach the leaf node of the PIHLR correspondence of design capacity threshold value, for example the PIHLR6 among Fig. 7 is only corresponding to the 5th 1 grade of node, and PIHLR6 can not store new data again, at this moment, need a newly-built PIHLR7, according to the Subscriber Number distribution characteristics among the PIHLR6, select suitable packet count G and hash operation method, the personal number among the PIHLR6 is scattered in G the grouping.Create a node with each grouping, be respectively Node1～NodeG, and with the child node of this G node as the 5th 1 grade of node.2 grades nodes of this G are divided into two groups of 1～m and m+1～G, allow the corresponding original PIHLR6 of first group of 1～m node, allow second group of m+1～G PIHLR7 that the node correspondence increases newly, and the personal number corresponding informance in m+1 among the original PIHLR6～G grouping is transferred among the newly-increased PIHLR7.In this example, getting m is 1, and G is 3, and the hash operation method adopts the 4th number to the 6th composition of personal number to get remainder divided by 3.Like this, under the 5th 1 grade of node, the 1st the still corresponding PIHLR6 of 2 grades of nodes, all the other 2 then corresponding PIHLR7 of 2 grades of nodes.The corresponding personal information of personal number that will be mapped to the 2nd and the 3rd 2 grades of nodes is simultaneously moved the PIHLR7 from PIHLR6, and scattering tree structure afterwards as shown in Figure 8.The personal information of personal number correspondence can store among the corresponding PIHLR.
Told about above and how to be inserted among the actual PIHLR by the information of scattering tree with the personal number correspondence.Tell about some that to carry out for the structure of the scattering of moulding tree below and optimize, with the efficient that improves data information memory and read.
In the scattering tree, if the number of users of certain several PIHLR is considerably less, for example its existing information stored number is lower than 20% of actual capacity, just can consider PIHLR is merged.Fig. 9 with reference to formation after data equipment merges on the scattering tree basis of Fig. 8.For example, owing to user's migration or withdraw from reasons such as this network service, PIHLRI among Fig. 8 and the user capacity that node shone upon among the PIHLR2 are all near the capacity lower threshold, then all transfer to the personal user information among the PIHLR2 among the PIHLR1, simultaneously, with the pairing personal information attribution server numbering of those nodes of PIHLR2 correspondence in the scattering tree, all change PIHLR1 into.Scattering tree after this merging as shown in Figure 9.
When having only a child node to be non-NULL under the node, just the number of users of all leaf node mappings is zero under other child nodes, this knot removal that then will only comprise a non-NULL child node, and move one-level on the non-NULL child node that it is unique, for example moving from 2 grades of nodes is 1 grade of node.
All child nodes under a node all are leaf nodes, and when all pointing to same PIHLR, then this node can be changed to leaf node, and make it point to PIHLR, simultaneously, and all child nodes under original this node of deletion.
When a node is not a leaf node, its mapping number is S, and there is a PIHLR, after the existing number of users of this PIHLR adds S, still do not reach the maximum size threshold value of this PIHLR, then the user of this node mapping all can be moved under this PIHLR, then all leaf nodes under this node are all deleted, make this node become leaf node, and make this node point to this PIHLR.
For the moving of above-mentioned PIHLR, newly-built and merge and all will change the structure that scattering is set, therefore, these modifications need be broadcast to the respective switch in the network.
Like this,, shine upon the node that scattering is set step by step,, obtain the PIHLR address, the userspersonal information can be stored into this PIHLR like this from leaf node up to being mapped to leaf node by the hash computing according to personal number.When the call that receives at personal number, by personal number being carried out hash computing step by step, determine the leaf node of this personal number mapping, in the PIHLR of this leaf node correspondence, obtain corresponding user profile then, actual phone number for example, this calling can correctly continue.
Above embodiment introduced how to use the present invention field of telecommunications Rigen according to personal number access data on server.It will be appreciated by those skilled in the art that, thought of the present invention can also be applied to different occasions and environment with method, aspects such as computer network and database application, network management-application for example, store and reading of data on equipment as long as relate to, can use method provided by the invention by device coding.Therefore, the above-mentioned embodiment that is of the present invention as demonstration is not in order to restriction protection scope of the present invention.
Claims (13)
1. the method according to data message key storing data information comprises the steps:
A. in network, set up in advance and storage is mapped to the data message key scattering tree that is connected to form by multistage non-leaf node and one deck leaf node of leaf node from root node, described scattering tree is the table of comparisons of mapping step by step that reflects the equipment the network that is mapped to from the data message key, leaf node in the scattering tree points to equipment in the network, the hash operation method information that non-leaf node comprises child node quantity information at least and shines upon to child node;
B. the key of setting data message according to described scattering carries out hash computing step by step, and according to the described operation result of hash step by step the data message key is mapped to the respective leaves child node;
C. in the network that will point to described leaf node corresponding to the data information memory of described data message key on the equipment.
2. the method for storing data information according to claim 1 is characterized in that, the child node quantity information that each non-leaf node comprises in the described scattering tree can be identical with hash operation method information, also can be different.
3. the method for storing data information according to claim 1 is characterized in that, when the use capacity of data information stored in the equipment reaches the heap(ed) capacity threshold value of this equipment, this equipment is carried out dilatation.
4. the method for storing data information according to claim 1, it is characterized in that, when data message need be moved, with the leaf node is that unit moves the total data information of this leaf node correspondence in the equipment in the destination device, and in the scattering tree this leaf node corresponding equipment numbering is revised as the destination device numbering.
5. the method for storing data information according to claim 4, it is characterized in that, when the use capacity of data information stored in the equipment reaches the heap(ed) capacity threshold value of this equipment, the total data information of leaf node mapping of this equipment correspondence is moved in other equipment with respective stored space.
6. the method for storing data information according to claim 4, it is characterized in that, when the use capacity of data information stored in the equipment reaches the heap(ed) capacity threshold value of this equipment, a newly-built equipment, and will reach the total data information that the part leaf node is shone upon in the equipment of capacity threshold and move in the newly-built equipment.
7. the method for storing data information according to claim 4, it is characterized in that, when the use capacity of data information stored in the existing equipment reaches the only corresponding leaf node of the heap(ed) capacity threshold value of this equipment and this existing equipment, growth pattern by the scattering tree becomes this leaf node into non-leaf node, and the son node number and the hash operation method of definite this node, then by this hash operation method, data message in this existing equipment is scattered in each child node of this node, and the pairing data of parton node are moved respectively in the miscellaneous equipment that comprises newly-built equipment, the data of other child node correspondences are retained in the described existing equipment, described other child node corresponding equipment are set in the scattering tree are numbered this existing equipment numbering.
8. the method for storing data information according to claim 4, it is characterized in that, when the use capacity of data information stored is lower than the minimum capacity threshold value of equipment respectively in greater than 1 equipment, merge in one of them described equipment by moving mode greater than all data messages in 1 the equipment described.
9. the method for storing data information according to claim 4, it is characterized in that, when all data message capacity of a non-leaf node mapping residual capacity less than another equipment, the total data information of this non-leaf node mapping is moved in described another equipment, all leaf nodes in the scattering tree under this non-leaf node of deletion, make described non-leaf node become leaf node, and make this node point to described another equipment.
10. the method for storing data information according to claim 1, it is characterized in that, when the data message of a non-leaf node correspondence has focused in some child nodes of this node, cancel this non-leaf node and other child nodes except that this child node, move on to the position of described non-leaf node on the child node of in the scattering tree, data message being concentrated.
11. the method according to the described storing data information of arbitrary claim in the claim 1 to 10 is characterized in that described data message key does not comprise device numbering information.
12. one kind at the read method according to the described method data information stored of claim 1, it comprises the steps:
A. according to the scattering tree data message key is carried out hash computing step by step;
B. according to the described operation result of hash step by step the data message key is mapped to the respective leaves child node;
C. from the network equipment that described leaf node points to, read data message corresponding to described data message key.
13. the method for read data information according to claim 12 is characterized in that, described data message key does not comprise device numbering information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02146090 CN1254069C (en) | 2002-10-30 | 2002-10-30 | Method of storing and reading out data information through data information key field |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02146090 CN1254069C (en) | 2002-10-30 | 2002-10-30 | Method of storing and reading out data information through data information key field |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1494301A CN1494301A (en) | 2004-05-05 |
| CN1254069C true CN1254069C (en) | 2006-04-26 |
Family
ID=34232619
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 02146090 Expired - Fee Related CN1254069C (en) | 2002-10-30 | 2002-10-30 | Method of storing and reading out data information through data information key field |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1254069C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8072903B2 (en) * | 2006-05-30 | 2011-12-06 | Genband Us Llc | Methods, systems, and computer program products for performing range-based directory number (DN) screening |
| CN104598547B (en) * | 2014-12-30 | 2018-05-08 | 深圳市海蕴新能源有限公司 | Data access processing method and device based on big data |
| US10262012B2 (en) * | 2015-08-26 | 2019-04-16 | Oracle International Corporation | Techniques related to binary encoding of hierarchical data objects to support efficient path navigation of the hierarchical data objects |
| CN106919368B (en) * | 2017-01-12 | 2019-01-29 | 北京中科睿芯科技有限公司 | Accelerated method, acceleration system, device and the chip in a kind of streamed data stream graph key path |
-
2002
- 2002-10-30 CN CN 02146090 patent/CN1254069C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1494301A (en) | 2004-05-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1074891C (en) | Maintaining group data in a mobile communications system | |
| CN1203681C (en) | System for converting routing address within telecommunications network | |
| CN1123266C (en) | Routing incoming call to ported mobile station within telecommunications network | |
| CN1109444C (en) | A configuration method for a data management system | |
| CA2243343C (en) | Method and apparatus supporting non-geographic telephone numbers | |
| US5577246A (en) | Database memory compaction and reclamation method | |
| CN1254069C (en) | Method of storing and reading out data information through data information key field | |
| CN1293716C (en) | Metod for displaying main calling number in CDMA network | |
| CN1192835A (en) | Arrangement and method relating to information managing system | |
| CN1349720A (en) | Signalling in a telecommunications network | |
| CN100397816C (en) | Method for classifying received data pocket in network apparatus | |
| CN1149891C (en) | Method for realizing local mobile intelligent network | |
| CN101039287A (en) | Number receiving method for accessing gateway equipment | |
| CN1298152C (en) | Method of handset dialing automatic additional dialing IP | |
| Pitoura et al. | Distributed location databases for tracking highly mobile objects | |
| CN1283117C (en) | Method of calling short dialing to client setup by cluster system | |
| CN1258902C (en) | Multiple-signalling point and multiple-protocal method | |
| CN1842171A (en) | A method of call connection | |
| CN1135801C (en) | Routing method for signaling No.7 network management system | |
| CN1499890A (en) | Method for assigning roaming number of mobile user | |
| CN1929518A (en) | Method, system and device for realizing NP business | |
| CN1505321A (en) | A GT translation method for realizing load sharing between multiple signaling points | |
| AU694526B2 (en) | Method for storing analysis data in a telephone exchange | |
| CN100407740C (en) | Priority local calling method for local transitional personal number | |
| CN100563374C (en) | Global title translation device and global title's processing method |
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: 20060426 Termination date: 20181030 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |