CN103530067A - Data operation method and device - Google Patents
Data operation method and device Download PDFInfo
- Publication number
- CN103530067A CN103530067A CN201310468322.4A CN201310468322A CN103530067A CN 103530067 A CN103530067 A CN 103530067A CN 201310468322 A CN201310468322 A CN 201310468322A CN 103530067 A CN103530067 A CN 103530067A
- Authority
- CN
- China
- Prior art keywords
- data
- data block
- operated
- place value
- logical place
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a data operation method and device, and relates to the field of storage. The data operation method and device can guarantee the continuity of a physical storage space and improve the read-write performance of a storage device. The method includes the steps that data blocks where a root node and an indirect node are located in a tree structure are looked for, the storage space is allocated and released in a pre-allocation space, and a continuous block of a destination address in the storage space is looked for; when the continuous block is found, data to be operated are stored in a cache and subjected to the operations of read, insertion and deletion to obtain data after being operated, and the data after being operated are written into the storage device with the continues block as a unit. The data operation method and device are applied to the operations on the data.
Description
Technical field
The present invention relates to field of storage, relate in particular to a kind of method and apparatus of data manipulation.
Background technology
Current when carrying out duplicate file deletion, during duplicate file deletion, can find identical file data blocks by specific algorithm, then the metadata of heavily deleting of pointing to identical block is write in the tree of storing documents.Although the single heavy metadata of deleting takes up room littlely than individual data piece, the number of heavily deleting metadata of relatively bringing is much bigger, how storing metadata and optimization is read and write performance exists very large challenge.
B+ tree (B+Tree) is as a kind of common tree form data structure, owing to can keeping storing the stability of data, the time complexity of simultaneously its operation is also very stable, so B+ tree is used in the file system of database and operating system conventionally, for preserving key word information.But B+ tree is mainly applicable to the copy operation of random file, be not suitable for the read-write operation to sequential file, in addition, division and merging that the insertion of existing B+ tree and deletion algorithm can cause indirect nodes a large amount of in data structure, can cause continuous release and the distribution of indirect node, finally cause the discontinuous of amount of physical memory, thereby cannot distribute continuous space for indirect node, reduced the readwrite performance of data.
Summary of the invention
Embodiments of the invention provide a kind of method and apparatus of data manipulation, can guarantee the continuity of amount of physical memory, improve the readwrite performance of memory storage devices.
For achieving the above object, embodiments of the invention adopt following technical scheme:
First aspect, provides a kind of method of data manipulation, and described method comprises:
Search root node in tree structure and the data block at node place indirectly;
In predistribution space, distribute and discharge storage space, inquiring about the continuous blocks of destination address in described storage space;
When inquiring described continuous blocks, data to be operated to be stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take described continuous blocks as unit is by the data write storage device after described operation.
In the possible implementation of the first, in conjunction with first aspect, described method also comprises:
Indirect node and the root node of every layer in described tree structure all distributed to continuous buffer memory, and described continuous buffer memory is all corresponding with the continuous physical space at described indirect node place.
In the possible implementation of the second, in conjunction with first aspect, described when inquiring described continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take described continuous blocks as unit is by the data write storage device after described operation:
Described update is the write operation that appends to file, logical place value when data described to be operated, with the logical place value of last number certificate and its data length when equating, described in directly carrying out in the adjacent position of described previous data, treat the insertion of service data;
Described update is the empty write operation to file, logical place value when data described to be operated, be greater than the logical place value of previous data and its data length and time, before data described to be operated, add the first data block, and data to be operated described in inserting in the adjacent position of described the first data block, logical place value in wherein said the first data block and the logical place value of described previous data and its data length and equate, and the size of described the first data block is the logic channel value of data to be operated and the difference of the logical place value of described the first data block described in being,
Described update is the covering write operation to file, when the described data wait operating are a plurality of data block, data block corresponding to the logical place value in the data in described to be operated deleted, and data described to be operated are inserted into the position of deleted data block.
In the third possible implementation, in conjunction with first aspect, described when inquiring described continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, the described continuous blocks of take comprise the data write storage device after described operation as unit:
Described deletion action is write deletion action for covering, adjacent data block under same indirect node is deleted into new data block, logical place value in described new data block is the logical place value of first data block in described adjacent data block, the size of described new data block be described adjacent data block size and;
Described deletion action is file brachymemma operation, directly by the value zero clearing in the data block being truncated.
Second aspect, provides a kind of equipment of data manipulation, and described equipment comprises:
Data block is searched unit, for searching the data block at tree structure root node and indirect node place;
Continuous blocks query unit, for distributing in predistribution space and discharging storage space, inquires about the continuous blocks of destination address in described storage space;
Performance element for when inquiring described continuous blocks, is stored data to be operated in buffer memory, and the operation of reading, inserting and deleting, and the data after being operated be take described continuous blocks as unit is by the data write storage device after described operation.
In the possible implementation of the first, in conjunction with second aspect, in described equipment:
Indirect node and the root node of every layer in described tree structure all distributed to continuous buffer memory, and described continuous buffer memory is all corresponding with the continuous physical space at described indirect node place.
In the possible implementation of the second, in conjunction with second aspect, described performance element specifically for:
Described update is the write operation that appends to file, logical place value when data described to be operated, with the logical place value of last number certificate and its data length when equating, described in directly carrying out in the adjacent position of described previous data, treat the insertion of service data;
Described update is the empty write operation to file, logical place value when data described to be operated, be greater than the logical place value of previous data and its data length and time, before data described to be operated, add the first data block, and data to be operated described in inserting in the adjacent position of described the first data block, logical place value in wherein said the first data block and the logical place value of described previous data and its data length and equate, and the size of described the first data block is the logic channel value of data to be operated and the difference of the logical place value of described the first data block described in being,
Described update is the covering write operation to file, when the described data wait operating are a plurality of data block, data block corresponding to the logical place value in the data in described to be operated deleted, and data described to be operated are inserted into the position of deleted data block.
In the third possible implementation, in conjunction with second aspect, described performance element also for:
Described deletion action is write deletion action for covering, adjacent data block under same indirect node is deleted into new data block, logical place value in described new data block is the logical place value of first data block in described adjacent data block, the size of described new data block be described adjacent data block size and;
Described deletion action is file brachymemma operation, directly by the value zero clearing in the data block being truncated.
The method and apparatus of a kind of data manipulation that the embodiment of the present invention provides by searching root node in tree structure and the data block at node place indirectly, distributes and discharges storage space in predistribution space, inquires about the continuous blocks of destination address in storage space; When inquiring continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take continuous blocks as unit is by the data write storage device after operation, can guarantee the continuity of amount of physical memory, improve the readwrite performance of memory storage devices.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 provides a kind of process flow diagram of method of data manipulation for the embodiment of the present invention;
Fig. 2 provides the schematic diagram that appends write operation in a kind of method of data manipulation for the embodiment of the present invention;
Fig. 3 provides the schematic diagram of empty write operation in a kind of method of data manipulation for the embodiment of the present invention;
Fig. 4 provides the schematic diagram that covers write operation in a kind of method of data manipulation for the embodiment of the present invention;
Fig. 5 provides the result schematic diagram that covers write operation in a kind of method of data manipulation for the embodiment of the present invention;
Fig. 6 provides the schematic diagram that covers write operation in a kind of method of data manipulation for the embodiment of the present invention;
Fig. 7 provides the schematic diagram of file brachymemma operation in a kind of method of data manipulation for the embodiment of the present invention;
Fig. 8 provides a kind of structural representation of equipment of data manipulation for the embodiment of the present invention;
Fig. 9 is the structural representation that the invention provides a kind of device of data manipulation.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Embodiment based in the present invention, those of ordinary skills, not making the every other embodiment obtaining under creative work prerequisite, belong to the scope of protection of the invention.
The embodiment of the present invention provides a kind of method of data manipulation, and as shown in Figure 1, the method comprises:
101, search root node in tree structure and the data block at node place indirectly.
102, in predistribution space, distribute and discharge storage space, inquiring about the continuous blocks of destination address in described storage space.
103, when inquiring described continuous blocks, data to be operated to be stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take described continuous blocks as unit is by the data write storage device after described operation.
The method of a kind of data manipulation that the embodiment of the present invention provides by searching root node in tree structure and the data block at node place indirectly, is distributed and discharges storage space in predistribution space, inquires about the continuous blocks of destination address in storage space; When inquiring continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take continuous blocks as unit is by the data write storage device after operation, can guarantee the continuity of amount of physical memory, improve the readwrite performance of memory storage devices.
The embodiment of the present invention provides a kind of method of data manipulation, and the method comprises:
201, search root node in tree structure and the data block at node place indirectly.
202, in predistribution space, distribute and discharge storage space, inquiring about the continuous blocks of destination address in described storage space.
203, when inquiring described continuous blocks, data to be operated to be stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take described continuous blocks as unit is by the data write storage device after described operation.
Wherein, indirect node and the root node of every layer in described tree structure all distributed to continuous buffer memory, and described continuous buffer memory is all corresponding with the continuous physical space at described indirect node place.
Further, in step 203, when when being operating as update, be specifically divided into following three kinds of situations:
Described update is the write operation that appends to file, logical place value when data described to be operated, with the logical place value of last number certificate and its data length when equating, described in directly carrying out in the adjacent position of described previous data, treat the insertion of service data.
Exemplary, concrete appends write operation as shown in Figure 2, in Fig. 2, B+ tree has three layers, is respectively leaf node Level0 and indirect node Level1 and Level2, and the logical place value of the current data block being inserted into is 12291, therefore, when this appends write operation in execution, first by upper layer node, distribute the new indirect node 1001 adjacent with previous indirect node 1000, and carry out the insertion of new data block in the leaf node position of indirect node 1001.
Determine at the leaf node place of newly assigned data block 1001 and add after new data block, through calculating, learn, logical place value in last leaf node of previous indirect node and self length and be 12291, just in time equate with the logical place value of data block to be added, therefore, this secondary data update is just for appending write operation.
Same, update is the empty write operation to file, logical place value when data described to be operated, be greater than the logical place value of previous data and its data length and time, before data described to be operated, add the first data block, and data to be operated described in inserting in the adjacent position of described the first data block, logical place value in wherein said the first data block and the logical place value of described previous data and its data length and equate, and the size of described the first data block is the logic channel value of data to be operated and the difference of the logical place value of described the first data block described in being.
Exemplary, as shown in Figure 3, in Fig. 3, originally the data block existing is only data block 1000 and three leaf nodes thereof, the logical place value of current data block to be added is 16387, and the logical place value of last leaf node of former indirect node 1000 and data length and be only 12291, with the logical place value of data block to be added be 16387 numerical value unequal, if this time only data block to be added is directly directly added after previous indirect node, just can not guarantee to store the continuity of data.
In this case, in order to guarantee to store the continuity of data, on the upper strata of former indirect node, add data block 100 as indirect node, and add data block 1001 and former indirect node 1000 together as the indirect node of data block 100, then, for indirect node 1001 adds and the pseudo-leaf nodes that are connected with last leaf node of indirect node 1000, and again the data block of the logical place value 16387 being inserted into is inserted after this leaf node.
Wherein, the logical place value of the pseudo-leaf node adding be indirect node 1000 last leaf node logical place value and self length with 12291, and the length of this pseudo-leaf node is logical place value and the difference 4096 self length and 12291 of last leaf node of the logical place value 16387 together indirect nodes 1000 of data block to be added.Because the pseudo-leaf node adding not is the data block to be added such as real, in order to show this point, in pseudo-leaf node, add an ident value, and be empty by this value of statistical indicant assignment, with this, show that this data block is not the data block of really adding according to user instruction.
Described update is the covering write operation to file, when the described data wait operating are a plurality of data block, data block corresponding to the logical place value in the data in described to be operated deleted, and data described to be operated are inserted into the position of deleted data block.
Exemplary, as shown in Figure 4, current first leaf node in two new data blocks and original B+ tree need to replacement, be about to will be replaced by two new data blocks on the position of first leaf node in former B+ tree, result after replacement as shown in Figure 5, former leaf node is replaced by two new leaf nodes, and former indirect node 1000 is also replaced by new indirect node 900 simultaneously.
Further, the process that covering is write is specially: the data block being replaced is deleted, and indirect node corresponding to deleted leaf node deleted simultaneously, by upper layer node, redistribute an indirect node, the length of this newly assigned indirect node is the length of having deleted indirect node and data block length to be added with, afterwards, in the position of deleting the node of leaf, data block to be added is inserted.
Relative, in step 203, when when being operating as deletion action, concrete minute following two kinds of situations:
Described deletion action is write union operation for covering, the adjacent data of logical place value are merged into new data, thereby generate a logical place value and merge before the logical place value of first data identical, data length be all merged data lengths and new data, then the data that order generates replace the position of legacy data, after new data generates, delete original data simultaneously.
Exemplary, concrete covering is write union operation as shown in Figure 6, in Fig. 6, node data piece 100 is connected with four leaf nodes indirectly, if desired the first two data block in leaf node is merged, the data that namely cover are that logical place value is 0 and 2048 data block, above-mentioned two data blocks are being covered after the operation of writing merging, can generate a new data block, the logical place value that the logical place value of this data block is first data block before merging namely 0, after merging the data length of data block for merge the first two data block length and 2048+2048=4096 namely, generate after the data block after merging, need to be by two data block deletes before merging, afterwards newly-generated data block is stored in to the position of data block before merging.
Same, when deletion action is file brachymemma operation, directly the data block of brachymemma position is deleted.
Exemplary, as shown in Figure 7, data to be deleted are the data block that in figure, the logical value in dotted line frame is 16387, when carrying out file brachymemma operation, directly the data in data block to be deleted are emptied.
The method of a kind of data manipulation that the embodiment of the present invention provides by searching root node in tree structure and the data block at node place indirectly, is distributed and discharges storage space in predistribution space, inquires about the continuous blocks of destination address in storage space; When inquiring continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take continuous blocks as unit is by the data write storage device after operation, can guarantee the continuity of amount of physical memory, improve the readwrite performance of memory storage devices.
The embodiment of the present invention provides a kind of equipment 3 of data manipulation, and as shown in Figure 8, this equipment 3 comprises:
Data block is searched unit 31, for searching the data block at tree structure root node and indirect node place.
Continuous blocks query unit 32, for distributing in predistribution space and discharging storage space, inquires about the continuous blocks of destination address in described storage space.
Further, in equipment 3, indirect node and the root node of every layer in described tree structure all distributed to continuous buffer memory, and described continuous buffer memory is all corresponding with the continuous physical space at described indirect node place.
Wherein, performance element 33 specifically for:
Described update is the write operation that appends to file, logical place value when data described to be operated, with the logical place value of last number certificate and its data length when equating, described in directly carrying out in the adjacent position of described previous data, treat the insertion of service data;
Described update is the empty write operation to file, logical place value when data described to be operated, be greater than the logical place value of previous data and its data length and time, before data described to be operated, add the first data block, and data to be operated described in inserting in the adjacent position of described the first data block, logical place value in wherein said the first data block and the logical place value of described previous data and its data length and equate, and the size of described the first data block is the logic channel value of data to be operated and the difference of the logical place value of described the first data block described in being,
Described update is the covering write operation to file, when the described data wait operating are a plurality of data block, data block corresponding to the logical place value in the data in described to be operated deleted, and data described to be operated are inserted into the position of deleted data block.
Similarly, performance element 33 also for:
Described deletion action is write deletion action for covering, adjacent data block under same indirect node is deleted into new data block, logical place value in described new data block is the logical place value of first data block in described adjacent data block, the size of described new data block be described adjacent data block size and;
Described deletion action is file brachymemma operation, directly by the value zero clearing in the data block being truncated.
The equipment of a kind of data manipulation that the embodiment of the present invention provides by searching root node in tree structure and the data block at node place indirectly, distributes and discharges storage space in predistribution space, inquires about the continuous blocks of destination address in storage space; When inquiring continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take continuous blocks as unit is by the data write storage device after operation, can guarantee the continuity of amount of physical memory, improve the readwrite performance of memory storage devices.
The invention provides a kind of device 4 of data manipulation, as shown in Figure 9, this device 4 comprises: bus 41; And be connected to the processor 42 in bus 41,, storer 43, receiver 44 and transmitter 45, wherein storer is used for storing dependent instruction, this processor 42 is carried out dependent instructions for searching tree structure root node and the data block at node place indirectly; This processor 42 is carried out dependent instruction for distributing in predistribution space and discharging storage space, inquires about the continuous blocks of destination address in described storage space; This processor 42 is carried out dependent instruction for when inquiring described continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take described continuous blocks as unit is by the data write storage device after described operation.
In embodiments of the present invention, optional, this processor 42 is also for the indirect node of every layer of described tree structure and root node are all distributed to continuous buffer memory, and described continuous buffer memory is all corresponding with the continuous physical space at described indirect node place.
In embodiments of the present invention, optionally, this processor 42 is carried out dependent instruction for when inquiring described continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, the described continuous blocks of take comprise the data write storage device after described operation as unit:
Described update is the write operation that appends to file, logical place value when data described to be operated, with the logical place value of last number certificate and its data length when equating, described in directly carrying out in the adjacent position of described previous data, treat the insertion of service data;
Described update is the empty write operation to file, logical place value when data described to be operated, be greater than the logical place value of previous data and its data length and time, before data described to be operated, add the first data block, and data to be operated described in inserting in the adjacent position of described the first data block, logical place value in wherein said the first data block and the logical place value of described previous data and its data length and equate, and the size of described the first data block is the logic channel value of data to be operated and the difference of the logical place value of described the first data block described in being,
Described update is the covering write operation to file, when the described data wait operating are a plurality of data block, data block corresponding to the logical place value in the data in described to be operated deleted, and data described to be operated are inserted into the position of deleted data block.
In embodiments of the present invention, optionally, this processor 42 is carried out dependent instruction for when inquiring described continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, the described continuous blocks of take comprise the data write storage device after described operation as unit:
Described deletion action is write deletion action for covering, adjacent data block under same indirect node is deleted into new data block, logical place value in described new data block is the logical place value of first data block in described adjacent data block, the size of described new data block be described adjacent data block size and;
Described deletion action is file brachymemma operation, directly by the value zero clearing in the data block being truncated.
The device of a kind of data manipulation that therefore embodiment of the present invention provides by searching in tree structure root node and the data block at node place indirectly, distributes and discharges storage space in predistribution space, inquires about the continuous blocks of destination address in storage space; When inquiring continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take continuous blocks as unit is by the data write storage device after operation, can guarantee the continuity of amount of physical memory, improve the readwrite performance of memory storage devices.
In the several embodiment that provide in the application, should be understood that, disclosed method, device, and system, can realize by another way.For example, device embodiment described above is only schematic, for example, the division of described unit, be only that a kind of logic function is divided, during actual realization, can have other dividing mode, for example a plurality of unit or assembly can in conjunction with or can be integrated into another system, or some features can ignore, or do not carry out.Another point, shown or discussed coupling each other or direct-coupling or communication connection can be by some interfaces, indirect coupling or the communication connection of device or unit can be electrically, machinery or other form.
The described unit as separating component explanation can or can not be also physically to separate, and the parts that show as unit can be or can not be also physical locations, can be positioned at a place, or also can be distributed in a plurality of network element.Can select according to the actual needs some or all of unit wherein to realize the object of the present embodiment scheme.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, can be also that the independent physics of unit comprises, also can be integrated in a unit two or more unit.Above-mentioned integrated unit both can adopt the form of hardware to realize, and the form that also can adopt hardware to add SFU software functional unit realizes.
The integrated unit that the above-mentioned form with SFU software functional unit realizes, can be stored in a computer read/write memory medium.Above-mentioned SFU software functional unit is stored in a storage medium, comprise some instructions with so that computer equipment (can be personal computer, server, or the network equipment etc.) carry out the part steps of method described in each embodiment of the present invention.And aforesaid storage medium comprises: USB flash disk, portable hard drive, ROM (read-only memory) (Read-Only Memory, be called for short ROM), the various media that can be program code stored such as random access memory (Random Access Memory is called for short RAM), magnetic disc or CD.
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited to this, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of described claim.
Claims (8)
1. a method for data manipulation, is characterized in that, described method comprises:
Search root node in tree structure and the data block at node place indirectly;
In predistribution space, distribute and discharge storage space, inquiring about the continuous blocks of destination address in described storage space;
When inquiring described continuous blocks, data to be operated to be stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take described continuous blocks as unit is by the data write storage device after described operation.
2. method according to claim 1, is characterized in that, described method also comprises:
Indirect node and the root node of every layer in described tree structure all distributed to continuous buffer memory, and described continuous buffer memory is all corresponding with the continuous physical space at described indirect node place.
3. method according to claim 1, it is characterized in that, described when inquiring described continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, take described continuous blocks as unit is by the data write storage device after described operation:
Described update is the write operation that appends to file, logical place value when data described to be operated, with the logical place value of last number certificate and its data length when equating, described in directly carrying out in the adjacent position of described previous data, treat the insertion of service data;
Described update is the empty write operation to file, logical place value when data described to be operated, be greater than the logical place value of previous data and its data length and time, before data described to be operated, add the first data block, and data to be operated described in inserting in the adjacent position of described the first data block, logical place value in wherein said the first data block and the logical place value of described previous data and its data length and equate, and the size of described the first data block is the logic channel value of data to be operated and the difference of the logical place value of described the first data block described in being,
Described update is the covering write operation to file, when the described data wait operating are a plurality of data block, data block corresponding to the logical place value in the data in described to be operated deleted, and data described to be operated are inserted into the position of deleted data block.
4. method according to claim 1, it is characterized in that, described when inquiring described continuous blocks, data to be operated are stored in buffer memory, the operation of reading, inserting and deleting, and the data after being operated, the described continuous blocks of take comprise the data write storage device after described operation as unit:
Described deletion action is write deletion action for covering, adjacent data block under same indirect node is deleted into new data block, logical place value in described new data block is the logical place value of first data block in described adjacent data block, the size of described new data block be described adjacent data block size and;
Described deletion action is file brachymemma operation, directly by the value zero clearing in the data block being truncated.
5. an equipment for data manipulation, is characterized in that, described equipment comprises:
Data block is searched unit, for searching the data block at tree structure root node and indirect node place;
Continuous blocks query unit, for distributing in predistribution space and discharging storage space, inquires about the continuous blocks of destination address in described storage space;
Performance element for when inquiring described continuous blocks, is stored data to be operated in buffer memory, and the operation of reading, inserting and deleting, and the data after being operated be take described continuous blocks as unit is by the data write storage device after described operation.
6. equipment according to claim 5, is characterized in that, in described equipment:
Indirect node and the root node of every layer in described tree structure all distributed to continuous buffer memory, and described continuous buffer memory is all corresponding with the continuous physical space at described indirect node place.
7. equipment according to claim 5, is characterized in that, described performance element specifically for:
Described update is the write operation that appends to file, logical place value when data described to be operated, with the logical place value of last number certificate and its data length when equating, described in directly carrying out in the adjacent position of described previous data, treat the insertion of service data;
Described update is the empty write operation to file, logical place value when data described to be operated, be greater than the logical place value of previous data and its data length and time, before data described to be operated, add the first data block, and data to be operated described in inserting in the adjacent position of described the first data block, logical place value in wherein said the first data block and the logical place value of described previous data and its data length and equate, and the size of described the first data block is the logic channel value of data to be operated and the difference of the logical place value of described the first data block described in being,
Described update is the covering write operation to file, when the described data wait operating are a plurality of data block, data block corresponding to the logical place value in the data in described to be operated deleted, and data described to be operated are inserted into the position of deleted data block.
8. equipment according to claim 5, is characterized in that, described performance element also for:
Described deletion action is write deletion action for covering, adjacent data block under same indirect node is deleted into new data block, logical place value in described new data block is the logical place value of first data block in described adjacent data block, the size of described new data block be described adjacent data block size and;
Described deletion action is file brachymemma operation, directly by the value zero clearing in the data block being truncated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310468322.4A CN103530067B (en) | 2013-10-09 | 2013-10-09 | A kind of method and apparatus of data manipulation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310468322.4A CN103530067B (en) | 2013-10-09 | 2013-10-09 | A kind of method and apparatus of data manipulation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103530067A true CN103530067A (en) | 2014-01-22 |
| CN103530067B CN103530067B (en) | 2017-06-09 |
Family
ID=49932120
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310468322.4A Active CN103530067B (en) | 2013-10-09 | 2013-10-09 | A kind of method and apparatus of data manipulation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103530067B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104932982A (en) * | 2014-03-21 | 2015-09-23 | 华为技术有限公司 | Message access memory compiling method and related apparatus |
| CN107807787A (en) * | 2016-09-08 | 2018-03-16 | 北京京东尚科信息技术有限公司 | A kind of distributed data storage method and system |
| CN109492005A (en) * | 2018-11-07 | 2019-03-19 | 郑州云海信息技术有限公司 | A kind of B+ tree read buffer method and relevant apparatus |
| CN111208953A (en) * | 2020-04-16 | 2020-05-29 | 广东睿江云计算股份有限公司 | Distributed storage method and device |
| CN114500658A (en) * | 2021-12-27 | 2022-05-13 | 广州极飞科技股份有限公司 | Data transmission method and device and data transmission method and device of aircraft |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| US20090222407A1 (en) * | 2008-03-03 | 2009-09-03 | Daisuke Takuma | Information search system, method and program |
| CN102591789A (en) * | 2011-12-26 | 2012-07-18 | 成都市华为赛门铁克科技有限公司 | Storage space recovery method and storage space recovery device |
| US20130226885A1 (en) * | 2012-02-28 | 2013-08-29 | Microsoft Corporation | Path-decomposed trie data structures |
-
2013
- 2013-10-09 CN CN201310468322.4A patent/CN103530067B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| US20090222407A1 (en) * | 2008-03-03 | 2009-09-03 | Daisuke Takuma | Information search system, method and program |
| CN102591789A (en) * | 2011-12-26 | 2012-07-18 | 成都市华为赛门铁克科技有限公司 | Storage space recovery method and storage space recovery device |
| US20130226885A1 (en) * | 2012-02-28 | 2013-08-29 | Microsoft Corporation | Path-decomposed trie data structures |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104932982A (en) * | 2014-03-21 | 2015-09-23 | 华为技术有限公司 | Message access memory compiling method and related apparatus |
| CN104932982B (en) * | 2014-03-21 | 2019-02-12 | 华为技术有限公司 | A kind of Compilation Method and relevant apparatus of message memory access |
| CN107807787A (en) * | 2016-09-08 | 2018-03-16 | 北京京东尚科信息技术有限公司 | A kind of distributed data storage method and system |
| CN107807787B (en) * | 2016-09-08 | 2020-12-22 | 北京京东尚科信息技术有限公司 | Distributed data storage method and system |
| CN109492005A (en) * | 2018-11-07 | 2019-03-19 | 郑州云海信息技术有限公司 | A kind of B+ tree read buffer method and relevant apparatus |
| CN111208953A (en) * | 2020-04-16 | 2020-05-29 | 广东睿江云计算股份有限公司 | Distributed storage method and device |
| CN114500658A (en) * | 2021-12-27 | 2022-05-13 | 广州极飞科技股份有限公司 | Data transmission method and device and data transmission method and device of aircraft |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103530067B (en) | 2017-06-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102209953B (en) | Storage system and storage control method that compress and store data elements | |
| CN104461390A (en) | Method and device for writing data into imbricate magnetic recording SMR hard disk | |
| US9442694B1 (en) | Method for storing a dataset | |
| CN103838853B (en) | Mixed file system based on different storage media | |
| US6832290B2 (en) | Method, system, program, and data structures for maintaining metadata in a storage system | |
| CN105718217A (en) | Method and device for maintaining data consistency of thin provisioning database | |
| CN108763473A (en) | A kind of the native object storage method and device of distributed storage | |
| CN105787037B (en) | A kind of delet method and device of repeated data | |
| US10976946B2 (en) | Method and computer system for managing blocks | |
| CN103530067A (en) | Data operation method and device | |
| CN111522507B (en) | Low-delay file system address space management method, system and medium | |
| CN103577513A (en) | Systems and/or methods for caching xml information sets with delayed node instantiation | |
| CN103577329A (en) | Snapshot management method and device | |
| CN109407985B (en) | Data management method and related device | |
| CN104933051A (en) | File storage space recovery method and device | |
| CN107037988B (en) | A kind of flash memory safety deleting method and system based on file-level granularity | |
| WO2016106757A1 (en) | Method for managing storage data, storage manager and storage system | |
| CN105512325A (en) | Multi-version data index renewing, deleting and establishing method and device | |
| CN103530322A (en) | Method and device for processing data | |
| US20210141775A1 (en) | Metadata reduction in a distributed storage system | |
| KR100907477B1 (en) | Apparatus and method for managing index of data stored in flash memory | |
| US10482012B1 (en) | Storage system and method of operating thereof | |
| CN106294189A (en) | Memory fragmentation method for sorting and device | |
| US10877881B2 (en) | In-place garbage collection of a sharded, replicated distributed state machine based on mergeable operations | |
| CN104133970A (en) | Data space management 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |