CN100468410C - Method and system for building internal memory tree - Google Patents
Method and system for building internal memory tree Download PDFInfo
- Publication number
- CN100468410C CN100468410C CNB2007100763417A CN200710076341A CN100468410C CN 100468410 C CN100468410 C CN 100468410C CN B2007100763417 A CNB2007100763417 A CN B2007100763417A CN 200710076341 A CN200710076341 A CN 200710076341A CN 100468410 C CN100468410 C CN 100468410C
- Authority
- CN
- China
- Prior art keywords
- node
- internal memory
- tree
- deletion
- memory tree
- 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.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses a constructing method and system of internal memory tree in the computer network communication domain, which comprises the following steps: allocating a fixed internal memory for the internal memory tree; initiating the fixed internal memory; placing the non-used node from fixed internal memory into free queue; placing the used node into the used queue; judging whether the node exists in the free queue; adopting the node as plugging point to plug into internal memory tree if existing node; deleting a node in the internal memory tree if not existing; plugging the node as plugging point into the internal memory tree. The invention can plug data infinitely and release node automatically, which is not limited by internal memory space.
Description
Technical field
The invention belongs to computer network communication field, relate in particular to a kind of method and system that make up the internal memory tree.
Background technology
Tree is a kind of good data structure, and data structure is that the inside of data of reflection constitutes, and promptly data are made of those data elements, and what structure these data elements are.A kind of design of high-efficient algorithm relies on a kind of good data structure, to accelerate the speed that internal storage data inserts, inquires about, deletes.
The method that makes up the internal memory tree in the prior art mainly contains and makes up the internal memory binary search tree and make up the internal memory RBTree, wherein:
The construction method of binary search tree is as described below: the tree root that at first makes up binary search tree, be inserted into node in the binary search tree one by one then, the process of inserting a node in binary search tree is as follows, see also Fig. 1 a to Fig. 1 d, the key value of supposing to be inserted into node is 20, the key value 20 that at first will be inserted into node and the key value 90 of tree root relatively, if be inserted into the key value that the key value of node is less than or equal to tree root, then enter left subtree, otherwise enter right subtree.In subtree, will be inserted into the key value 20 of node and the key value of subtree root again and compare, and the like, up to new node is inserted in the binary search tree.When making up binary search tree, internal memory is dynamic change according to inserting increasing of node, thereby inserts at internal storage data, will produce a large amount of memory fragmentations in the delete procedure.When in binary search tree, inserting same node point, this is inserted into node is inserted in the binary search tree and is inserted in the left subtree of the identical node of node with this, thereby when in binary search tree, inserting a large amount of same node point, the height of binary search tree increases, thereby increases the speed that internal storage data inserts, inquires about and delete.
The process of a node of deletion is as follows in binary search tree, see also Fig. 2, it is according to treating that the difference of the child node of deletion of node has three kinds of forms, when treating that only there is left child in deletion of node, delete this and treat deletion of node, and replace this to treat deletion of node with this left child who treats deletion of node; When there is not left child in the right child who treats deletion of node, then deletes this and treat deletion of node, and replace this to treat deletion of node with this right child who treats deletion of node; When this treats that there is left child in the right child of deletion of node, then delete this and treat deletion of node, and replace this to treat deletion of node with this node for the treatment of key value minimum in the right subtree of deletion of node.Deletion of node automatically in binary search tree needs operator's deletion of node voluntarily, the releasing memory space, thus make the quantity that is inserted into the node in the binary search tree be subjected to the restriction of memory headroom size.
RBTree is a kind of binary search tree that has increased color attribute for each node.The method that makes up RBTree is similar to the structure binary search tree, difference is, when in RBTree, inserting node and deletion of node, at first after the insertion and deletion of carrying out node by the insertion and the delet method of binary search tree node, the RBTree that inserts and the deletion back forms is carried out anticlockwise (Left-Rotate) or right rotation (Right-Rotate), adjust the structure of this RBTree, to keep the balance of RBTree.When making up RBTree, internal memory also is along with the insertion dynamic change of node, thereby will produce a large amount of memory fragmentations in the process that makes up RBTree; When making up RBTree, its memory node can't discharge automatically, thereby makes the quantity of inserting node be subjected to the restriction in memory space; When inserting same node point in RBTree, the height of RBTree will increase, and make when a large amount of same node point are inserted, and reduce the speed of RBTree insertion, deletion and inquiry.
Summary of the invention
The purpose of the embodiment of the invention is to provide a kind of method that makes up the internal memory tree, is intended to solve when making up the internal memory tree in the prior art internal memory dynamic change and produce a large amount of memory fragmentations, the problem in releasing memory space automatically simultaneously.
The embodiment of the invention is achieved in that a kind of method that makes up the internal memory tree, and described method comprises the steps:
For the internal memory tree is distributed a fixed memory, and described fixed memory is carried out initialization, untapped node in the described fixed memory is put into idle queues, the node that has used is put into used formation; Judge and whether have node in the described idle queues, if have node in the described idle queues, and when also not having the internal memory tree in the described fixed memory, then described node is created as the tree root of internal memory tree, if have node in the described idle queues, and there is the internal memory tree in the described fixed memory, then described node is inserted in the described internal memory tree as being inserted into node, if there is not node in the described idle queues, then node of deletion from described internal memory tree is inserted into described node in the described internal memory tree as being inserted into node again.
Another purpose of the embodiment of the invention is to provide a kind of system that makes up the internal memory tree, and described system comprises:
Idle queues is used for depositing the untapped node of described internal memory;
Use formation, be used for depositing the node that has used of described internal memory;
Memory Allocation and initialization module are used to the internal memory tree to distribute a fixed memory, and described fixed memory are carried out initialization, and untapped node in the described fixed memory is put into described idle queues, and the node that has used is put into the described formation of having used;
Idle queues node judge module is used for judging whether described idle queues exists node;
Internal memory tree node removing module is used for from node of described internal memory tree deletion; And
Internal memory tree node insert module, be used for when there is not the internal memory tree in described fixed memory, node in the described idle queues is created as the tree root of internal memory tree, and in described fixed memory, have internal memory when tree, the node in the described idle queues is inserted into during described internal memory sets as being inserted into node.
In embodiments of the present invention, by distributing a fixed memory for the internal memory tree, thereby in data insertion, deletion action, there is not memory fragmentation, before inserting data, judges whether memory headroom is full simultaneously, as full, then from the internal memory tree, discharge storage space earlier, insert data again, thereby realized the automatic deletion of data, can infinitely insert data, and not be subjected to the restriction of memory headroom.
Description of drawings
Fig. 1 a to Fig. 1 d is the schematic flow sheet that inserts node in binary search tree that prior art provides;
Fig. 2 is the schematic flow sheet of deletion of node in binary search tree that prior art provides;
Fig. 3 is the realization flow figure of the method for the structure internal memory tree that provides of the embodiment of the invention;
Fig. 4 is the realization flow figure of the method for node of inserting in internal memory tree that provides of the embodiment of the invention;
Fig. 5 a to Fig. 5 e is the schematic flow sheet that inserts node in the internal memory tree that the embodiment of the invention provides;
Fig. 6 is the schematic flow sheet of deletion of node from internal memory tree that the embodiment of the invention provides;
Fig. 7 is the structural drawing of the system of the structure internal memory tree that provides of the embodiment of the invention.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer,, the present invention is further elaborated below in conjunction with drawings and Examples.Should be appreciated that specific embodiment described herein only in order to explanation the present invention, and be not used in qualification the present invention.
In embodiments of the present invention, for the internal memory tree is distributed a fixed memory, and this fixed memory carried out initialization, and untapped node is put to idle queues, in this fixed memory, insert when being inserted into node, earlier judge whether node is arranged in this idle queues, if have, then this is inserted into node and inserts in the internal memory tree, if there is no, then from the internal memory tree, behind node of deletion, will be inserted into node again and insert in the internal memory tree earlier.
The realization flow of the method that the structure internal memory that Fig. 3 shows the embodiment of the invention to be provided is set, details are as follows:
In step S301, disposablely is that the internal memory tree distributes the fixing internal memory of a storage space, thereby in internal memory, inserts, during deletion of node, do not have memory fragmentation.This fixed memory of initialization, wherein initialization comprises the size of determining this fixed memory space, and the size of determining minimum data unit (node) in this fixed memory, simultaneously untapped node in the fixed memory is put to idle queues, the node that has used is put to using formation etc.Adopt the operating position used formation and idle queues record node, be used for the release and the distribution of management node, memory headroom is received rational application;
In step S302, judge whether there is node in the above-mentioned idle queues, promptly judge this fixed memory whether less than, if there is no, execution in step S303 then, otherwise execution in step S304.If this internal memory also is not used, then as long as the fixed memory that in step S301, distributes big or small non-vanishing, behind step S302, i.e. execution in step S304;
In step S303, node of deletion from the internal memory tree.When fixed memory is expired, node of deletion from the internal memory tree automatically, the releasing memory space, thus can be in this internal memory tree unlimited insertion node, and be not subjected to the restriction in memory space;
In step S304, the node that is inserted into is inserted in the internal memory tree to make up the internal memory tree.If before being inserted into the node insertion, this internal memory tree does not exist, and then according to the tree root construction method of RBTree, will be inserted into the tree root that node is configured to the internal memory tree.The method of inserting node in the internal memory tree is similar to the method for insertion node in the RBTree, its difference part is, in the internal memory tree, adopt formation that same node point is handled, when promptly in internal memory tree, inserting an identical node, this node is inserted into the end of the formation that all nodes identical with this node are formed in the internal memory tree.By adopting the identical a plurality of nodes of queue processing key value, when making the node that a large amount of key values of insertion are identical in internal memory is set, can not increase the height of internal memory tree, thereby can not influence the speed of in the internal memory tree, inserting, inquiring about and delete set-point.
Fig. 4 shows the realization flow that inserts node in the internal memory tree that the embodiment of the invention provides, and details are as follows:
In step S401, judge whether there is node in the idle queues, when having node in the idle queues, promptly memory headroom less than the time, execution in step S402, otherwise execution in step S408;
In step S402, from this idle queues, extract a node;
In step S403, the node that extracts is put to the end of using formation;
In step S404, as being inserted into node, and this key value that is inserted into node is set to be inserted into the key value of data with this node;
In step S405, judge in this internal memory tree whether have the identical node of key value that is inserted into node with this, if exist, execution in step S406 then, otherwise execution in step S407;
In step S406, this is inserted into node is inserted in the internal memory tree and this end that is inserted into the formation that all identical nodes of the key value of node form, node inserts and finishes.Promptly in the internal memory tree, adopt formation that the node with identical key value is handled, make when in the internal memory tree, inserting the node of a large amount of identical key values, can not increase the height of tree, thereby can not influence the speed of insertion in the internal memory tree, inquiry and deletion set-point.
In step S407, this node that is provided with key value is inserted in this internal memory tree according to the method for inserting node in RBTree, node inserts and finishes.Because inserting the method for node in RBTree is prior art, in embodiments of the present invention, repeats no more.
In step S408, extract a node from the row head that uses formation;
In step S409, judge in the internal memory tree whether have the node identical with the key value of this node, if exist then execution in step S410, otherwise execution in step S411;
In step S410, in the formation that the node identical with the key value of this node formed from internal memory tree behind this node of deletion, execution in step S403;
In step S411, directly from internal memory tree behind this node of deletion, execution in step S403.Directly the method for deletion of node is consistent with the method for deletion of node in the RBTree from the internal memory tree, because the method for deletion of node is a prior art in the RBTree, in embodiments of the present invention, repeats no more;
Fig. 5 a to Fig. 5 e shows the process of inserting node in the internal memory tree that the embodiment of the invention provides, and to represent the color of this node be black to the thick line node among the figure, and details are as follows:
Suppose that the key value that is inserted into data simultaneously is 20 in the internal memory tree that has existed in the fixed memory shown in Fig. 5 a.At first judge whether node is arranged in the idle queues, if have, then from idle queues, extract a node, and this node is put to the end of using formation, as being inserted into node, the key value that is inserted into node simultaneously is set to be inserted into the key value 20 of data with this node.Its insertion process sees also Fig. 5 b to Fig. 5 e, compare being inserted into the key value 20 of node and the key value 90 of the tree root node that internal memory is set, owing to be inserted into the key value 90 of the key value 20 of node less than the tree root node, the key value 20 that the is inserted into node key value 50 with the root node of the left subtree of tree root node is compared, the rest may be inferred, when finding to exist in this internal memory tree the key value node identical with the key value 20 that is inserted into node, to be inserted into the end that node is inserted into the formation that all node identical with the key value that is inserted into node form, node inserts and finishes.When the identical node that do not exist in this internal memory tree with the key value that is inserted into node, the insertion process that is inserted into node is consistent with the process of insertion node in the RBTree, owing to being prior art, repeats no more in embodiments of the present invention.
The flow process of deletion of node from the internal memory tree that Fig. 6 shows that the embodiment of the invention provides, details are as follows:
Wherein to represent the color of this node be black to the thick line node, node to be deleted is not for the node that fracture line indicated of breakpoint, it as key value 20 node, the node that fracture line indicated of band breakpoint is for when needs are deleted certain node, being used for of searching replaces this to treat the node of deletion of node, is 20 node as key value.When not having node in the idle queues, then extract a node as treating deletion of node from the row head that uses formation, suppose to treat that the key value of deletion of node is 20, owing to have the key value node identical in the internal memory tree, from the formation that all node identical with the key value for the treatment of deletion of node formed, delete and treat deletion of node with the key value 20 for the treatment of deletion of node.When not having the key value node identical in the internal memory tree with the key value 20 for the treatment of deletion of node, this method for the treatment of deletion of node of deletion is consistent with the method for deletion of node in the RBTree from the internal memory tree, owing to be prior art, repeat no more in embodiments of the present invention.
Fig. 7 shows the system of the structure internal memory tree that the embodiment of the invention provides, for the ease of explanation, only show the part relevant with the embodiment of the invention.
Memory Allocation and initialization module 71 are set the fixing internal memory of storage size of disposable distribution for making up internal memory, and this fixed memory carried out initialization, determine the size of this fixed memory and the size of determining minimum data unit (node) in this fixed memory, untapped node is put to idle queues 74, will be used node to put to using in the formation 76.
When in this fixed memory, making up the internal memory tree, at first make up the tree root of internal memory tree, again each node is inserted into one by one in this internal memory tree and can makes up internal memory tree according to the construction method of RBTree tree root.In the time of in node being inserted the internal memory tree, idle queues node judge module 72 judges in this idle queues 74 whether have node earlier, if have node in this idle queues 74, illustrate internal memory less than, can in this internal memory tree, insert and be inserted into node, will be inserted into node by internal memory tree node insert module 73 and insert in the internal memory tree; If do not have node in this idle queues 74, illustrate that internal memory is full, from use formation 76, extract a node by internal memory tree node removing module 75, and this node after the deletion, is inserted into node by internal memory tree node insert module 73 with this and inserts the internal memory tree from the internal memory tree.
In internal memory tree node insert module 73, at first from idle queues 74, extract a node by idle queues node extraction module 731, node inserts and has used formation module 732 that the node that extracts is inserted into the end of using formation 76, the key value that the node key value is provided with module 733 these nodes is set to be inserted into the key value of data, with this node as being inserted into node, same node point is inserted judge module 734 according to the key value search internal memory tree that is inserted into node, judges in the internal memory tree whether have the key value node identical with the key value that is inserted into node.If exist, then will be inserted into the end that node is inserted into the formation that all nodes identical with the key value that is inserted into node are formed in the internal memory tree by same node point insert module 735; Otherwise will be inserted into node by node insert module 736 according to the node insertion method of RBTree is inserted in the internal memory tree.
When expire in the fixed memory space, used formation node extraction module 751 to extract a node as treating deletion of node from the row head that uses formation 76, whether there is the identical node of key value for the treatment of deletion of node with this in the key value search internal memory tree of same node point deletion judge module 752 according to the node that extracts, if exist, same node point removing module 753 is treated the formation that the identical node of key value of deletion of node forms deletion from internal memory tree and this, and this treats deletion of node, treats deletion of node otherwise delete this according to the method for deletion of node in the RBTree by knot removal module 754 from the internal memory tree.
In embodiments of the present invention,, thereby in the internal memory tree, insert in the operation of node, do not have memory fragmentation for internal memory is set the internal memory of a fixed size of disposable distribution; Before in the internal memory tree, inserting node, judge whether memory headroom is full, full as memory headroom, then from the internal memory tree, insert node again behind node of deletion automatically, realize the automatic release of node, thereby in the internal memory tree, can infinitely insert node, and be not subjected to the restriction in memory space; In the internal memory tree, adopt the identical a plurality of nodes of queue processing key value, make when in internal memory is set, inserting a large amount of same node point, can not increase the height of internal memory tree, thereby the integral body that can not influence the internal memory tree is inserted, inquired about and the speed of deletion.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1, a kind of method that makes up the internal memory tree is characterized in that described method comprises the steps:
For the internal memory tree is distributed a fixed memory, and described fixed memory is carried out initialization, untapped node in the described fixed memory is put into idle queues, the node that has used is put into used formation; Judge and whether have node in the described idle queues, if have node in the described idle queues, and when also not having the internal memory tree in the described fixed memory, then described node is created as the tree root of internal memory tree, if have node in the described idle queues, and there is the internal memory tree in the described fixed memory, then described node is inserted in the described internal memory tree as being inserted into node, if there is not node in the described idle queues, then node of deletion from described internal memory tree is inserted into described node in the described internal memory tree as being inserted into node again.
2, the method for structure internal memory as claimed in claim 1 tree is characterized in that, described described node is inserted into the step of described internal memory in setting and is specially as being inserted into node:
From described idle queues, extract described node;
Described node is put to the described formation end of having used;
As being inserted into node, and the described key value that is inserted into node is set to be inserted into the key value of data with described node;
Judge in the described internal memory tree and whether have key value and the described identical node of key value that is inserted into node, if exist, the described node that is inserted into is inserted in the internal memory tree formation end that the node identical with the described key value that is inserted into node formed, if there is no, then the described node that is inserted into is inserted in the described internal memory tree.
3, the method for structure internal memory tree as claimed in claim 1 is characterized in that, described step of deleting a node from described internal memory tree is specially:
Extract a node in the described row head that has used formation, with described node as treating deletion of node;
Judge in the described internal memory tree whether exist and the described identical node of key value for the treatment of deletion of node, if exist, the described deletion of node for the treatment of of deletion in the formation that the node identical with the described key value for the treatment of deletion of node formed from described internal memory tree then, if there is no, then from described internal memory tree, delete the described deletion of node for the treatment of.
4, a kind of system that makes up the internal memory tree is characterized in that described system comprises:
Idle queues is used for depositing the untapped node of described internal memory;
Use formation, be used for depositing the node that has used of described internal memory;
Memory Allocation and initialization module are used to the internal memory tree to distribute a fixed memory, and described fixed memory are carried out initialization, and untapped node in the described fixed memory is put into described idle queues, and the node that has used is put into the described formation of having used;
Idle queues node judge module is used for judging whether described idle queues exists node;
Internal memory tree node removing module is used for from node of described internal memory tree deletion; And
Internal memory tree node insert module, be used for when there is not the internal memory tree in described fixed memory, node in the described idle queues is created as the tree root of internal memory tree, and in described fixed memory, have internal memory when tree, the node in the described idle queues is inserted into during described internal memory sets as being inserted into node.
5, the system of structure internal memory tree as claimed in claim 4 is characterized in that described internal memory tree node insert module comprises:
Idle queues node extraction module is used for extracting described node from described idle queues;
Node inserts and has used the formation module, is used for described node is put to the described formation end of having used;
The node key value is provided with module, be used for described node as being inserted into node, and the described key value that is inserted into node is set to be inserted into the key value of data;
Identical insertion node judge module is used for judging whether described internal memory tree exists key value and the described identical node of key value that is inserted into node;
The same node point insert module is used for the described node that is inserted into is inserted into the formation end that the internal memory tree node identical with the described key value that is inserted into node formed; And
The node insert module is used for the described node that is inserted into is inserted into described internal memory tree.
6, the system of structure internal memory tree as claimed in claim 4 is characterized in that described internal memory tree node removing module comprises:
Used formation node extraction module, be used for extracting a described node that has used the row head of formation, and with described node as treating deletion of node;
Identical deletion of node judge module is used for judging whether described internal memory tree exists and the described identical node of key value for the treatment of deletion of node;
The same node point removing module is used for the described deletion of node for the treatment of of deletion from the formation that the described internal memory tree node identical with the described key value for the treatment of deletion of node formed; And
The knot removal module is used for from the described deletion of node for the treatment of of described internal memory tree deletion.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100763417A CN100468410C (en) | 2007-06-27 | 2007-06-27 | Method and system for building internal memory tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100763417A CN100468410C (en) | 2007-06-27 | 2007-06-27 | Method and system for building internal memory tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101082929A CN101082929A (en) | 2007-12-05 |
| CN100468410C true CN100468410C (en) | 2009-03-11 |
Family
ID=38912502
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007100763417A Active CN100468410C (en) | 2007-06-27 | 2007-06-27 | Method and system for building internal memory tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100468410C (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101339568B (en) * | 2008-08-21 | 2012-01-25 | 金蝶软件（中国）有限公司 | Method and device for constructing data tree |
| CN102012870B (en) * | 2010-11-18 | 2012-05-23 | 清华大学 | Memory allocation method |
| CN103049445B (en) * | 2011-10-12 | 2017-10-27 | 深圳市世纪光速信息技术有限公司 | A kind of method, system and picture state server for inquiring about pictorial information |
| CN103699681B (en) * | 2013-12-31 | 2017-01-04 | 华为技术有限公司 | The treating method and apparatus of data rewind |
| CN105138466A (en) * | 2015-07-15 | 2015-12-09 | 贵阳朗玛信息技术股份有限公司 | Element storage method and apparatus |
| CN108073652B (en) * | 2016-11-16 | 2021-06-18 | 南京南瑞继保电气有限公司 | Event grouping optimization storage method |
| CN112559532B (en) * | 2020-12-23 | 2024-02-20 | 北京梆梆安全科技有限公司 | Data insertion method and device based on red and black trees and electronic equipment |
-
2007
- 2007-06-27 CN CNB2007100763417A patent/CN100468410C/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN101082929A (en) | 2007-12-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100468410C (en) | Method and system for building internal memory tree | |
| CN102982141B (en) | A kind of method and device realizing distributed data base agency | |
| CN104731799B (en) | Main memory DBM device | |
| CN104778222B (en) | Media library based on USB storage device is established and update method | |
| CN101137133B (en) | Method and apparatus for updating group information of cluster system | |
| CN101442558B (en) | Method and system for providing index service for P2SP network | |
| US8898677B2 (en) | Data arrangement calculating system, data arrangement calculating method, master unit and data arranging method | |
| CN100463534C (en) | A single board version management method for plug and play | |
| CN101453447A (en) | Customer aging method for dynamic host configuration protocol DHCP and access equipment | |
| CN102202087A (en) | Method for identifying storage equipment and system thereof | |
| CN103455433A (en) | Memory management method and system | |
| CN106960011A (en) | Metadata of distributed type file system management system and method | |
| CN105320676A (en) | Customer data query service method and device | |
| CN103441999A (en) | Control method for socket connection pool | |
| CN106855788A (en) | A kind of Memory Allocation management method of heap space | |
| CN101778131A (en) | Data synchronization system | |
| CN106776356A (en) | A kind of system and method for realizing that internal memory is interactive at a high speed | |
| CN112804276B (en) | Virtual broadband remote access server, control method thereof and communication system | |
| CN110162395A (en) | A kind of method and device of Memory Allocation | |
| CN110543357B (en) | Method, related device and system for managing application program object | |
| CN103324732A (en) | MySQL database horizontal-sharding method, and MySQL connection establishment method and device | |
| CN106027419A (en) | Data structure management method and device | |
| CN102148757B (en) | A kind of multiple nucleus system message distributing method and device | |
| CN104166820A (en) | Data management method and system | |
| CN110019057A (en) | Request processing method and device |
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 | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160106 Address after: The South Road in Guangdong province Shenzhen city Fiyta building 518057 floor 5-10 Nanshan District high tech Zone Patentee after: Shenzhen Tencent Computer System Co., Ltd. Address before: Shenzhen Futian District City, Guangdong province 518044 Zhenxing Road, SEG Science Park 2 East Room 403 Patentee before: Tencent Technology (Shenzhen) Co., Ltd. |