CN104252415A - Method and system for redistributing data - Google Patents
Method and system for redistributing data Download PDFInfo
- Publication number
- CN104252415A CN104252415A CN201310268751.7A CN201310268751A CN104252415A CN 104252415 A CN104252415 A CN 104252415A CN 201310268751 A CN201310268751 A CN 201310268751A CN 104252415 A CN104252415 A CN 104252415A
- Authority
- CN
- China
- Prior art keywords
- data
- distributed
- memory block
- writing
- size
- 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
- 238000000034 method Methods 0.000 title claims abstract description 29
- 230000006870 function Effects 0.000 claims description 12
- 238000007726 management method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005192 partition Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention is applicable to the field of computers, and provides a method and a system for redistributing data. The method comprises the following steps of applying for multiple memory blocks with the same size; traversing each item of data to be distributed, and obtaining the size of each item of data to be distributed; comparing the size of each item of data to be distributed with the size of the memory blocks; writing each item of data to be distributed into the memory blocks according to a comparison result; writing the data to be distributed in the memory blocks into corresponding files. According to the embodiment of the invention, the multiple memory blocks with the same size are applied for, when the size of the data to be distributed is larger than the size of at least one memory block, the data are written into at least two memory blocks, and the data in the memory blocks are written into the corresponding files, a data distributing method is provided, so that when the size of the data to be distributed is larger than the size of at least one memory block, the buffer area of the memory blocks is not broken down, and management of memory is facilitated.
Description
Technical Field
The invention belongs to the field of data storage, and particularly relates to a method and a system for redistributing data.
Background
The popularization of internet business and the great increase of user data volume, distributed service sometimes needs to redistribute all data, and the following situations are encountered in the process of redistributing all data: a batch of data files F1, F2... Fn, redistribute the data in the files according to a certain rule to become F1, f2... fm, if the number of files n, m is many, and the number of records in the files is many, and the data in the files Fi are discretely distributed in f1... fm, if one file Fi is opened each time, reading one record, and writing the record into fj according to the rule. Random write access to the disk can result, resulting in a reduction in processing performance by a factor of about 100.
The prior art provides a method for changing random write access of a file into sequential write access, so as to solve the problem of low processing performance, and the method comprises the following steps: (1) applying for a plurality of memory blocks with the same size; (2) writing each piece of data to be distributed in the file into the memory block; (3) and writing the data in the memory block into a corresponding file. By the method, random writing of the file can be changed into sequential writing, but the size of each memory block is the same, but the size of data to be written is different, and if the data is larger than the size of the memory block, the buffer area of the memory block is punctured, so that the memory management is difficult.
Disclosure of Invention
Embodiments of the present invention provide a method and system for redistributing data to solve the problem that the buffer of a memory block is punctured in the prior art.
The embodiment of the invention is realized in such a way that a method for redistributing data comprises the following steps:
applying for a plurality of memory blocks with the same size;
traversing each piece of data to be distributed to obtain the size of each piece of data to be distributed;
comparing the size of each piece of data to be distributed with the size of the memory block;
writing each piece of data to be distributed into the memory block according to the comparison result;
and writing the data to be distributed in the memory block into a corresponding file.
It is another object of an embodiment of the present invention to provide a system for redistributing data, the system including:
the memory block application unit is used for applying for a plurality of memory blocks with the same size;
a data size obtaining unit, configured to traverse each piece of data to be distributed after the memory block application unit applies the application, and obtain the size of each piece of data to be distributed;
a comparing unit, configured to compare the size of each piece of data to be distributed acquired by the data size acquiring unit with the size of the memory block applied by the memory block applying unit;
the writing unit is used for writing each piece of data to be distributed into the memory block according to the comparison result of the comparison unit;
and the corresponding file writing unit is used for writing the data to be distributed, which is written into the memory block by the writing unit, into a corresponding file.
The embodiment of the invention applies for a plurality of memory blocks with the same size, when the size of the data to be distributed is larger than that of at least one memory block, the data is written into at least two memory blocks, and the data in the memory blocks is written into the corresponding files.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
FIG. 1 is a flow chart of a method of redistributing data as provided by an embodiment of the present invention;
fig. 2 is a block diagram of a redistribution data system provided by an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The embodiment of the invention applies for a plurality of memory blocks with the same size, when the size of the data to be distributed is larger than that of at least one memory block, the data is written into at least two memory blocks, and the data in the memory blocks is written into the corresponding files.
In order to explain the technical means of the present invention, the following description will be given by way of specific examples.
Example one
Fig. 1 is a flowchart of a method for redistributing data according to an embodiment of the present invention, where the method includes the following steps:
in step S101, a plurality of memory blocks having the same size are requested.
In the embodiment of the invention, a plurality of memory blocks with the same size are applied to a server for storing data to be distributed. The method for applying for a plurality of memory blocks with the same size to the server can be realized through a malloc function, wherein the malloc function is a function for applying for allocating memory space to a system, and the memory blocks can be applied to the server through the malloc function. Applying for a memory block, that is, applying for a read-write address of the memory, for example: the memory segment applying for the 0000h-1000h read-write address of the memory is used as a memory block, and applying for a plurality of memory blocks is to apply for a plurality of memory segments in the memory.
In step S102, each piece of data to be distributed is traversed, and the size of each piece of data to be distributed is obtained.
In the embodiment of the present invention, the server traverses the data to be distributed in the hard disk, and obtains the size of each piece of data to be distributed, for example: obtaining a picture A through traversal: 50kb, document B: 100kb, etc. It should be noted that the traversal may be performed for all data to be distributed at one time, or may be performed in batches (for example, 30% for the first traversal and 70% for the second traversal).
In step S103, the size of each piece of data to be distributed is compared with the size of the memory block.
In step S104, according to the comparison result, writing each piece of data to be distributed into the memory block.
In the embodiment of the present invention, the server compares the size of each piece of traversed data to be distributed with the size of a single memory block, and allocates each piece of data to be distributed to memory blocks of different numbers according to the comparison result. The step of writing each piece of data to be distributed into the memory block according to the comparison result includes:
1. and acquiring each piece of data to be distributed in the file.
In the embodiment of the invention, a plurality of pieces of data are stored in one application, a user firstly obtains each piece of data from a file of the application, and the obtained data is data to be distributed.
2. And dividing the acquired data to be distributed into different groups according to a preset dividing rule.
In the embodiment of the invention, a user divides each acquired data to be distributed into different groups according to a preset division rule. For example, the following steps are carried out: the data stored in an application may be of various types, including: video data, picture data, document data, the division rule can be preset to "grouping by data type", that is, the data to be distributed can be divided into "video data group", "picture data group", and "document data group".
3. Writing the data to be distributed in the group into the memory block according to the comparison result, wherein the writing comprises: if the size of the data to be distributed is smaller than or equal to one memory block, writing the data to be distributed into one memory block; or, if the size of the data to be distributed is larger than that of at least one of the memory blocks, writing the data to be distributed into at least two of the memory blocks.
In the embodiment of the present invention, data is read from different groups, that is, data to be distributed is read sequentially according to a preset partition rule, but the size of each piece of data to be distributed is different, so that in the step of writing each piece of data into the memory block, different methods are used:
(1) and if the size of one piece of data is smaller than or equal to the size of one memory block, directly writing the data into the memory block.
(2) And if the size of one piece of data is larger than that of at least one memory block, writing the data into at least two memory blocks.
In the embodiment of the present invention, each memory block has a buf (buffer), and if the size of a piece of data to be distributed exceeds the size of the buffer, the buffer will be punctured, causing data overflow, and the data overflow will have a large impact on the performance of the server in the subsequent management. Therefore, when the size of a piece of data to be distributed is larger than the size of at least one memory block, the data needs to be written into at least two memory blocks in order to prevent the buffer from being punctured. The memory block of the aforementioned application is the read-write address in the memory: if the size of the data to be distributed is smaller than or equal to the size of one memory block, writing the data to be distributed into a memory address corresponding to the memory block; and if the size of the data to be distributed is larger than that of at least one memory block, writing the data to be distributed into at least two memory blocks with continuous memory addresses.
In step S105, the data to be distributed in the memory block is written into a corresponding file.
In this embodiment of the present invention, after the data to be distributed is written into the memory block, the data in the memory block needs to be rewritten into a corresponding file, where the corresponding file is a file established according to a certain rule, for example: files established according to the attributes of the data (picture files, i.e. files that only store the picture attributes; text files, i.e. files that only store the text attributes), etc. The file establishing rule can be established according to actual use requirements, and is not limited herein. Through this step, the space of the memory block can be released, so that the memory block can perform the next data distribution. The method for releasing the space of the memory block can be realized by an unmalloc function. The step of writing the data to be distributed in the memory block into a corresponding file includes:
writing the data to be distributed in one memory block into a corresponding file; or,
and writing the data to be distributed in at least two memory blocks into corresponding files.
In the embodiment of the present invention, the server reads the data to be distributed from one memory block or at least two memory blocks, that is, reads the data to be distributed from one memory address or at least two consecutive memory addresses, and writes the read data to be distributed into the hard disk.
The embodiment of the invention applies for a plurality of memory blocks with the same size, when the size of the data to be distributed is larger than that of at least one memory block, the data is written into at least two memory blocks, and the data in the memory blocks is written into the corresponding files.
As an optional embodiment of the present invention, after the step of writing the data to be distributed in the memory block into the corresponding file, the method further includes:
and releasing the memory block to enable the memory block to execute the next data writing operation to be distributed.
Example two
Fig. 2 is a block diagram of a redistribution data system according to an embodiment of the present invention, and for convenience of description, only a part related to the embodiment of the present invention is shown, including:
the memory block applying unit 201 is configured to apply for a plurality of memory blocks with the same size.
In the embodiment of the present invention, the memory block applying unit 201 applies for a plurality of memory blocks with the same size to a server storing data to be distributed. The method for applying for the memory blocks with the same size to the server can be realized through a malloc function, wherein the malloc function is a function for applying for allocating memory space to a system, and the memory blocks can be applied to the server through the malloc function. Applying for a memory block, that is, applying for a read-write address of the memory, for example: the memory segment applying for the 0000h-1000h read-write address of the memory is used as a memory block, and applying for a plurality of memory blocks is to apply for a plurality of memory segments in the memory.
A data size obtaining unit 202, configured to traverse each piece of data to be distributed after the memory block applying unit 201 applies the data, and obtain the size of each piece of data to be distributed.
In the embodiment of the present invention, the server traverses the data to be distributed in the hard disk, and obtains the size of each piece of data to be distributed, for example: obtaining a picture A through traversal: 50kb, document B: 100kb, etc. It should be noted that the traversal may be performed for all data to be distributed at one time, or may be performed in batches (for example, 30% for the first traversal and 70% for the second traversal).
A comparing unit 203, configured to compare the size of each piece of data to be distributed acquired by the data size acquiring unit 202 with the size of the memory block applied by the memory block applying unit 201.
A writing unit 204, configured to write each piece of data to be distributed into the memory block according to the result of the comparison by the comparing unit 203.
In the embodiment of the present invention, the server compares the size of each piece of traversed data to be distributed with the size of a single memory block, and allocates each piece of data to be distributed to memory blocks of different numbers according to the comparison result. The writing unit 204 includes:
the obtaining subunit 2041 is configured to obtain each piece of data to be distributed in the file.
In the embodiment of the invention, a plurality of pieces of data are stored in one application, a user firstly obtains each piece of data from a file of the application, and the obtained data is data to be distributed.
The dividing subunit 2042 is configured to divide the data to be distributed, acquired by the acquiring subunit 2041, into different groups according to a preset dividing rule.
In the embodiment of the invention, a user divides each acquired data to be distributed into different groups according to a preset division rule. For example, the following steps are carried out: the data stored in an application may be of various types, including: video data, picture data, document data, the division rule can be preset to "grouping by data type", that is, the data to be distributed can be divided into "video data group", "picture data group", and "document data group".
A writing subunit 2043, configured to write the data to be distributed in the group divided by the dividing subunit 2042 into the memory block according to the comparison result, where the writing includes: if the size of the data to be distributed is smaller than or equal to one memory block, writing the data to be distributed into one memory block; or, if the size of the data to be distributed is larger than that of at least one of the memory blocks, writing the data to be distributed into at least two of the memory blocks.
In the embodiment of the present invention, data is read from different groups, that is, data to be distributed is read sequentially according to a preset partition rule, but the size of each piece of data to be distributed is different, so that in the step of writing each piece of data into the memory block, different methods are used:
(1) and if the size of one piece of data is smaller than or equal to the size of one memory block, directly writing the data into the memory block.
(2) And if the size of one piece of data is larger than that of at least one memory block, writing the data into at least two memory blocks.
In the embodiment of the present invention, each memory block has a buf (buffer), and if the size of a piece of data to be distributed exceeds the size of the buffer, the buffer will be punctured, causing data overflow, and the data overflow will have a large impact on the performance of the server in the subsequent management. Therefore, when the size of a piece of data to be distributed is larger than the size of at least one memory block, the data needs to be written into at least two memory blocks in order to prevent the buffer from being punctured. The memory block of the aforementioned application is the read-write address in the memory: if the size of the data to be distributed is smaller than or equal to the size of one memory block, writing the data to be distributed into a memory address corresponding to the memory block; and if the size of the data to be distributed is larger than that of at least one memory block, writing the data to be distributed into at least two memory blocks with continuous memory addresses.
A corresponding file writing module 205, configured to write the data to be distributed, which is written into the memory block by the memory block writing unit 204, into a corresponding file.
In this embodiment of the present invention, after the data to be distributed is written into the memory block, the corresponding file writing module 203 needs to rewrite the data in the memory block into a corresponding file, where the corresponding file is a file established according to a certain rule, for example: files established according to the attributes of the data (picture files, i.e. files that only store the picture attributes; text files, i.e. files that only store the text attributes), etc. The file establishing rule can be established according to actual use requirements, and is not limited herein. Through this step, the space of the memory block can be released, so that the memory block can perform the next data distribution. The corresponding file writing module 205 includes:
the first file corresponding write subunit 2051 is configured to write the data to be distributed in one memory block into a corresponding file; or,
the second file is written into the subunit 2052 correspondingly, and is configured to write the data to be distributed in at least two of the memory blocks into the corresponding file.
In the embodiment of the present invention, the server reads the data to be distributed from one memory block or at least two memory blocks, that is, reads the data to be distributed from one memory address or at least two consecutive memory addresses, and writes the read data to be distributed into the hard disk.
The embodiment of the invention applies for a plurality of memory blocks with the same size, when the size of the data to be distributed is larger than that of at least one memory block, the data is written into at least two memory blocks, and the data in the memory blocks is written into the corresponding files.
As an optional embodiment of the present invention, after the corresponding file writing unit 205 writes, the system further includes:
a releasing unit 206, configured to release the memory block, so that the memory block executes a next data writing operation to be distributed.
Those skilled in the art can understand that each unit included in the second embodiment is only divided according to functional logic, but is not limited to the above division as long as the corresponding function can be realized; in addition, specific names of the functional units are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present invention.
It will be further understood by those skilled in the art that all or part of the steps in the method for implementing the above embodiments may be implemented by relevant hardware instructed by a program stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (10)
1. A method of redistributing data, characterized in that the method comprises the steps of:
applying for a plurality of memory blocks with the same size;
traversing each piece of data to be distributed to obtain the size of each piece of data to be distributed;
comparing the size of each piece of data to be distributed with the size of the memory block;
writing each piece of data to be distributed into the memory block according to the comparison result;
and writing the data to be distributed in the memory block into a corresponding file.
2. The method according to claim 1, wherein the step of writing each piece of data to be distributed into the memory block according to the comparison result comprises:
acquiring each piece of data to be distributed in a file;
dividing the acquired data to be distributed into different groups according to a preset division rule;
writing the data to be distributed in the group into the memory block according to the comparison result, wherein the writing comprises: if the size of the data to be distributed is smaller than or equal to one memory block, writing the data to be distributed into one memory block; or, if the size of the data to be distributed is larger than that of at least one of the memory blocks, writing the data to be distributed into at least two of the memory blocks.
3. The method according to claim 2, wherein the step of writing the data to be distributed in the memory blocks into corresponding files comprises:
writing the data to be distributed in one memory block into a corresponding file; or,
and writing the data to be distributed in at least two memory blocks into corresponding files.
4. The method according to claims 1 to 3, wherein the step of applying for a plurality of memory blocks with the same size includes:
and applying for a plurality of memory blocks with the same size through a malloc function.
5. The method according to claims 1 to 3, wherein after the step of writing the data to be distributed in the memory blocks into the corresponding files, the method further includes:
and releasing the memory block to enable the memory block to execute the next data writing operation to be distributed.
6. A system for redistributing data, the system comprising:
the memory block application unit is used for applying for a plurality of memory blocks with the same size;
a data size obtaining unit, configured to traverse each piece of data to be distributed after the memory block application unit applies the application, and obtain the size of each piece of data to be distributed;
a comparing unit, configured to compare the size of each piece of data to be distributed acquired by the data size acquiring unit with the size of the memory block applied by the memory block applying unit;
the writing unit is used for writing each piece of data to be distributed into the memory block according to the comparison result of the comparison unit;
and the corresponding file writing unit is used for writing the data to be distributed, which is written into the memory block by the writing unit, into a corresponding file.
7. The system of claim 6, wherein the write unit comprises:
the acquisition subunit is used for acquiring each piece of data to be distributed in the file;
the dividing subunit is used for dividing the data to be distributed acquired by the acquiring subunit into different groups according to a preset dividing rule;
a writing subunit, configured to write, according to a comparison result, to-be-distributed data in a group divided by the dividing subunit into the memory block, where the writing includes: if the size of the data to be distributed is smaller than or equal to one memory block, writing the data to be distributed into one memory block; or, if the size of the data to be distributed is larger than that of at least one of the memory blocks, writing the data to be distributed into at least two of the memory blocks.
8. The system of claim 7, wherein the corresponding file writing unit comprises:
the first file corresponding write subunit is configured to write the data to be distributed in one memory block into a corresponding file; or,
and the second file corresponds to the write subunit and is used for writing the data to be distributed in at least two memory blocks into the corresponding file.
9. The system according to any of claims 6 to 8, wherein the step of the memory block applying unit applying for a memory block includes:
and applying for a plurality of memory blocks with the same size through a malloc function.
10. The system of claims 6-8, wherein after the corresponding file writing unit writes, the system further comprises:
and a releasing unit, configured to release the memory block, so that the memory block executes a next data write operation to be distributed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310268751.7A CN104252415B (en) | 2013-06-28 | 2013-06-28 | Method and system for redistributing data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310268751.7A CN104252415B (en) | 2013-06-28 | 2013-06-28 | Method and system for redistributing data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104252415A true CN104252415A (en) | 2014-12-31 |
| CN104252415B CN104252415B (en) | 2021-07-16 |
Family
ID=52187340
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310268751.7A Active CN104252415B (en) | 2013-06-28 | 2013-06-28 | Method and system for redistributing data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104252415B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105989008A (en) * | 2015-01-27 | 2016-10-05 | 炬芯（珠海）科技有限公司 | Method and device for enabling data to write in mirror image documents |
| CN107562651A (en) * | 2017-07-20 | 2018-01-09 | 郑州云海信息技术有限公司 | A kind of data cache method and Data Buffer Memory |
| CN109117273A (en) * | 2018-08-17 | 2019-01-01 | 腾讯科技（深圳）有限公司 | Date storage method, device and equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070223875A1 (en) * | 2006-03-21 | 2007-09-27 | Tsung-Ning Chung | Storage device and method of accessing storage device |
| CN101226553A (en) * | 2008-02-03 | 2008-07-23 | 中兴通讯股份有限公司 | Method and device for storing length-various field of embedded database |
| CN101369440A (en) * | 2007-08-15 | 2009-02-18 | 凌阳科技股份有限公司 | Methods for generating and playing multimedia file and recording medium storing multimedia file |
| CN101404764A (en) * | 2008-10-30 | 2009-04-08 | 宁波中科集成电路设计中心有限公司 | Internal memory management method in audio/video decoding course |
| CN102436421A (en) * | 2010-09-29 | 2012-05-02 | 腾讯科技（深圳）有限公司 | Data caching method |
-
2013
- 2013-06-28 CN CN201310268751.7A patent/CN104252415B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070223875A1 (en) * | 2006-03-21 | 2007-09-27 | Tsung-Ning Chung | Storage device and method of accessing storage device |
| CN101369440A (en) * | 2007-08-15 | 2009-02-18 | 凌阳科技股份有限公司 | Methods for generating and playing multimedia file and recording medium storing multimedia file |
| CN101226553A (en) * | 2008-02-03 | 2008-07-23 | 中兴通讯股份有限公司 | Method and device for storing length-various field of embedded database |
| CN101404764A (en) * | 2008-10-30 | 2009-04-08 | 宁波中科集成电路设计中心有限公司 | Internal memory management method in audio/video decoding course |
| CN102436421A (en) * | 2010-09-29 | 2012-05-02 | 腾讯科技（深圳）有限公司 | Data caching method |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105989008A (en) * | 2015-01-27 | 2016-10-05 | 炬芯（珠海）科技有限公司 | Method and device for enabling data to write in mirror image documents |
| CN105989008B (en) * | 2015-01-27 | 2020-06-23 | 炬芯（珠海）科技有限公司 | Method and equipment for writing data into mirror image file |
| CN107562651A (en) * | 2017-07-20 | 2018-01-09 | 郑州云海信息技术有限公司 | A kind of data cache method and Data Buffer Memory |
| CN109117273A (en) * | 2018-08-17 | 2019-01-01 | 腾讯科技（深圳）有限公司 | Date storage method, device and equipment |
| CN109117273B (en) * | 2018-08-17 | 2021-09-07 | 腾讯科技（深圳）有限公司 | Data storage method, device and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104252415B (en) | 2021-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10885005B2 (en) | Disk optimized paging for column oriented databases | |
| US8983967B2 (en) | Data storage system having mutable objects incorporating time | |
| US10133666B2 (en) | File storage method and apparatus | |
| US9298389B2 (en) | Operating a memory management controller | |
| CN101533408B (en) | Processing method and processing device of mass data | |
| CN103020255B (en) | Classification storage means and device | |
| KR20170123336A (en) | File manipulation method and apparatus | |
| CN107391544B (en) | Processing method, device and equipment of column type storage data and computer storage medium | |
| CN102521330A (en) | Mirror distributed storage method under desktop virtual environment | |
| CN108345433B (en) | Method, memory system and product for maximized deduplication memory | |
| CN104199899A (en) | Method and device for storing massive pictures based on Hbase | |
| US10976946B2 (en) | Method and computer system for managing blocks | |
| CN104331453A (en) | Distributed file system and constructing method thereof | |
| CN103399823A (en) | Method, equipment and system for storing service data | |
| US10649967B2 (en) | Memory object pool use in a distributed index and query system | |
| CN103914483A (en) | File storage method and device and file reading method and device | |
| US10482012B1 (en) | Storage system and method of operating thereof | |
| CN104252415B (en) | Method and system for redistributing data | |
| US20150186255A1 (en) | Re-use of invalidated data in buffers | |
| US10180901B2 (en) | Apparatus, system and method for managing space in a storage device | |
| CN105808451B (en) | Data caching method and related device | |
| US11226738B2 (en) | Electronic device and data compression method thereof | |
| US10311026B2 (en) | Compressed data layout for optimizing data transactions | |
| CN104216666A (en) | Method and device for managing writing of disk data | |
| CN111435285B (en) | Data writing method and device for storage volume, electronic equipment and machine-readable storage medium |
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 |