CN108089825A - A kind of storage system based on distributed type assemblies - Google Patents

A kind of storage system based on distributed type assemblies Download PDF

Info

Publication number
CN108089825A
CN108089825A CN201810026676.6A CN201810026676A CN108089825A CN 108089825 A CN108089825 A CN 108089825A CN 201810026676 A CN201810026676 A CN 201810026676A CN 108089825 A CN108089825 A CN 108089825A
Authority
CN
China
Prior art keywords
file
module
size
client
cache
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
Application number
CN201810026676.6A
Other languages
Chinese (zh)
Other versions
CN108089825B (en
Inventor
陈保平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhengzhou Yunhai Information Technology Co Ltd
Original Assignee
Zhengzhou Yunhai Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhengzhou Yunhai Information Technology Co Ltd filed Critical Zhengzhou Yunhai Information Technology Co Ltd
Priority to CN201810026676.6A priority Critical patent/CN108089825B/en
Publication of CN108089825A publication Critical patent/CN108089825A/en
Application granted granted Critical
Publication of CN108089825B publication Critical patent/CN108089825B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • G06F3/0617Improving the reliability of storage systems in relation to availability
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608Saving storage space on storage systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Abstract

The present invention provides a kind of storage system based on distributed type assemblies, and file size judgment module is used to judge the size of client write-in file, and when the file size is less than the first preset value, storage processing module stores the file to cache module;File size judgment module is additionally operable to judge the size that client reads file, when the file size is less than the first preset value, the judging result of file size judgment module is fed back to client by storage processing module, and client reads the file by cache module;Cache size judgment module is used to judge the size for the aggregate file being stored in cache module by storage processing module, and when the size of the aggregate file reaches the second preset value, the aggregate file write-in in cache module is polymerize memory module by buffer process module.It is of the invention effectively to reduce small documents write-in disk number, it improves and reads hit rate.

Description

A kind of storage system based on distributed type assemblies
Technical field
The present invention relates to computer realm more particularly to a kind of storage systems based on distributed type assemblies.
Background technology
With the development of the times, substantial amounts of data file generates, and computer is single by file system management, storage data It is pure by way of increasing memory capacity of the hard disk number to extend computer file system, amount of capacity, capacity increase speed The performance of degree, data backup, data safety etc. is all barely satisfactory.Distributed file system can effectively solve depositing for data Storage and management problems, will be fixed on some file system in some place, expand to any number of places or multiple file system, Numerous nodes forms a Filesystem Network.Each node can be distributed in different places, and node is carried out by network Between communication and data transmission, establish huge group system.People are when using distributed file system, without being concerned about data It is stored on which node or is from which node from acquisition, it is only necessary to be managed as using local file system With the data in storage file system.
With the popularization of distributed memory system, application range increasingly extensively, when storage system applications shopping website, When under scenes, scene characteristic is that small documents are large number of for broadcasting and TV, Internet video, and space hold is generally in below 1M, operation It is characterized as write-once, repeatedly reads.Each small documents storage can perform once writes flow entirely, causes write pressure Greatly, disk space utilization rate is low, and analysis of metadata, reading data, time-consuming.
The content of the invention
In order to overcome above-mentioned deficiency of the prior art, the present invention provides a kind of storage system based on distributed type assemblies, Including:
Client, cache module, file size judgment module, cache size judgment module, storage processing module, caching process mould Block, the polymerization memory module for the plain memory modules that store general data file and for storing aggregate file;
File size judgment module is used to judge the size of client write-in file, is preset when the file size is less than first During value, storage processing module stores the file to cache module;File size judgment module is additionally operable to judge that client is read The size of file is taken, when the file size is less than the first preset value, stores processing module by file size judgment module Judging result feed back to client, client reads the file by cache module;
Cache size judgment module is used to judge the size for the aggregate file being stored in cache module by storage processing module, works as institute When the size for the aggregate file stated reaches the second preset value, the aggregate file in cache module is write polymerization by buffer process module Memory module.
Preferably, storage processing module is additionally operable to judge the file of client write-in more than the when file size judgment module During one preset value, the file is directly stored to plain memory modules;It is additionally operable to judge client when file size judgment module When the file that end is read is more than the first preset value, the judging result of file size judgment module is fed back into client, client The file is directly read from plain memory modules.
Preferably, buffer process module is used to that the aggregate file write-in polymerization in caching to be stored mould with close polymerization methods Block, buffer process module each pair polymerization memory module carry out a write operation and are respectively formed a polymerization with certain memory space Object;Buffer process module is additionally operable to generate an object head with certain memory space in each aggregate objects start bit.
Preferably, present invention additionally comprises:Cache location judgment module;
Cache location judgment module is used to judge that the file less than the first preset value that client is read whether there is in caching mould Block, when the file is not present in cache module, the aggregate objects belonging to the file are read in caching by buffer process module Module;Client reads the file by cache module.
Preferably, present invention additionally comprises:Timing cleaning modul;
Timing cleaning modul is used for the file in timing scan aggregate objects, and when the utilization rate of the file in aggregate objects is less than 3rd preset value and when not changed in the 4th preset value time before scanning, timing cleaning modul is by the aggregate objects In file write polymerization memory module according to close polymerization methods again and form new aggregate objects, and delete original polymerization Object.
Preferably, file size judgment module is additionally operable to write the file in polymerization memory module again when client When, file size judgment module judges again the size of written document, when the file size is more than the first preset value, at storage The file is copied to plain memory modules by reason module, and the file polymerizeing in memory module is deleted.
Preferably, the first preset value is less than the second preset value.
As can be seen from the above technical solutions, the present invention has the following advantages:
The present invention provides small documents polymerizations to design, and can effectively reduce small documents write-in disk number, and data pressure is write in mitigation; Disk utilization rate is improved, aggregate objects where small documents are read in into caching when reading small documents, improves and reads hit rate, shortens and reads I/O Path;Aggregate objects timing scan is cleared up, ensures small documents utilization rate, reduces unnecessary disk space consumption.
Description of the drawings
In order to illustrate more clearly of technical scheme, attached drawing needed in description will be made below simple Ground introduction, it should be apparent that, the accompanying drawings in the following description is only some embodiments of the present invention, for ordinary skill For personnel, without creative efforts, other attached drawings are can also be obtained according to these attached drawings.
Fig. 1 is schematic diagram of the present invention.
Fig. 2 is aggregate objects schematic diagram of the present invention.
Wherein, 1, client, 2, plain memory modules, 3, polymerization memory module, 4, cache module.
Specific embodiment
Goal of the invention, feature, advantage to enable the present invention is more apparent and understandable, will use below specific Embodiment and attached drawing, the technical solution protected to the present invention are clearly and completely described, it is clear that implementation disclosed below Example is only part of the embodiment of the present invention, and not all embodiment.Based on the embodiment in this patent, the common skill in this field All other embodiment that art personnel are obtained without making creative work belongs to the model of this patent protection It encloses.
The present invention provides a kind of storage system based on distributed type assemblies, as shown in Figure 1, including:
Client 1, cache module 4, file size judgment module, cache size judgment module, storage processing module, caching process Module, the polymerization memory module 3 for the plain memory modules 2 that store general data file and for storing aggregate file;
File size judgment module is used to judge the size that client 1 writes file, when the file size is less than first in advance If during value, storage processing module stores the file to cache module 4;File size judgment module is additionally operable to judge client 1 reads the size of file, and when the file size is less than the first preset value, file size is judged mould by storage processing module The judging result of block feeds back to client 1, and client 1 reads the file by cache module 4;
Cache size judgment module is used to judge the size for the aggregate file being stored in cache module 4 by storage processing module, when When the size of the aggregate file reaches the second preset value, buffer process module writes the aggregate file in cache module 4 It polymerize memory module 3.
Storage processing module is additionally operable to judge that the file that client 1 writes is more than first and presets when file size judgment module During value, the file is directly stored to plain memory modules 2;It is additionally operable to judge that client 1 is read when file size judgment module When the file taken is more than the first preset value, the judging result of file size judgment module is fed back into client 1, client 1 is straight It connects and the file is read from plain memory modules 2.
Buffer process module is used to that the aggregate file write-in in caching to be polymerize memory module 3 with close polymerization methods, delays It deposits the processing module each pair polymerization write operation of progress of memory module 3 and is respectively formed a polymerization pair with certain memory space As;Buffer process module is additionally operable to generate an object head with certain memory space in each aggregate objects start bit.
Present invention additionally comprises:Cache location judgment module;
Cache location judgment module is used to judge that the file less than the first preset value that client 1 is read whether there is in caching mould Block 4, when the file is not present in cache module 4, buffer process module reads in the aggregate objects belonging to the file slow Storing module 4;Client 1 reads the file by cache module 4.
Present invention additionally comprises:Timing cleaning modul;
Timing cleaning modul is used for the file in timing scan aggregate objects, and when the utilization rate of the file in aggregate objects is less than 3rd preset value and when not changed in the 4th preset value time before scanning, timing cleaning modul is by the aggregate objects In file write polymerization memory module 3 according to close polymerization methods again and form new aggregate objects, and delete original poly- Close object.In aggregate file, multiple one aggregate objects of file sharing, aggregate objects institute can not really be discharged by deleting file The space occupied causes the waste of memory space;The reduction of small documents quantity of documents simultaneously causes to cache life when reading file Middle rate reduces, and influences reading performance.So deleting original aggregate objects, establish new aggregate objects and be only effectively manner of cleaning up.
File size judgment module is additionally operable to when client 1 writes the file in polymerization memory module 3 again, file Size judgment module judges again the size of written document, when the file size is more than the first preset value, stores processing module The file is copied to plain memory modules 2, and the file polymerizeing in memory module 3 is deleted.
First preset value is less than the second preset value.
A specific embodiment is indicated below:
Client 1 sends written document request, and file size judgment module judges that client 1 writes the size of file, when described When file size is less than 512KB, storage processing module stores the file to cache module 4;Client 1 sends reading file please It asks, when the file size is less than the first preset value, stores processing module by the judging result of file size judgment module Client 1 is fed back to, client 1 reads the file by cache module 4;
Cache size judgment module judges the size for the aggregate file being stored in cache module 4 by storage processing module, when described The size of aggregate file when reaching 4M, buffer process module is by the aggregate file write-in polymerization memory module in cache module 4 3;As shown in Fig. 2, buffer process module is stored the aggregate file write-in polymerization in caching with the close polymerization methods that 4K aligns Module 3, the buffer process module each pair polymerization write operation of progress of memory module 3, which is respectively formed one, has certain memory space Aggregate objects;Buffer process module is additionally operable to generate an object with certain memory space in each aggregate objects start bit Head.
Associated 4K alignment is a partitioning technique for being called " high-level formatting "." high-level formatting " is international hard disk Equipment and materials association are title used by new types of data architecture.
As time goes on, hard-disk capacity constantly extends so that 512 byte of each sector defined before is no longer so It is reasonable, each 512 byte of sector is then changed to each 4096 bytes in sector, that is, " the 4K sectors " often said now. With NTFS(New Technology File System are the file system of WindowsNT environment)Become standard Hard disk file system, the default allocation cell size of file system(Cluster)And 4096 bytes, in order to make cluster opposite with sector Should, even if physical hard disk subregion aligns with the logical partition that computer uses, ensure disk read-write efficiency, so just there is " 4K The concept of alignment ".
When file size judgment module judges that the file that client 1 writes is more than 512KB, storage processing module is by described in File directly stores to plain memory modules 2 or the judging result of file size judgment module is fed back to client 1, client The file is directly read from plain memory modules 2 in end 1.
The file less than the first preset value that the client 1 that cache location judgment module judges is read whether there is in caching mould Block 4, when the file is not present in cache module 4, buffer process module reads in the aggregate objects belonging to the file slow Storing module 4;Client 1 reads the file by cache module 4.
File in timing cleaning modul timing scan aggregate objects, and when the utilization rate of the file in aggregate objects is less than 3rd preset value and when not changed in the 4th preset value time before scanning, timing cleaning modul is by the aggregate objects In file write polymerization memory module 3 according to close polymerization methods again and form new aggregate objects, and delete original poly- Close object.
When client 1 writes the file in polymerization memory module 3 again, text is write in the judgement of file size judgment module again The size of part, when the file size is more than the first preset value, the file is copied to by storage processing module commonly to be deposited Module 2 is stored up, and the file polymerizeing in memory module 3 is deleted.
As shown in Fig. 2, file arranges in a manner that 4KB aligns in aggregate objects, there is the storage sky less than 4KB between file Between.
Each small documents minimum occupies 4KB spaces, and maximum occupies 512KB spaces, the maximum occupancy 512MB's of aggregate file In the case of, aggregate file small file quantity can be determined substantially.In the case where small documents size is 4KB, aggregate file is most Multipotency enough writes 130688 small documents;In the case where small documents size is 512KB, aggregate file is at best able to write-in 896 A small documents.
Computational methods are as follows:Aggregate file is maximum to occupy 512MB, and each aggregate objects are 4MB, then aggregate objects number: 512/4=128;Each aggregate objects are 4MB, and each aggregate objects have the object head of 12KB;Small text in each aggregate objects Part number:(4x1024-12)/ file size;Aggregate file small file number is:(4084/ source file size)*128.
Term " first ", " second ", " the 3rd " " in description and claims of this specification and above-mentioned attached drawing Four " etc.(If there is)It is the object for distinguishing similar, without being used to describe specific order or precedence.It should manage The data that solution so uses can exchange in the appropriate case, so as to the embodiment of the present invention described herein can with except Here the order beyond those for illustrating or describing is implemented.In addition, term " comprising " and " having " and their any deformation, It is intended to cover non-exclusive include.
The foregoing description of the disclosed embodiments enables professional and technical personnel in the field to realize or use the present invention. A variety of modifications of these embodiments will be apparent for those skilled in the art, it is as defined herein General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention The embodiments shown herein is not intended to be limited to, and is to fit to and the principles and novel features disclosed herein phase one The most wide scope caused.

Claims (7)

1. a kind of storage system based on distributed type assemblies, which is characterized in that including:
Client, cache module, file size judgment module, cache size judgment module, storage processing module, caching process mould Block, the polymerization memory module for the plain memory modules that store general data file and for storing aggregate file;
File size judgment module is used to judge the size of client write-in file, is preset when the file size is less than first During value, storage processing module stores the file to cache module;File size judgment module is additionally operable to judge that client is read The size of file is taken, when the file size is less than the first preset value, stores processing module by file size judgment module Judging result feed back to client, client reads the file by cache module;
Cache size judgment module is used to judge the size for the aggregate file being stored in cache module by storage processing module, works as institute When the size for the aggregate file stated reaches the second preset value, the aggregate file in cache module is write polymerization by buffer process module Memory module.
2. the storage system according to claim 1 based on distributed type assemblies, which is characterized in that
Storage processing module is additionally operable to when file size judgment module judges that the file of client write-in is more than the first preset value, The file is directly stored to plain memory modules;It is additionally operable to judge the file of client reading when file size judgment module During more than the first preset value, the judging result of file size judgment module is fed back into client, client is directly from commonly depositing The file is read in storage module.
3. the storage system according to claim 1 based on distributed type assemblies, which is characterized in that
Buffer process module is used to that the aggregate file write-in in caching to be polymerize memory module, caching process with close polymerization methods Module each pair polymerization memory module carries out a write operation and is respectively formed an aggregate objects with certain memory space;At caching Reason module is additionally operable to generate an object head with certain memory space in each aggregate objects start bit.
4. the storage system according to claim 3 based on distributed type assemblies, which is characterized in that
It further includes:Cache location judgment module;
Cache location judgment module is used to judge that the file less than the first preset value that client is read whether there is in caching mould Block, when the file is not present in cache module, the aggregate objects belonging to the file are read in caching by buffer process module Module;Client reads the file by cache module.
5. the storage system according to claim 3 based on distributed type assemblies, which is characterized in that
It further includes:Timing cleaning modul;
Timing cleaning modul is used for the file in timing scan aggregate objects, and when the utilization rate of the file in aggregate objects is less than 3rd preset value and when not changed in the 4th preset value time before scanning, timing cleaning modul is by the aggregate objects In file write polymerization memory module according to close polymerization methods again and form new aggregate objects, and delete original polymerization Object.
6. the storage system according to claim 1 based on distributed type assemblies, which is characterized in that
File size judgment module is additionally operable to when client writes the file in polymerization memory module again, and file size is sentenced Disconnected module judges again the size of written document, and when the file size is more than the first preset value, storage processing module is by described in File is copied to plain memory modules, and the file polymerizeing in memory module is deleted.
7. the storage system according to claim 1 based on distributed type assemblies, which is characterized in that
First preset value is less than the second preset value.
CN201810026676.6A 2018-01-11 2018-01-11 Storage system based on distributed cluster Active CN108089825B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810026676.6A CN108089825B (en) 2018-01-11 2018-01-11 Storage system based on distributed cluster

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810026676.6A CN108089825B (en) 2018-01-11 2018-01-11 Storage system based on distributed cluster

Publications (2)

Publication Number Publication Date
CN108089825A true CN108089825A (en) 2018-05-29
CN108089825B CN108089825B (en) 2020-07-07

Family

ID=62182051

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810026676.6A Active CN108089825B (en) 2018-01-11 2018-01-11 Storage system based on distributed cluster

Country Status (1)

Country Link
CN (1) CN108089825B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109002543A (en) * 2018-07-24 2018-12-14 北京京东尚科信息技术有限公司 A kind of method and apparatus of file storage
CN111177105A (en) * 2019-12-29 2020-05-19 浪潮电子信息产业股份有限公司 Mass file writing method, device, system and medium of distributed file system
CN111309702A (en) * 2020-02-28 2020-06-19 苏州浪潮智能科技有限公司 Method and system for aggregation between files
CN111488125A (en) * 2020-04-10 2020-08-04 西安交通大学 Cache Tier Cache optimization method based on Ceph cluster
CN112149026A (en) * 2020-10-20 2020-12-29 北京天华星航科技有限公司 Distributed data storage system based on web end

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104111804A (en) * 2014-06-27 2014-10-22 暨南大学 Distributed file system
CN105426127A (en) * 2015-11-13 2016-03-23 浪潮(北京)电子信息产业有限公司 File storage method and apparatus for distributed cluster system
CN105511802A (en) * 2015-11-24 2016-04-20 北京达沃时代科技有限公司 Buffer memory writing method and apparatus and synchronizing method and apparatus for disk cache region
CN107341267A (en) * 2017-07-24 2017-11-10 郑州云海信息技术有限公司 A kind of distributed file system access method and platform
CN107562915A (en) * 2017-09-12 2018-01-09 郑州云海信息技术有限公司 Read the method, apparatus and equipment and computer-readable recording medium of small documents

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104111804A (en) * 2014-06-27 2014-10-22 暨南大学 Distributed file system
CN105426127A (en) * 2015-11-13 2016-03-23 浪潮(北京)电子信息产业有限公司 File storage method and apparatus for distributed cluster system
CN105511802A (en) * 2015-11-24 2016-04-20 北京达沃时代科技有限公司 Buffer memory writing method and apparatus and synchronizing method and apparatus for disk cache region
CN107341267A (en) * 2017-07-24 2017-11-10 郑州云海信息技术有限公司 A kind of distributed file system access method and platform
CN107562915A (en) * 2017-09-12 2018-01-09 郑州云海信息技术有限公司 Read the method, apparatus and equipment and computer-readable recording medium of small documents

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109002543A (en) * 2018-07-24 2018-12-14 北京京东尚科信息技术有限公司 A kind of method and apparatus of file storage
CN111177105A (en) * 2019-12-29 2020-05-19 浪潮电子信息产业股份有限公司 Mass file writing method, device, system and medium of distributed file system
CN111177105B (en) * 2019-12-29 2022-03-22 浪潮电子信息产业股份有限公司 Mass file writing method, device, system and medium of distributed file system
CN111309702A (en) * 2020-02-28 2020-06-19 苏州浪潮智能科技有限公司 Method and system for aggregation between files
CN111488125A (en) * 2020-04-10 2020-08-04 西安交通大学 Cache Tier Cache optimization method based on Ceph cluster
CN112149026A (en) * 2020-10-20 2020-12-29 北京天华星航科技有限公司 Distributed data storage system based on web end
CN112149026B (en) * 2020-10-20 2021-04-02 北京天华星航科技有限公司 Distributed data storage system based on web end

Also Published As

Publication number Publication date
CN108089825B (en) 2020-07-07

Similar Documents

Publication Publication Date Title
US11036799B2 (en) Low RAM space, high-throughput persistent key value store using secondary memory
CN108089825A (en) A kind of storage system based on distributed type assemblies
CN104899156B (en) A kind of diagram data storage and querying method towards extensive social networks
US7761648B2 (en) Caching method for NAND flash translation layer
CN107066393A (en) The method for improving map information density in address mapping table
CN106708427A (en) Storage method suitable for key value pair data
CN103838853B (en) Mixed file system based on different storage media
CN100541453C (en) Large capacity cache implementation method and storage system
CN102023810B (en) Method and device for writing data and redundant array of inexpensive disk
CN103399823B (en) The storage means of business datum, equipment and system
CN101488153A (en) Method for implementing high-capacity flash memory file system in embedded type Linux
CN106293521A (en) A kind of mapping granule adaptive flash translation layer (FTL) management method
CN103440207A (en) Caching method and caching device
CN104503703B (en) The treating method and apparatus of caching
CN100424699C (en) Attribute extensible object file system
CN106227471A (en) Solid state hard disc and the data access method being applied to solid state hard disc
CN103019884A (en) Memory page de-weight method and memory page de-weight device based on virtual machine snapshot
CN103593477A (en) Collocation method and device of Hash database
CN107423229B (en) Buffer area improvement method for page-level FTL
Lee et al. An efficient index buffer management scheme for implementing a B-tree on NAND flash memory
CN113626431A (en) LSM tree-based key value separation storage method and system for delaying garbage recovery
CN107168651A (en) A kind of small documents polymerize storage processing method
CN110262982A (en) A kind of method of solid state hard disk address of cache
CN109407985A (en) A kind of method and relevant apparatus of data management
CN103942301A (en) Distributed file system oriented to access and application of multiple data types

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