CN105389360A - AVL tree-based data writing method and apparatus - Google Patents
AVL tree-based data writing method and apparatus Download PDFInfo
- Publication number
- CN105389360A CN105389360A CN201510745287.5A CN201510745287A CN105389360A CN 105389360 A CN105389360 A CN 105389360A CN 201510745287 A CN201510745287 A CN 201510745287A CN 105389360 A CN105389360 A CN 105389360A
- Authority
- CN
- China
- Prior art keywords
- node
- value
- balance factor
- velskii
- adelson
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
Abstract
The present invention discloses an AVL tree-based data writing method and apparatus, which use a read-write lock for performing concurrency control on data writing. The method comprises: receiving a data write request; determining a search path according to sizes of written node value and characteristics of an AVL tree; determining whether each node in the search path is in a lock state, wherein the lock state is that when a first node in a currently concurrent write operation is a root node of a subtree locally adjusted, the first node is set into a locked state; If no node in the search path is in the lock state, performing the write operation; and if a certain node in the search path is in the lock state, blocking the write operation up to the locked node until the lock state of the locked node is canceled. According to the AVL tree-based data writing method and apparatus provided by the present invention, parallel processing is allowed to be performed on the write operation without a conflict in the local of the AVL tree, thereby improving data writing performance.
Description
Technical field
The present invention relates to field of computer technology, particularly relate to a kind of method for writing data based on Adelson-Velskii-Landis tree and device.
Background technology
Adelson-Velskii-Landis tree is also called balanced binary tree (BalancedBinaryTree), has following character: be that the absolute value of the difference in height of an empty tree or its two subtrees in left and right is no more than 1, and two, left and right subtree is all a balanced binary tree.Because its special structure, at the index of single-threaded data with in depositing, compare linear data structure and there is better performance; But the lock mechanism due to concurrent protection introducing during multi-thread access is perfect not, causes it to have performance bottleneck.
RBTree (RedBlackTree) is a kind of self-equilibrating binary search tree, RBTree and Adelson-Velskii-Landis tree similar, be all carry out inserting and deletion action time keep the balance of binary search tree by specific operation, thus the search performance that acquisition is higher.Although it is complicated, its worst case working time is also very good, and is efficient in practice, and it can be searched in time at O (logn), insert and deletion action.
In linux kernel, the mechanism of current con current control mainly comprises: spin lock, semaphore, atomic operation, also has the Read-Write Locks based on spin lock design.Spin lock uses busy waiting lock to guarantee a kind of adhoc approach of mutual exclusion lock, for be critical section; Two primitive operations that semaphore comprises a variable and carries out it, this variable is just referred to as semaphore, for be critical section; Atomic lock is that atomic operation can not by other task to tuning to open, for be single variable; Read-Write Locks is a mutation of spin lock, and compared with general spin lock, spin lock once can only have a process to enter critical section, and for Read-Write Locks, if process reads, that just can have multiple process to enter critical section simultaneously, and if write, then only have one passable.Obviously, Read-Write Locks compares other three kinds of mechanism, with the obvious advantage under reading to write few scene more.
A RBTree storing desired data, when synchronization only has a write request to arrive, only needs to navigate to according to the search strategy of binary search tree the node needing amendment, does not now need con current control.When synchronization has multiple write request to arrive the tree root of RBTree, simple process locks to the root node of RBTree exactly, then issues request successively, just can ensure the integrality of critical resource.But this processing mode is not when the searching route that two requests will revise node is conflicted, also originally can the request that searching route is not conflicted be issued with regard to saying simultaneously, but must wait for that last request just can issue after completing, the time that this waiting process consumes brings extra performance cost, and may not be two requests, but more ask, so performance cost is just larger.
Summary of the invention
The object of this invention is to provide a kind of method for writing data based on Adelson-Velskii-Landis tree and device, object is that the write operation to not conflicting in local in Adelson-Velskii-Landis tree allows parallel processing, thus improves the performance of data write.
For solving the problems of the technologies described above, the invention provides a kind of method for writing data based on Adelson-Velskii-Landis tree, adopting Read-Write Locks to carry out con current control to data write, comprising:
Receive the write request of data;
According to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree;
Judge in described searching route, whether each node is in lock status; Wherein, lock status is, when first node is the root node that local directed complete set subtree occurs in current concurrent write operation, described first node is set to the state of pinning;
If do not have node to be in lock status in described searching route, then carry out write operation; If have node to be in lock status in described searching route, then write operation is blocked on the node pinned, until the lock status of the node of described pinning is cancelled.
Alternatively, when in current concurrent write operation, first node is the root node that local directed complete set subtree occurs, the state being set to by described first node pin comprises:
According to the data write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree of current concurrent write operation, and navigate to the position of the Section Point of actual write;
Calculate the balance factor of the father node of described Section Point, and the balance factor of upwards other nodes of recursive calculation, till the value calculating balance factor is the first node of 2 or-2;
Open the lock status of described first node, and adjust accordingly according to the value of described balance factor;
The lock status of the described first node of release after write operation completes.
Alternatively, the lock status of the described first node of described unlatching, and carry out adjusting accordingly comprising according to the value of described balance factor:
When the value of described balance factor is 2: if the value rotating the balance factor of the left child of root is 1, then carry out the rotation of LL type; If the value rotating the balance factor of the left child of root is-1, then carry out the rotation of LR type;
When the value of described balance factor is-2: if the value rotating the balance factor of the right child of root is 1, then carry out the rotation of RL type; If the value rotating the balance factor of the right child of root is-1, then carry out the rotation of RR type.
Alternatively, described Adelson-Velskii-Landis tree is RBTree.
Present invention also offers a kind of data transfer apparatus based on Adelson-Velskii-Landis tree, adopt Read-Write Locks to carry out con current control to data write, comprising:
Receiver module, for receiving the write request of data;
Determination module, for according to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree;
Judge module, for judging in described searching route, whether each node is in lock status; Wherein, lock status is, when first node is the root node that local directed complete set subtree occurs in current concurrent write operation, described first node is set to the state of pinning;
Writing module, for when not having node to be in lock status in described searching route, then carries out write operation; When having node to be in lock status in described searching route, then write operation is blocked on the node pinned, until the lock status of the node of described pinning is cancelled.
Alternatively, described judge module also comprises:
Positioning unit, writes the size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree for the data according to current concurrent write operation, and navigates to the position of the Section Point of actual write;
Computing unit, for calculating the balance factor of the father node of described Section Point, and the balance factor of upwards other nodes of recursive calculation, till the value calculating balance factor is the first node of 2 or-2;
Opening unit, for opening the lock status of described first node, and adjusting accordingly according to the value of described balance factor;
Releasing unit, for discharging the lock status of described first node after the write operation is completed.
Alternatively, described unlatching unit specifically for:
When the value of described balance factor is 2: if the value rotating the balance factor of the left child of root is 1, then carry out the rotation of LL type; If the value rotating the balance factor of the left child of root is-1, then carry out the rotation of LR type;
When the value of described balance factor is-2: if the value rotating the balance factor of the right child of root is 1, then carry out the rotation of RL type; If the value rotating the balance factor of the right child of root is-1, then carry out the rotation of RR type.
Alternatively, described Adelson-Velskii-Landis tree is RBTree.
Method for writing data based on Adelson-Velskii-Landis tree provided by the present invention and device, adopt Read-Write Locks to carry out con current control, after receiving the write request of data to data write; According to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree; Judge in searching route, whether each node is in lock status; If do not have node to be in lock status in searching route, then carry out write operation; If there is node to be in lock status in searching route, then write operation is blocked on the node pinned, until the lock status of the node pinned is cancelled.Visible, the method for writing data based on Adelson-Velskii-Landis tree provided by the present invention and device, allow parallel processing to the write operation do not conflicted in local in Adelson-Velskii-Landis tree, thus improve the performance of data write.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of a kind of embodiment of the method for writing data based on Adelson-Velskii-Landis tree provided by the present invention;
Fig. 2 is the structured flowchart of a kind of embodiment of the data transfer apparatus based on Adelson-Velskii-Landis tree provided by the present invention.
Embodiment
Core of the present invention is to provide a kind of method for writing data based on Adelson-Velskii-Landis tree and device, adopts Read-Write Locks to carry out con current control to data write.The advantage that Read-Write Locks compares other several concurrent control mechanism is, for the scene that read request is more, because read request does not revise critical resource, so there is no the protection of lock mechanism, also just without expense and the wait of lock.Therefore the advantage introducing Read-Write Locks in RBTree is, need not consider the concurrent performance bottleneck read, and only need pay close attention to the concurrent Preservation tactics write.
In order to make those skilled in the art person understand the present invention program better, below in conjunction with the drawings and specific embodiments, the present invention is described in further detail.Obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
As shown in Figure 1, the method adopts Read-Write Locks to carry out con current control to data write to the process flow diagram of a kind of embodiment of the method for writing data based on Adelson-Velskii-Landis tree provided by the present invention, specifically comprises:
Step S101: the write request receiving data;
Step S102: according to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree;
Step S103: judge in described searching route, whether each node is in lock status; Wherein, lock status is, when first node is the root node that local directed complete set subtree occurs in current concurrent write operation, described first node is set to the state of pinning;
Step S104: if do not have node to be in lock status in described searching route, then carry out write operation; If have node to be in lock status in described searching route, then write operation is blocked on the node pinned, until the lock status of the node of described pinning is cancelled.
Method for writing data based on Adelson-Velskii-Landis tree provided by the present invention, adopts Read-Write Locks to carry out con current control, after receiving the write request of data to data write; According to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree; Judge in searching route, whether each node is in lock status; If do not have node to be in lock status in searching route, then carry out write operation; If there is node to be in lock status in searching route, then write operation is blocked on the node pinned, until the lock status of the node pinned is cancelled.Visible, the method for writing data based on Adelson-Velskii-Landis tree provided by the present invention, allows parallel processing to the write operation do not conflicted in local in Adelson-Velskii-Landis tree, thus improves the performance of data write.
Particularly, when in current concurrent write operation, first node is the root node that local directed complete set subtree occurs, the state being set to by described first node pin comprises:
According to the data write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree of current concurrent write operation, and navigate to the position of the Section Point of actual write;
Calculate the balance factor of the father node of described Section Point, and the balance factor of upwards other nodes of recursive calculation, till the value calculating balance factor is the first node of 2 or-2;
Open the lock status of described first node, and adjust accordingly according to the value of described balance factor;
The lock status of the described first node of release after write operation completes.
In the present embodiment, the lock status of the described first node of described unlatching, and carry out adjusting accordingly comprising according to the value of described balance factor:
When the value of described balance factor is 2: if the value rotating the balance factor of the left child of root is 1, then carry out the rotation of LL type; If the value rotating the balance factor of the left child of root is-1, then carry out the rotation of LR type;
When the value of described balance factor is-2: if the value rotating the balance factor of the right child of root is 1, then carry out the rotation of RL type; If the value rotating the balance factor of the right child of root is-1, then carry out the rotation of RR type.
RBTree is the mutation of Adelson-Velskii-Landis tree, and uses more in kernel, all uses this data structure in many file system, uses this data structure as description object, be further described its specific implementation process in the present embodiment.
The operation writing RBTree corresponding with obliterated data is exactly insertion and the deletion of node.Initial RBTree defines according to it equilibrium state having adjusted oneself.Insert and deletion of node process in, the equilibrium state of RBTree has been destroyed, and at this moment need the state readjusting RBTree to make it reach new equilibrium state, this process is exactly the self-equilibrating of RBTree.The process of self-equilibrating is mainly divided into left-handed and dextrorotation.Whether there is the left-handed balance factor being each node in whole tree with the foundation of right-handed operations whether to change.
This node left subtree of definition balance factor M=joint height-this node right subtree joint height, wherein, nodal point number AVL number is node, and in RBTree is non-NULL node.
If when the value of M is 0, represent that after inserting new node, this node left subtree is equal with right subtree height; If when the value of M is 1, represent after inserting new node, this node left subtree is higher 1 layer than right subtree joint; If when the value of M is-1, represent after inserting new node, this node left subtree one deck lower than right subtree node, then this tree is still in equilibrium state;
If when the value of M is 2, represent after inserting new node, this node left subtree is higher 2 layers than right subtree joint; If when the value of M is-2, represent that after inserting new node, this node left subtree is lower than right subtree node 2 layers, then this tree balance state is destroyed, and now needs the structure readjusting tree again to reach equilibrium state.
The process of concrete adjustment is:
When the M value rotating root is 2:
If the M value rotating the left child of root is 1, then carry out the rotation of LL type; LL type needs a dextrorotation.
If the M value rotating the left child of root is-1, then carry out the rotation of LR type; LR type needs first left-handed in dextrorotation.
When the M value rotating root is-2:
If the M value rotating the right child of root is 1, then carry out the rotation of RL type; RL type needs first dextrorotation left-handed again.
If the BM value rotating the right child of root is-1, then carry out the rotation of RR type; RR type needs once left-handed.
Can find no matter be M=2 or-2, only occur in RBTree self-equilibrating process in the maximum three layers of tree in local.That is, if the insertion occurred in the subtree situation of RBTree different local or deletion action, do not trigger the Concurrency Access of critical resource, there is not data inconsistence problems, so independent operation inserts or deletes.Compare the tree root pinning whole of RBTree tree, synchronization, allow the operation meeting above-mentioned situation to occur more.Here it is, and the performance optimization of RBTree Concurrency Access provides theories integration.
Based on above-mentioned condition, in this embodiment, in the root node data structure of RBTree, with the addition of root_lock attribute, only have and to be just initialised uses when inserting or deletion of node occurs in this node left and right child, complete adjustment destruction afterwards; In the data structure of each node of RBTree, add node_lock Attribute domain, when this node is the root node that local directed complete set subtree occurs, initialization uses, and destroys after completing adjustment.
When insertion or deletion of node, first according to the insertion size of nodal value and the characteristic determination searching route of RBTree, and navigate to the particular location of the actual insertion of this node; Calculate the balance factor inserting its father node of node particular location in reality, and the balance factor of upwards other node of recursive calculation, until the value of the balance factor of certain node and M is 2 or-2; In initialization 2, the value of M is the node_lock of 2 or-2 nodes, and takes above-mentioned different adjustable strategies according to the value of M.
If when now having other insertion or deletion of node to enter this RBTree, can determine whether carrying out this operation according to the state of searching route interior joint (lock or do not lock).If do not have node to be in the state of pinning in searching route, illustrate that this twice operation does not conflict, then can carry out this operation; If there is node to be in the state of pinning in searching route, then this operation can be blocked on this node, until this node lock status is cancelled; The lock of node is discharged after having operated.
As shown in Figure 2, this device adopts Read-Write Locks to carry out con current control to data write to the structured flowchart of a kind of embodiment of the data transfer apparatus based on Adelson-Velskii-Landis tree provided by the present invention, specifically comprises:
Receiver module 100, for receiving the write request of data;
Determination module 200, for according to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree;
Judge module 300, for judging in described searching route, whether each node is in lock status; Wherein, lock status is, when first node is the root node that local directed complete set subtree occurs in current concurrent write operation, described first node is set to the state of pinning;
Writing module 400, for when not having node to be in lock status in described searching route, then carries out write operation; When having node to be in lock status in described searching route, then write operation is blocked on the node pinned, until the lock status of the node of described pinning is cancelled.
As a kind of embodiment, above-mentioned judge module 300 can also comprise:
Positioning unit, writes the size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree for the data according to current concurrent write operation, and navigates to the position of the Section Point of actual write;
Computing unit, for calculating the balance factor of the father node of described Section Point, and the balance factor of upwards other nodes of recursive calculation, till the value calculating balance factor is the first node of 2 or-2;
Opening unit, for opening the lock status of described first node, and adjusting accordingly according to the value of described balance factor;
Releasing unit, for discharging the lock status of described first node after the write operation is completed.
As a kind of embodiment, above-mentioned unlatching unit can also be specifically for:
When the value of described balance factor is 2: if the value rotating the balance factor of the left child of root is 1, then carry out the rotation of LL type; If the value rotating the balance factor of the left child of root is-1, then carry out the rotation of LR type;
When the value of described balance factor is-2: if the value rotating the balance factor of the right child of root is 1, then carry out the rotation of RL type; If the value rotating the balance factor of the right child of root is-1, then carry out the rotation of RR type.
Particularly, in the embodiment of the present invention, Adelson-Velskii-Landis tree can be specially RBTree.
Data transfer apparatus based on Adelson-Velskii-Landis tree provided by the present invention is corresponding with the above-mentioned method for writing data based on Adelson-Velskii-Landis tree, can be cross-referenced, does not repeat them here.
To sum up, the method for writing data based on Adelson-Velskii-Landis tree provided by the present invention and device, compare and simply lock to tree root, writes the insertion deletion permission parallel work-flow do not conflicted middle local, improve the performance of data write to Adelson-Velskii-Landis tree is concurrent.Although introduce new data structure in the present invention RBTree node, add memory cost, only have node just this lock construction of initialization that self-equilibrating operation occurs in reality, therefore impact can be ignored.
In this instructions, each embodiment adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiment, between each embodiment same or similar part mutually see.
To the above-mentioned explanation of the disclosed embodiments, professional and technical personnel in the field are realized or uses the present invention.To be apparent for those skilled in the art to the multiple amendment of these embodiments, General Principle as defined herein can without departing from the spirit or scope of the present invention, realize in other embodiments.Therefore, the present invention can not be restricted to these embodiments shown in this article, but will meet the widest scope consistent with principle disclosed herein and features of novelty.
Claims (8)
1. based on a method for writing data for Adelson-Velskii-Landis tree, it is characterized in that, adopt Read-Write Locks to carry out con current control to data write, comprising:
Receive the write request of data;
According to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree;
Judge in described searching route, whether each node is in lock status; Wherein, lock status is, when first node is the root node that local directed complete set subtree occurs in current concurrent write operation, described first node is set to the state of pinning;
If do not have node to be in lock status in described searching route, then carry out write operation; If have node to be in lock status in described searching route, then write operation is blocked on the node pinned, until the lock status of the node of described pinning is cancelled.
2. as claimed in claim 1 based on the method for writing data of Adelson-Velskii-Landis tree, it is characterized in that, when in current concurrent write operation, first node is the root node that local directed complete set subtree occurs, the state being set to by described first node pin comprises:
According to the data write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree of current concurrent write operation, and navigate to the position of the Section Point of actual write;
Calculate the balance factor of the father node of described Section Point, and the balance factor of upwards other nodes of recursive calculation, till the value calculating balance factor is the first node of 2 or-2;
Open the lock status of described first node, and adjust accordingly according to the value of described balance factor;
The lock status of the described first node of release after write operation completes.
3. as claimed in claim 2 based on the method for writing data of Adelson-Velskii-Landis tree, it is characterized in that, the lock status of the described first node of described unlatching, and carry out adjusting accordingly comprising according to the value of described balance factor:
When the value of described balance factor is 2: if the value rotating the balance factor of the left child of root is 1, then carry out the rotation of LL type; If the value rotating the balance factor of the left child of root is-1, then carry out the rotation of LR type;
When the value of described balance factor is-2: if the value rotating the balance factor of the right child of root is 1, then carry out the rotation of RL type; If the value rotating the balance factor of the right child of root is-1, then carry out the rotation of RR type.
4. the method for writing data based on Adelson-Velskii-Landis tree as described in any one of claims 1 to 3, is characterized in that, described Adelson-Velskii-Landis tree is RBTree.
5. based on a data transfer apparatus for Adelson-Velskii-Landis tree, it is characterized in that, adopt Read-Write Locks to carry out con current control to data write, comprising:
Receiver module, for receiving the write request of data;
Determination module, for according to the write size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree;
Judge module, for judging in described searching route, whether each node is in lock status; Wherein, lock status is, when first node is the root node that local directed complete set subtree occurs in current concurrent write operation, described first node is set to the state of pinning;
Writing module, for when not having node to be in lock status in described searching route, then carries out write operation; When having node to be in lock status in described searching route, then write operation is blocked on the node pinned, until the lock status of the node of described pinning is cancelled.
6., as claimed in claim 5 based on the data transfer apparatus of Adelson-Velskii-Landis tree, it is characterized in that, described judge module also comprises:
Positioning unit, writes the size of nodal value and the characteristic determination searching route of Adelson-Velskii-Landis tree for the data according to current concurrent write operation, and navigates to the position of the Section Point of actual write;
Computing unit, for calculating the balance factor of the father node of described Section Point, and the balance factor of upwards other nodes of recursive calculation, till the value calculating balance factor is the first node of 2 or-2;
Opening unit, for opening the lock status of described first node, and adjusting accordingly according to the value of described balance factor;
Releasing unit, for discharging the lock status of described first node after the write operation is completed.
7., as claimed in claim 6 based on the data transfer apparatus of Adelson-Velskii-Landis tree, it is characterized in that, described unlatching unit specifically for:
When the value of described balance factor is 2: if the value rotating the balance factor of the left child of root is 1, then carry out the rotation of LL type; If the value rotating the balance factor of the left child of root is-1, then carry out the rotation of LR type;
When the value of described balance factor is-2: if the value rotating the balance factor of the right child of root is 1, then carry out the rotation of RL type; If the value rotating the balance factor of the right child of root is-1, then carry out the rotation of RR type.
8. the data transfer apparatus based on Adelson-Velskii-Landis tree as described in any one of claim 5 to 7, is characterized in that, described Adelson-Velskii-Landis tree is RBTree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510745287.5A CN105389360A (en) | 2015-11-05 | 2015-11-05 | AVL tree-based data writing method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510745287.5A CN105389360A (en) | 2015-11-05 | 2015-11-05 | AVL tree-based data writing method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105389360A true CN105389360A (en) | 2016-03-09 |
Family
ID=55421650
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510745287.5A Pending CN105389360A (en) | 2015-11-05 | 2015-11-05 | AVL tree-based data writing method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105389360A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107291628A (en) * | 2017-07-04 | 2017-10-24 | 北京京东尚科信息技术有限公司 | The method and apparatus of accessing data storage devices |
| CN107688612A (en) * | 2017-08-03 | 2018-02-13 | 东软集团股份有限公司 | Data manipulation method, device and computer equipment |
| CN110019057A (en) * | 2017-09-27 | 2019-07-16 | 华为技术有限公司 | Request processing method and device |
| CN110990404A (en) * | 2019-11-27 | 2020-04-10 | 亚信科技（中国）有限公司 | Index data processing method and device and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5063501A (en) * | 1989-12-18 | 1991-11-05 | At&T Bell Laboratories | Information control system for selectively transferring a tree lock from a parent node to a child node thereby freeing other nodes for concurrent access |
| CN103942269A (en) * | 2014-03-26 | 2014-07-23 | 北京京东尚科信息技术有限公司 | Method and device for operating file system |
| CN104036141A (en) * | 2014-06-16 | 2014-09-10 | 上海大学 | Open computing language (OpenCL)-based red-black tree acceleration algorithm |
-
2015
- 2015-11-05 CN CN201510745287.5A patent/CN105389360A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5063501A (en) * | 1989-12-18 | 1991-11-05 | At&T Bell Laboratories | Information control system for selectively transferring a tree lock from a parent node to a child node thereby freeing other nodes for concurrent access |
| CN103942269A (en) * | 2014-03-26 | 2014-07-23 | 北京京东尚科信息技术有限公司 | Method and device for operating file system |
| CN104036141A (en) * | 2014-06-16 | 2014-09-10 | 上海大学 | Open computing language (OpenCL)-based red-black tree acceleration algorithm |
Non-Patent Citations (4)
| Title |
|---|
| BOYISHACHANG: "平衡二叉树的转换和平衡方法", 《HTTP://BLOG.51CTO.COM/BOYISHACHANG/1294792》 * |
| FOLLOWDREAMLGX: "平衡二叉树,AVL树之图解篇", 《HTTPS://WWW.CNBLOGS.COM/SUIMENG/P/4560056.HTML》 * |
| MARK MOIR等: "《Handbook of Data structures and Applications》", 28 October 2004, CRC出版社 * |
| 张选平等: "《数据结构》", 28 February 2002 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107291628A (en) * | 2017-07-04 | 2017-10-24 | 北京京东尚科信息技术有限公司 | The method and apparatus of accessing data storage devices |
| CN107291628B (en) * | 2017-07-04 | 2020-09-01 | 北京京东尚科信息技术有限公司 | Method and apparatus for accessing data storage device |
| CN107688612A (en) * | 2017-08-03 | 2018-02-13 | 东软集团股份有限公司 | Data manipulation method, device and computer equipment |
| CN110019057A (en) * | 2017-09-27 | 2019-07-16 | 华为技术有限公司 | Request processing method and device |
| CN110019057B (en) * | 2017-09-27 | 2021-10-22 | 华为技术有限公司 | Request processing method and device |
| CN110990404A (en) * | 2019-11-27 | 2020-04-10 | 亚信科技（中国）有限公司 | Index data processing method and device and electronic equipment |
| CN110990404B (en) * | 2019-11-27 | 2023-09-05 | 亚信科技（中国）有限公司 | Index data processing method and device and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8219587B2 (en) | Method for searching a tree structure | |
| CN105389360A (en) | AVL tree-based data writing method and apparatus | |
| CN103502926A (en) | Extent-based storage architecture | |
| US20170011082A1 (en) | Mechanisms for merging index structures in molap while preserving query consistency | |
| US9208273B1 (en) | Methods, systems, and articles of manufacture for implementing clone design components in an electronic design | |
| CN105159895A (en) | Method and system for storing and inquiring data | |
| US20210034437A1 (en) | System and method for multidimensional search with a resource pool in a computing environment | |
| US11048669B2 (en) | Replicated state management using journal-based registers | |
| US20100169289A1 (en) | Two Phase Commit With Grid Elements | |
| US11068504B2 (en) | Relational database storage system and method for supporting fast query processing with low data redundancy, and method for query processing based on the relational database storage method | |
| WO2018205151A1 (en) | Data updating method and storage device | |
| WO2019055282A1 (en) | Database engine | |
| CN106557272A (en) | A kind of efficient sensor historic data archiving method | |
| CN105959419A (en) | Establishment method and system for distributed storage structure based on consensus tree | |
| CN106462386B (en) | The sort method and processing system for the distributed input data that sorts | |
| CN105573674A (en) | Distributed storage method oriented to a large number of small files | |
| US20210132987A1 (en) | Computer program for asynchronous data processing in a database management system | |
| CN104573112B (en) | Page interrogation method and data processing node in OLTP Cluster Databases | |
| CN104077078B (en) | Read memory block, update the method and device of memory block | |
| US20070260579A1 (en) | Method of designing query classification component for multilevel dbms | |
| CN106156049A (en) | A kind of method and system of digital independent | |
| WO2016187975A1 (en) | Internal memory defragmentation method and apparatus | |
| US9588985B2 (en) | Reducing blocking instances in parallel processing systems performing operations on trees | |
| CN109582735A (en) | A kind of block chain blocks of knowledge storage system | |
| US20130080481A1 (en) | Extreme large space allocation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160309 |