CN109033365A - A kind of data processing method and relevant device - Google Patents
A kind of data processing method and relevant device Download PDFInfo
- Publication number
- CN109033365A CN109033365A CN201810837236.9A CN201810837236A CN109033365A CN 109033365 A CN109033365 A CN 109033365A CN 201810837236 A CN201810837236 A CN 201810837236A CN 109033365 A CN109033365 A CN 109033365A
- Authority
- CN
- China
- Prior art keywords
- target
- data
- tree
- memory node
- memory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
- G06F3/0611—Improving I/O performance in relation to response time
Abstract
The embodiment of the invention provides a kind of data processing method and relevant device, the lower brush efficiency of metadata in memory can be improved.This method comprises: obtaining the data volume stored in target B+ tree, the target B+ tree is the data structure of metadata in memory, includes at least one memory node in the target B+ tree；Judge whether the data volume stored in the target B+ tree reaches preset threshold；It include preset number memory node in the target set of data if so, obtaining target set of data, the preset number memory node is the memory node in the target B+ tree；Brush under the data of memory node each in the target set of data to target disk, the target disk and the target B+ tree had into incidence relation by multithreading, the multithreading and preset number have incidence relation.
Description
Technical field
The present invention relates to field of storage, in particular to a kind of data processing method and relevant device.
Background technique
In big data era, the storage of mass data needs the support of file system, the metadata performance of file system at
For the key for influencing file access performance.
In order to guarantee storage performance, a kind of storage system metadata organization and management method are metadata in memory disk
All with the tree-like formula of B+, increment of the B+ tree as disk B+ tree in memory.When the data volume that B+ tree stores in memory reaches certain threshold
It when value, then needs that disk will be brushed under the data of memory B+ tree, so that releasing memory resource is for saving new incremental data.
The scheme of traditional lower brush metadata be by memory with each memory node of the metadata of B+ tree one by one under
Disk is brushed, after lower brush is completed, updates entry address of the address root of new B+ tree as access magnetic disk metadata.But
In this way the problem is that with business continuous expansion, the metadata saved on disk can constantly expand, at this time if according to
Memory B+ tree brushes disk under memory node one by one, will lead to whole metadata and integrally plays brush overlong time, memory source has little time
Recycling, the problems such as decline so as to cause performance.
Summary of the invention
The embodiment of the invention provides a kind of data processing method and device, the lower brush effect of metadata in memory can be improved
Rate.
First aspect of the embodiment of the present invention provides a kind of data processing method, specifically includes:
The data volume stored in target B+ tree is obtained, the target B+ tree is the data structure of metadata in memory, described
It include at least one memory node in target B+ tree；
Judge whether the data volume stored in the target B+ tree reaches preset threshold；
It include preset number memory node, the present count in the target set of data if so, obtaining target set of data
Mesh memory node is the memory node in the target B+ tree；
It will be brushed under the data of memory node each in the target set of data to target disk, the target by multithreading
Disk and the target B+ tree have incidence relation, and the multithreading and preset number have incidence relation.
Optionally, the acquisition target set of data includes:
The preset number memory node is obtained from the target B+ tree；
The target set of data is generated according to the preset number memory node.
Optionally, described to be brushed under the data in the target set of data to target disk by multithreading, it is described
Method further include:
Judge whether the data of all memory nodes in the target B+ tree are all lower to brush；
If so, issuing prompt information.
Optionally, memory node in the quantity for the memory node for including in the target set of data and the target B+ tree
Entry quantity has incidence relation.
The embodiment of the present application second aspect provides a kind of device of data processing, specifically includes:
First acquisition unit, for obtaining the data volume stored in target B+ tree, the target B+ tree is first number in memory
According to data structure, include at least one memory node in the target B+ tree；
First judging unit, for judging whether the data volume stored in the target B+ tree reaches preset threshold；
Second acquisition unit, for obtaining number of targets when the data volume stored in the target+tree reaches preset threshold
It include preset number memory node in the target set of data according to group, the preset number memory node is the target B
Memory node in+tree；
Processing unit, for will be brushed under the data of memory node each in the target set of data to target by multithreading
Disk, the target disk and the target B+ tree have incidence relation, and the multithreading and preset number have incidence relation.
Optionally, the second acquisition unit is specifically used for:
The preset number memory node is obtained from the target B+ tree；
The target set of data is generated according to the preset number memory node.
Optionally, described device further include:
Second judgment unit, for judging whether the data of all memory nodes in the target B+ tree all brush down；
Prompt unit, for issuing prompt when the data of all memory nodes in the target B+ tree all lower brushes
Information.
Optionally, memory node in the quantity for the memory node for including in the target set of data and the target B+ tree
Entry quantity has incidence relation.
The third aspect of the embodiment of the present invention provides a kind of processor, and the processor is for running computer program, institute
The step of executing data processing method as described above when stating computer program operation.
Fourth aspect of the embodiment of the present invention provides a kind of computer readable storage medium, is stored thereon with computer journey
Sequence, it is characterised in that: when the computer program is executed by processor the step of data processing method described above.
In view of the foregoing it is apparent that metadata is in memory and disk all with the tree-like formula group of B+ in the embodiment of the present application
It knits, increment of the memory B+ tree as disk B+ tree, when memory B+ tree reaches certain threshold value, needs the data in memory B+ tree
Under brush disk, memory B+ tree data are subjected to lower brush according to the form of group, each group includes preset number memory node, i.e.,
Multiple memory nodes in memory B+ tree are merged together lower brush, and are handled using multi-thread concurrent, by this method
The speed brushed under metadata can be greatly improved, the lower brush efficiency of metadata in memory is improved.
Detailed description of the invention
Fig. 1 is the embodiment schematic diagram of data processing method provided in an embodiment of the present invention；
Fig. 2 is the embodiment schematic diagram of data processing equipment provided in an embodiment of the present invention；
Fig. 3 is the hardware device structural schematic diagram of data processing equipment provided in an embodiment of the present invention；
Fig. 4 is the embodiment schematic diagram of a kind of electronic equipment provided in an embodiment of the present invention；
Fig. 5 is a kind of embodiment schematic diagram of computer readable storage medium provided in an embodiment of the present invention.
Specific embodiment
The embodiment of the invention provides a kind of data processing method and data processing equipment, metadata in memory can be improved
Lower brush efficiency.
Description and claims of this specification and term " first ", " second ", " third ", " in above-mentioned attached drawing
The (if present)s such as four " are to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should manage
The data that solution uses in this way are interchangeable under appropriate circumstances, so that the embodiments described herein can be in addition to illustrating herein
Or the sequence other than the content of description is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that
Cover it is non-exclusive include, for example, containing the process, method, system, product or equipment of a series of steps or units need not limit
In step or unit those of is clearly listed, but may include be not clearly listed or for these process, methods, produce
The other step or units of product or equipment inherently.
Data processing method is described from the angle of data processing equipment below, which can be clothes
Business device, or the service unit in server, specifically without limitation.
Referring to Fig. 1, Fig. 1 is one embodiment schematic diagram of data processing method provided in an embodiment of the present invention, comprising:
101, the data volume stored in target B+ tree is obtained.
In the present embodiment, the size of the data volume stored in the available target B+ tree of data processing equipment, the wherein mesh
The data structure that B+ tree is metadata in memory is marked, includes at least one memory node in target B+ tree.B+ tree be for disk or
Other are directly accessed ancillary equipment and a kind of balance search tree for designing, and in B+ tree, all record memory nodes are all keys
The size order of value is stored in the leaf memory node of same layer, is attached by each leaf memory node pointer.That is,
Metadata exists all in the form of B+ tree in memory and disk, increment of the B+ tree as disk B+ tree in memory.
102, judge whether the data volume stored in target B+ tree reaches preset threshold, if so, 103 are thened follow the steps, if
It is no, then follow the steps step 105.
In the present embodiment, when data processing equipment gets the data volume stored in target B+ tree, it can be determined that the mesh
Whether the data volume stored in mark B+ tree reaches preset threshold, such as judges whether the data volume stored in target B+ tree reaches
800000000, when the data volume stored in target B+ tree reaches preset threshold, step 103 is executed, when the number stored in target B+ tree
When being not up to preset threshold according to amount, step 105 is executed.
103, target set of data is obtained.
In the present embodiment, when determining that the data volume stored in target B+ tree reaches preset threshold, available number of targets
According to group, specifically, obtaining preset number memory node from target B+ tree, target is generated according to preset number memory node
Data group, wherein include preset number memory node in target set of data, which is target B+ tree
In memory node.
It should be noted that memory node in the quantity for the memory node for including in target set of data and target B+ tree
Entry quantity has incidence relation, that is to say, that if the entry quantity of memory node is 16, then includes in target set of data
16 memory nodes.Certainly other corresponding relationships also be can also be, specifically without limitation.Also i.e. by present count in target B+ tree
Mesh memory node is organized into a group in such a way that IO polymerize, and memory node number is in target B+ tree in the group
All memory nodes of group are carried out Memory linkage and obtain target set of data by the entry number of memory node e.
104, it will be brushed under the data of memory node each in the target set of data to target disk by multithreading.
In the present embodiment, data processing equipment can be by multithreading by the data of memory node each in target set of data
Lower brush is to target disk, and wherein target disk and target B+ tree have incidence relation, and multithreading has with preset number to be associated with
System.That is, the data to each memory node in target set of data carry out concurrent processing by multithreading, guarantee simultaneously
The data of lower all memory nodes of brush.
It should be noted that using initial address plus the side of offset the disk address that lower layer returns after lower brush
Method successively updates the address of corresponding disk to each memory node in target set of data, updates the memory section in the B+ tree of disk
In the corresponding V value of the corresponding kv value of point.Due to each size of node in B+ tree be it is identical, as long as being aware of
Then beginning address can obtain each memory node in disk plus the offset of each memory node by initial address
Address.The purpose of this step is in order to, can be with after brushing disk under the data of each memory node in target set of data
The data of the lower brush are found by the address of memory node corresponding in disk.
It should also be noted that, will be brushed under the data of memory node each in target set of data to target magnetic by multithreading
After disk, it can also judge whether the data of all memory nodes in target B+ tree are all lower and brush；Institute in target B+ tree
There is the lower brush of the data of memory node to complete, then issues prompt information.That is, can be with real-time judge target B+ tree whether also
There are the not lower brushes of memory node (can also judge to be by judging whether that memory node can be got in target B+ tree
The whether lower brush of memory node in no target B+ tree is completed, and when that cannot get memory node in target B+ tree, then illustrates mesh
Marking the memory node in B+ tree, all lower brush is completed, and otherwise indicates do not have), when there is no have memory node in target B+ tree
Later, prompt information can be issued, the metadata which is used to prompt in user memory is all lower to brush to disk
In, meanwhile, lower brush data can also be carried in the prompt information in the address of disk, to facilitate subsequent use lower brush data
When, it can directly be searched from disk by address.
It should also be noted that, being carried out down to the target set of data that this is obtained after obtaining a target set of data
Brush, naturally it is also possible to carry out lower brush when obtaining multiple target set of data, while to multiple target set of data, not do specifically
It limits.
105, other operations are executed.
In the present embodiment, when the data volume stored in target B+ tree is not up to preset threshold, then it can continue to target B
Memory node is added in+tree, until the data volume in target B+ tree reaches preset threshold, then executes step 103 to step
104, lower brush data are carried out, have been described in detail above, specific details are not described herein again.
In view of the foregoing it is apparent that metadata is in memory and disk all with the tree-like formula group of B+ in the embodiment of the present application
It knits, increment of the memory B+ tree as disk B+ tree, when the data volume of memory B+ tree storage reaches certain threshold value, needs memory
Disk is brushed under data in B+ tree, memory B+ tree data are subjected to lower brush according to the form of group, each group includes preset number
Multiple memory nodes in memory B+ tree are merged together lower brush, and are handled using multi-thread concurrent by a memory node,
The speed brushed under metadata can be greatly improved by this method, improve the lower brush efficiency of metadata in memory.
The embodiment of the present invention is illustrated from the angle of data processing method above, below from the angle of data processing equipment
Degree is illustrated the embodiment of the present invention.
Referring to Fig. 2, Fig. 2 is the embodiment schematic diagram of data processing equipment provided in an embodiment of the present invention, specifically include:
First acquisition unit 201, for obtaining the data volume stored in target B+ tree, the target B+ tree is member in memory
The data structure of data includes at least one memory node in the target B+ tree；
First judging unit 202, for judging whether the data volume stored in the target B+ tree reaches preset threshold；
Second acquisition unit 203, for obtaining mesh when the data volume stored in the target+tree reaches preset threshold
Data group is marked, includes preset number memory node in the target set of data, the preset number memory node is described
Memory node in target B+ tree；
Processing unit 204, for by multithreading will be brushed under the data of memory node each in the target set of data to
Target disk, the target disk and the target B+ tree have incidence relation, and the multithreading has with preset number to be associated with
Relationship.
Optionally, second acquisition Unit 203 are specifically used for:
The preset number memory node is obtained from the target B+ tree；
The target set of data is generated according to the preset number memory node.
Optionally, described device further include:
Second judgment unit 205, for judging the data of all memory nodes in the target B+ tree whether under whole
Brush；
Prompt unit 206, for when the data of all memory nodes in the target B+ tree all lower brushes, sending to be mentioned
Show information.
Optionally, memory node in the quantity for the memory node for including in the target set of data and the target B+ tree
Entry quantity has incidence relation.
Interactive mode between each unit of data processing equipment in the present embodiment is as illustrated in the foregoing fig. 1 in embodiment
Description, specific details are not described herein again.
In view of the foregoing it is apparent that metadata is in memory and disk all with the tree-like formula group of B+ in the embodiment of the present application
It knits, increment of the memory B+ tree as disk B+ tree, when memory B+ tree reaches certain threshold value, needs the data in memory B+ tree
Under brush disk, memory B+ tree data are subjected to lower brush according to the form of group, each group includes preset number memory node, i.e.,
Multiple memory nodes in memory B+ tree are merged together lower brush, and are handled using multi-thread concurrent, by this method
The speed brushed under metadata can be greatly improved, the lower brush efficiency of metadata in memory is improved.
The data processing equipment in the embodiment of the present invention is described from the angle of modular functionality entity above, under
The data processing equipment in the embodiment of the present invention is described in the angle that face is handled from hardware device.
Referring to Fig. 3,300 one embodiment of data processing equipment in the embodiment of the present invention, comprising:
(wherein the quantity of processor 303 can be with for input unit 301, output device 302, processor 303 and memory 304
One or more, in Fig. 3 by taking a processor 303 as an example).In some embodiments of the invention, input unit 301, output
Device 302, processor 303 and memory 304 can be connected by bus or other means, wherein to be connected by bus in Fig. 3
For.
Wherein, the operational order stored by calling memory 304, processor 303, for executing following steps:
The data volume stored in target B+ tree is obtained, the target B+ tree is the data structure of metadata in memory, described
It include at least one memory node in target B+ tree；
Judge whether the data volume stored in the target B+ tree reaches preset threshold；
It include preset number memory node, the present count in the target set of data if so, obtaining target set of data
Mesh memory node is the memory node in the target B+ tree；
It will be brushed under the data of memory node each in the target set of data to target disk, the target by multithreading
Disk and the target B+ tree have incidence relation, and the multithreading and preset number have incidence relation.
In the specific implementation process, the operational order for calling memory 304 to store, it is corresponding that Fig. 1 may be implemented in processor 303
Embodiment in any embodiment.
Referring to Fig. 4, Fig. 4 is the embodiment schematic diagram of electronic equipment provided in an embodiment of the present invention.
As shown in figure 4, the embodiment of the invention provides a kind of electronic equipment 400, including memory 410, processor 420 and
It is stored in the computer program 411 that can be run on memory 410 and on processor 420, processor 420 executes computer program
It is performed the steps of when 411
The data volume stored in target B+ tree is obtained, the target B+ tree is the data structure of metadata in memory, described
It include at least one memory node in target B+ tree；
Judge whether the data volume stored in the target B+ tree reaches preset threshold；
It include preset number memory node, the present count in the target set of data if so, obtaining target set of data
Mesh memory node is the memory node in the target B+ tree；
It will be brushed under the data of memory node each in the target set of data to target disk, the target by multithreading
Disk and the target B+ tree have incidence relation, and the multithreading and preset number have incidence relation.
In the specific implementation process, when processor 420 executes computer program 411, the corresponding embodiment of Fig. 1 may be implemented
Middle any embodiment.
Since the electronic equipment that the present embodiment is introduced is to implement in the embodiment of the present invention used by data processing method
Equipment, so based on method described in the embodiment of the present invention, those skilled in the art can understand the present embodiment
The specific embodiment of electronic equipment and its various change form, so how to realize the present invention for the electronic equipment herein
Method in embodiment is no longer discussed in detail, as long as the method that those skilled in the art implement in the embodiment of the present invention is adopted
Equipment belongs to the range of the invention to be protected.
Referring to Fig. 5, Fig. 5 is a kind of embodiment signal of computer readable storage medium provided in an embodiment of the present invention
Figure.
As shown in figure 5, present embodiments providing a kind of computer readable storage medium 500, it is stored thereon with computer journey
Sequence 511, the computer program 511 realize following steps when being executed by processor:
The physical memory of the computer system is divided into inner core region, shared section key and exclusively enjoys memory field, it is described
Inner core region is the operation area of the computer system kernel, and the shared section key and the memory field that exclusively enjoys are the meter
The operation area of process in calculation machine system；
The data volume stored in target B+ tree is obtained, the target B+ tree is the data structure of metadata in memory, described
It include at least one memory node in target B+ tree；
Judge whether the data volume stored in the target B+ tree reaches preset threshold；
It include preset number memory node, the present count in the target set of data if so, obtaining target set of data
Mesh memory node is the memory node in the target B+ tree；
It will be brushed under the data of memory node each in the target set of data to target disk, the target by multithreading
Disk and the target B+ tree have incidence relation, and the multithreading and preset number have incidence relation.
In the specific implementation process, Fig. 1 corresponding embodiment may be implemented when which is executed by processor
Middle any embodiment.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, there is no the portion being described in detail in some embodiment
Point, reference can be made to the related descriptions of other embodiments.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and module, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method, system or computer program
Product.Therefore, the present invention can be used complete hardware apparatus embodiments, complete software embodiment or combine software and hardware equipment
The form of the embodiment of aspect.Moreover, it wherein includes computer usable program code that the present invention, which can be used in one or more,
Computer-usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) on the calculating implemented
The form of machine program product.
The present invention be referring to the method for the embodiment of the present invention, equipment (system) and computer program product flow chart and/
Or block diagram describes.It should be understood that each process that can be realized by computer program instructions in flowchart and/or the block diagram and/
Or the combination of the process and/or box in box and flowchart and/or the block diagram.It can provide these computer program instructions
To general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor to generate one
A machine so that by the instruction that the processor of computer or other programmable data processing devices executes generate for realizing
The device for the function of being specified in one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
In a typical configuration, calculating equipment includes one or more processors (CPU), input/output interface, net
Network interface and memory.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/
Or the forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM).Memory is computer-readable Jie
The example of matter.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer readable instructions, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory (SRAM), moves
State random access memory (DRAM), other kinds of random access memory (RAM), read-only memory (ROM), electric erasable
Programmable read only memory (EEPROM), block dodge memory body or other memory techniques, read-only disc read only memory (CD-ROM) (CD-ROM),
Digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices or
Any other non-transmission medium, can be used for storage can be accessed by a computing device information.As defined in this article, computer
Readable medium does not include temporary computer readable media (transitory media), such as the data-signal and carrier wave of modulation.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including element
There is also the other elements that matches in process, method, commodity or equipment.
It will be understood by those skilled in the art that the embodiment of the present invention can provide as method, system or computer program product.
Therefore, the present invention can be used complete hardware apparatus embodiments, complete software embodiment or combine software and hardware equipment aspect
The form of embodiment.Moreover, it wherein includes the calculating of computer usable program code that the present invention, which can be used in one or more,
The computer program implemented in machine usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of product.
The above is only the embodiment of the present invention, are not intended to restrict the invention.To those skilled in the art,
The invention may be variously modified and varied.It is all within the spirit and principles of the present invention made by any modification, equivalent replacement,
Improve etc., it should be included within scope of the presently claimed invention.
Claims (10)
1. a kind of data processing method characterized by comprising
The data volume stored in target B+ tree is obtained, the target B+ tree is the data structure of metadata in memory, the target B
It include at least one memory node in+tree；
Judge whether the data volume stored in the target B+ tree reaches preset threshold；
It include preset number memory node, the preset number in the target set of data if so, obtaining target set of data
Memory node is the memory node in the target B+ tree；
It will be brushed under the data of memory node each in the target set of data to target disk, the target disk by multithreading
There is incidence relation with the target B+ tree, the multithreading and preset number have incidence relation.
2. the method according to claim 1, wherein the acquisition target set of data includes:
The preset number memory node is obtained from the target B+ tree；
The target set of data is generated according to the preset number memory node.
3. the method according to claim 1, wherein it is described by multithreading by the number in the target set of data
After lower brush to target disk, the method also includes:
Judge whether the data of all memory nodes in the target B+ tree are all lower to brush；
If so, issuing prompt information.
4. according to the method in any one of claims 1 to 3, which is characterized in that include in the target set of data is interior
The entry quantity for depositing memory node in the quantity and the target B+ tree of node has incidence relation.
5. a kind of device of data processing characterized by comprising
First acquisition unit, for obtaining the data volume stored in target B+ tree, the target B+ tree is metadata in memory
Data structure includes at least one memory node in the target B+ tree；
First judging unit, for judging whether the data volume stored in the target B+ tree reaches preset threshold；
Second acquisition unit, for obtaining target data when the data volume stored in the target+tree reaches preset threshold
Group, includes preset number memory node in the target set of data, and the preset number memory node is the target B+
Memory node in tree；
Processing unit, for will be brushed under the data of memory node each in the target set of data to target magnetic by multithreading
Disk, the target disk and the target B+ tree have incidence relation, and the multithreading and preset number have incidence relation.
6. device according to claim 5, which is characterized in that the second acquisition unit is specifically used for:
The preset number memory node is obtained from the target B+ tree；
The target set of data is generated according to the preset number memory node.
7. device according to claim 5, which is characterized in that described device further include:
Second judgment unit, for judging whether the data of all memory nodes in the target B+ tree all brush down；
Prompt unit, for issuing prompt information when the data of all memory nodes in the target B+ tree all lower brushes.
8. device according to any one of claims 5 to 7, which is characterized in that include in the target set of data is interior
The entry quantity for depositing memory node in the quantity and the target B+ tree of node has incidence relation.
9. a kind of processor, which is characterized in that the processor is for running computer program, when the computer program is run
It executes such as the step of any one of Claims 1-4 the method.
10. a kind of computer readable storage medium, is stored thereon with computer program, it is characterised in that: the computer program
It is realized when being executed by processor such as the step of any one of Claims 1-4 the method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810837236.9A CN109033365B (en) | 2018-07-26 | 2018-07-26 | Data processing method and related equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810837236.9A CN109033365B (en) | 2018-07-26 | 2018-07-26 | Data processing method and related equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109033365A true CN109033365A (en) | 2018-12-18 |
| CN109033365B CN109033365B (en) | 2022-03-08 |
Family
ID=64645754
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810837236.9A Active CN109033365B (en) | 2018-07-26 | 2018-07-26 | Data processing method and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109033365B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110147204A (en) * | 2019-05-22 | 2019-08-20 | 苏州浪潮智能科技有限公司 | A kind of metadata rule method, apparatus, system and computer readable storage medium |
| CN110502457A (en) * | 2019-08-23 | 2019-11-26 | 北京浪潮数据技术有限公司 | A kind of metadata storing method and device |
| CN111142803A (en) * | 2019-12-29 | 2020-05-12 | 北京浪潮数据技术有限公司 | Metadata disk refreshing method, device, equipment and medium |
| CN112800050A (en) * | 2019-11-13 | 2021-05-14 | 北京清红微谷技术开发有限责任公司 | Transaction data storage method, system and device based on state tree and P2P network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106708442A (en) * | 2016-12-30 | 2017-05-24 | 武汉安嘉颐科技有限公司 | Massive data storage method simultaneously applicable to disk and solid state disk reading and writing features |
| CN106897119A (en) * | 2017-02-28 | 2017-06-27 | 郑州云海信息技术有限公司 | Disk tree optimization method and system in a kind of virtual platform |
| CN107463447A (en) * | 2017-08-21 | 2017-12-12 | 中国人民解放军国防科技大学 | B + tree management method based on remote direct nonvolatile memory access |
| US20180089222A1 (en) * | 2014-09-30 | 2018-03-29 | International Business Machines Corporation | Buffering and replicating data written to a distributed storage system |
-
2018
- 2018-07-26 CN CN201810837236.9A patent/CN109033365B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180089222A1 (en) * | 2014-09-30 | 2018-03-29 | International Business Machines Corporation | Buffering and replicating data written to a distributed storage system |
| CN106708442A (en) * | 2016-12-30 | 2017-05-24 | 武汉安嘉颐科技有限公司 | Massive data storage method simultaneously applicable to disk and solid state disk reading and writing features |
| CN106897119A (en) * | 2017-02-28 | 2017-06-27 | 郑州云海信息技术有限公司 | Disk tree optimization method and system in a kind of virtual platform |
| CN107463447A (en) * | 2017-08-21 | 2017-12-12 | 中国人民解放军国防科技大学 | B + tree management method based on remote direct nonvolatile memory access |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110147204A (en) * | 2019-05-22 | 2019-08-20 | 苏州浪潮智能科技有限公司 | A kind of metadata rule method, apparatus, system and computer readable storage medium |
| CN110147204B (en) * | 2019-05-22 | 2020-03-10 | 苏州浪潮智能科技有限公司 | Metadata disk-dropping method, device and system and computer-readable storage medium |
| CN110502457A (en) * | 2019-08-23 | 2019-11-26 | 北京浪潮数据技术有限公司 | A kind of metadata storing method and device |
| CN112800050A (en) * | 2019-11-13 | 2021-05-14 | 北京清红微谷技术开发有限责任公司 | Transaction data storage method, system and device based on state tree and P2P network |
| CN111142803A (en) * | 2019-12-29 | 2020-05-12 | 北京浪潮数据技术有限公司 | Metadata disk refreshing method, device, equipment and medium |
| CN111142803B (en) * | 2019-12-29 | 2022-07-08 | 北京浪潮数据技术有限公司 | Metadata disk refreshing method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109033365B (en) | 2022-03-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109033365A (en) | A kind of data processing method and relevant device | |
| WO2018121319A1 (en) | Block data check method and apparatus | |
| CN103370691B (en) | Managing buffer overflow conditions | |
| CN108985742B (en) | Transaction processing method and device and block chain system | |
| CN107040582A (en) | A kind of data processing method and device | |
| US20090327377A1 (en) | Copying entire subgraphs of objects without traversing individual objects | |
| CN104615594B (en) | A kind of data-updating method and device | |
| CN104714957B (en) | A kind of variation and device of table structure | |
| CN106201673B (en) | A kind of seismic data processing technique and device | |
| CN108228730A (en) | Data lead-in method, device, computer equipment and readable storage medium storing program for executing | |
| CN108268586A (en) | Across the data processing method of more tables of data, device, medium and computing device | |
| CN108170656A (en) | Template establishment method, document creating method, rendering intent and device | |
| CN108959359A (en) | A kind of uniform resource locator semanteme De-weight method, device, equipment and medium | |
| CN110019111A (en) | Data processing method, device, storage medium and processor | |
| CN105468623A (en) | Data processing method and apparatus | |
| CN116302461A (en) | Deep learning memory allocation optimization method and system | |
| CN109460406A (en) | A kind of data processing method and device | |
| CN103778067A (en) | Object processing method and device of Java card and Java card | |
| CN106648839A (en) | Method and device for processing data | |
| CN108874375A (en) | A kind of implementation method and device of timer | |
| Lim et al. | Lazy and eager approaches for the set cover problem | |
| CN106570005A (en) | Database cleaning method and device | |
| CN106570029A (en) | Data processing method and data processing system of distributed relation type database | |
| CN110069453A (en) | Operation/maintenance data treating method and apparatus | |
| CN107644086B (en) | The location mode of spatial data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |