CN109521959A - One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing - Google Patents

One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing Download PDF

Info

Publication number
CN109521959A
CN109521959A CN201811296432.6A CN201811296432A CN109521959A CN 109521959 A CN109521959 A CN 109521959A CN 201811296432 A CN201811296432 A CN 201811296432A CN 109521959 A CN109521959 A CN 109521959A
Authority
CN
China
Prior art keywords
key
ssd
data
value
smr disk
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201811296432.6A
Other languages
Chinese (zh)
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.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
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 Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN201811296432.6A priority Critical patent/CN109521959A/en
Publication of CN109521959A publication Critical patent/CN109521959A/en
Pending legal-status Critical Current

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/061Improving I/O performance
    • 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/0671In-line storage system
    • G06F3/0673Single storage device
    • G06F3/068Hybrid storage device

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses one kind to be based on SSD-SMR disk mixing key assignments memory system data method for organizing, in data storage procedure, data are stored into key-value pair decoupling storage in the mixing storage system being made of SSD and SMR disk in Index process, according to data characteristics by data distribution to SSD and SMR disk, key in key-value pair is stored in SSD, value in key-value pair is stored in SMR disk, after receiving upper layer application transmission request instruction, LSM tree on memory and SSD searches target key, according to lookup result, carry out command adapted thereto operation, distribution is broken up into the conjunction of key assignments data decoupler, realize maximally utilizing for mixing storage, it is applied to optimize to data access speed using the high-performance of SSD and the large capacity feature of SMR disk, design and implementation is low The mixing key assignments storage system of cost, high-performance and large capacity.The present invention can optimize reading and writing data speed, realize low cost, the mixing key assignments storage system of high-performance and large capacity.

Description

One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing
Technical field
The present invention relates to computers to mix storage system field, more particularly to a kind of is mixed based on SSD-SMR disk Key assignments memory system data method for organizing.
Background technique
With the rapid development of the emerging technologies such as mobile Internet, cloud computing, Internet of Things, information-intensive society enters networking Big data era.The quickly global mobile data flow of universal Intelligent mobile terminal (computer, mobile phone, plate etc.) boosting Increase substantially." the digital universe " of IDC LLC reports display, from 2005 to the year two thousand twenty whole world it is annual create, duplication and The data volume used will increase by 300 times, rise to 40ZB from 130EB.The current total amount of data of Baidu is more than 1000PB, daily Web data to be treated reaches 10PB~100PB;Taobao's aggregate transaction data amount is up to 100PB.It among these include magnanimity The unstructured datas such as picture, video, text, voice, however traditional relevant database can only be used to storage organization Data, with the exponential growth of data volume, relevant database can not be applicable in big data era.Solve this problem Efficient scheme is exactly to use non-relational database, and the key assignments (Key-Value, KV) in non-relational database is stored in big data Epoch play vital role, have been widely used in the fields such as search engine, e-commerce, social networks, In more mature product have BigTable, LevelDB of Google company, HBase, Cassandra of Facebook company And RocksDB, the PNUTS of Yahoo, the Atlas etc. of Baidu company.
At present the storage medium of mainstream capacity, cost, performance, in terms of there are great differences, if using single The covered range of needs of one storage medium building key assignments storage system institute is limited.Heterogeneous storage medium is integrated in one It rises, constitutes mixing storage system, respective advantage can be played, maximized favourable factors and minimized unfavourable ones, demand coverage area can be expanded significantly.It will be high The novel storage medium of performance and the disk combination of large capacity are the common approach for mixing storage system, due to a watt record (Shingled Magnetic Recording, SMR) disk storage capacity is big and flash memory solid-state disk (the Solid based on NAND State Disk, SSD) the fast characteristic of read or write speed, the integrated of SSD and SMR disk met high capacity, high-performance and low cost Demand.
Integrate SSD and SMR disk directly simply to construct the mixing key assignments storage system based on SSD-SMR with level framework It is unable to fully the characteristic of the high-performance and SMR magnetic disk mass using SSD.The reason is that disk manufacturer is in order to be compatible with traditional soft Part joined conversion layer to shield internal structure difference, such as flash translation layer (FTL) (the Flash Translation of SSD wherein Layers, FTL) and SMR watt record conversion layer (Shingled Translation Layers, STL), and conversion layer is deposited Causing upper layer application that can not perceive its internal structure, to can not carry out going deep into optimization for its internal structure.
Summary of the invention
The purpose of the present invention is to provide one kind to be based on SSD-SMR disk mixing key assignments memory system data method for organizing, With overcome the deficiencies in the prior art.
In order to achieve the above objectives, the present invention adopts the following technical scheme:
One kind will be counted in data storage procedure based on SSD-SMR disk mixing key assignments memory system data method for organizing According to key-value pair decoupling storage in the mixing storage system being made of SSD and SMR disk in storage Index process, according to number According to feature by data distribution to SSD and SMR disk, the key in key-value pair is stored in SSD, the value in key-value pair is stored in SMR disk, after receiving upper layer application transmission request instruction, the LSM tree on memory and SSD searches target key, according to Lookup result carries out command adapted thereto operation.
Further, key assignments index LSM tree is stored in SSD by the index based on LSM tree building key assignments storage system.
Further, the node of LSM tree is address tuple, with four-tuple < key, value-address, value- Offset, value-size > expression;Key is globally unique, is the identifier of value;Value-address and value- Offset is respectively directed to address and the deviant of daily record data.
Further, value is stored in a manner of daily record data in SMR disk.
Further, in SMR data in magnetic disk storing process, when the capacity of each value is greater than its own available capacity Threshold value when, and storage system at this time load it is relatively light when, carry out garbage reclamation at this time, the granularity of garbage reclamation is needle To each key-value pair carry out, and each key-value pair carry out garbage collection operation be it is businesslike, first on SMR disk It divides data collection according to Zone (region), pointer tuple is then updated on SSD, then it is complete for the garbage reclamation of this key-value pair At.
Further, after storage system, which receives upper layer application, sends read request, the LSM tree traversed first in memory is looked into Target key is looked for, if searching failure, then the LSM tree on SSD searches target key, if searching failure, then returns to user Error message shows that this key is not stored in storage system, if finding target key, reads the finger where current key Needle nodal information, the value of SMR disk is read according to pointer nodal information, and returns data to user.
Further, after storage system, which receives upper layer application, sends write request, traversal is on memory and SSD first LSM tree searches target key, if searching failure, shows to be this time write operation, new space is distributed on SMR disk, will Value is written to the first address of free space, and address information and deviant, data size information and key are then combined into four This tuple is inserted into LSM tree by tuple;If searching successfully, this operation is to update operation, at this time first on SMR disk The original of value spatially adds new data, then updates nodal information on LSM tree.
Compared with prior art, the invention has the following beneficial technical effects:
It is of the invention a kind of based on SSD-SMR disk mixing key assignments memory system data method for organizing, in data storage procedure In, data are stored into the key-value pair in Index process and decoupling in the mixing storage system being made of SSD and SMR disk are deposited Storage, according to data characteristics by data distribution to SSD and SMR disk, is stored in SSD for the key in key-value pair, will be in key-value pair Value is stored in SMR disk, and after receiving upper layer application transmission request instruction, the LSM tree on memory and SSD searches target Key carries out command adapted thereto operation according to lookup result, and distribution is broken up in the conjunction of key assignments data decoupler, realizes the maximum of mixing storage Change and utilizes.The layout type of data has been largely fixed systematicness in the mixing key assignments storage of SSD and SMR disk composition Can, the Method of Data Organization of the decoupling key assignments storage of the present invention in most cases can all be hit using the read-write of key and is buffered in The LSM tree of memory and value are stored by the way of additional write, and maximum dynamics excavates mixing storage system maximum performance, are reduced Carrying cost;Optimized using the high-performance of SSD and the large capacity feature of SMR disk using to data access speed, design and Realize low cost, the mixing key assignments storage system of high-performance and large capacity.The present invention can optimize reading and writing data speed, realize low The mixing key assignments storage system of cost, high-performance and large capacity.
Further, pointer tuple is stored in SSD, pointer tuple value as corresponding to key and its is in SMR disk Address space composition, key assignments storage system can read and write the value on SMR disk according to key access pointer tuple;? SMR disk storage log data block, value is stored in a manner of log, i.e., write-in or more new capital are write in a manner of additional write every time Enter to improve write performance, Value additional write back in a manner of log brings redundant storage expense, storage system can periodically into Row cleaning compression, deletes original data information to save storage resource.
Detailed description of the invention
Fig. 1 is that key assignments mixes storage system architecture diagram.
Fig. 2 is key assignments of the present invention separation storage schematic diagram.
Fig. 3 is that key assignments storage system of the present invention reads schematic diagram.
Fig. 4 is that key assignments storage system of the present invention writes schematic diagram.
Specific embodiment
The invention will be described in further detail with reference to the accompanying drawing:
The organizational form of heterogeneous data in storage medium is always research hotspot, and common mode has building Hierarchical storage With storage extending transversely, i.e. SSD is combined as the cache layer or SSD and HDD of HDD in unified logical address space, the present invention Consider data organization feature in key assignments storage, selects the storage medium organizational form of storage extending transversely.HM-SSD and SMR disk It is that difference towards Host Administration, with conventional storage media is its internal physical structure to upper layer application exposure, upper layer is answered With can make corresponding optimisation strategy according to its physical structure, therefore both media are that the present invention provides hardware supporteds. The Method of Data Organization that the present invention designs make full use of SSD high-performance and SMR disk large capacity feature come optimize using pair Data access speed, design and implementation low cost, the mixing key assignments storage system of high-performance and large capacity.
One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing, is based on HM-SSD and HM-SMR magnetic The storage system extending transversely of disk composition, the key-value pair Key and Value of key assignments storage occur in pairs, Key Value Data amount It is small, for indexing;Value data volume is larger, for storing data;Data are stored into the key-value pair in Index process by SSD With decoupling storage in the mixing storage system of SMR disk composition, according to data characteristics by data distribution to SSD and SMR disk, By the biggish small documents of access frequency, i.e. key in key-value pair is stored in SSD, the less big file of access frequency, i.e. key-value pair In value be stored in SMR disk, the compromise of performance and cost is realized with this.
As shown in Figure 1, underlying storage medium is made up of HM-SSD and HM-SMR disk physical bus interconnection, host side Conversion layer (TL) is made of multiple software modules, including data management, garbage reclamation, cache management and address of cache function mould Block, this partial function module realize that upper layer application externally provides key-value pair storage service in operating system software layer.
It is primarily based on SSD-SMR disk mixing key assignments memory system data treatment process, as shown in Fig. 2, key assignments is indexed LSM tree is stored in SSD, and the node of LSM tree is address tuple, with four-tuple < key, value-address, value- Offset, value-size > expression, key are globally unique, are the identifiers of value, value is in SMR disk with log The mode of data stores, and value-address and value-offset are respectively directed to address and the deviant of daily record data;
SMR disk itself updates, since the value of SMR disk is that addition is write in a manner of log, it is therefore desirable to periodically Garbage collection operation, specific garbage collection procedure: when each value capacity be greater than its own available capacity threshold value When, and storage system at this time load it is relatively light when, carry out garbage reclamation at this time, the granularity of garbage reclamation is for each Key-value pair carry out, and each key-value pair carry out garbage collection operation be it is businesslike, first on SMR disk according to Zone (region) divides data collection, and pointer tuple is then updated on SSD, then completes for the garbage reclamation of this key-value pair.
It is illustrated in figure 3 key assignments storage system and reads schematic diagram, after storage system, which receives upper layer application, sends read request, The LSM tree traversed first in memory searches target key, if searching failure, then the LSM tree on SSD is searched, if searching Failure, then return to user's error message, show that this key is not stored in storage system, if finding target key, reads Pointer nodal information where key at present, the value of SMR disk is read according to pointer nodal information, and returns data to use Family.So far reading process terminates.
It is illustrated in figure 4 key assignments storage system and writes schematic diagram, after storage system, which receives upper layer application, sends write request, LSM tree of the traversal on memory and SSD first searches target key, if searching failure, shows to be this time write operation, in SMR magnetic New space is distributed on disk, and value is written to the first address of free space, it is then that address information and deviant, data is big Small information and key are combined into four-tuple, this tuple is inserted into LSM tree;If searching successfully, this operation is to update operation, It adds new data on original space of value first on SMR disk at this time, then updates nodal information on LSM tree.So far it reads Process terminates.
In data storage procedure, data are stored into the key-value pair in Index process and are mixed what is be made of SSD and SMR disk Decoupling storage in storage system is closed to deposit the key in key-value pair according to data characteristics by data distribution to SSD and SMR disk Be placed on SSD, the value in key-value pair be stored in SMR disk, according to receiving after upper layer application sends request instruction, in memory and LSM tree on SSD searches target key, according to lookup result, carries out command adapted thereto operation, and the conjunction of key assignments data decoupler is broken up point Cloth realizes maximally utilizing for mixing storage.The layout type for mixing data in key assignments storage of SSD and SMR disk composition is very System performance, the Method of Data Organization of the decoupling key assignments storage of the present invention, although the read-write process of data are determined in big degree Middle relative increase is once searched, but is buffered in the LSM tree of memory since the read-write of key in most cases can all be hit, and Value is stored by the way of additional write, and the performance of the total system of storage system can't be affected substantially, and the present invention is maximum Dynamics excavates mixing storage system maximum performance, reduces carrying cost;It is special using the high-performance of SSD and the large capacity of SMR disk Point is applied to optimize to data access speed, design and implementation low cost, the mixing key assignments storage system of high-performance and large capacity. The present invention can optimize reading and writing data speed, realize low cost, the mixing key assignments storage system of high-performance and large capacity.

Claims (7)

1. one kind is based on SSD-SMR disk mixing key assignments memory system data method for organizing, which is characterized in that stored in data Data are stored the key-value pair in Index process and decoupling in the mixing storage system being made of SSD and SMR disk deposited by Cheng Zhong Storage, according to data characteristics by data distribution to SSD and SMR disk, is stored in SSD for the key in key-value pair, will be in key-value pair Value is stored in SMR disk, and after receiving upper layer application transmission request instruction, the LSM tree on memory and SSD searches target Key carries out command adapted thereto operation according to lookup result.
2. it is according to claim 1 a kind of based on SSD-SMR disk mixing key assignments memory system data method for organizing, it is special Sign is, based on the index of LSM tree building key assignments storage system, key assignments index LSM tree is stored in SSD.
3. it is according to claim 2 a kind of based on SSD-SMR disk mixing key assignments memory system data method for organizing, it is special Sign is that the node of LSM tree is address tuple, with four-tuple < key, value-address, value-offset, value- Size > expression;Key is globally unique, is the identifier of value;Value-address and value-offset are respectively directed to The address of daily record data and deviant.
4. it is according to claim 3 a kind of based on SSD-SMR disk mixing key assignments memory system data method for organizing, it is special Sign is that value is stored in a manner of daily record data in SMR disk.
5. it is according to claim 1 a kind of based on SSD-SMR disk mixing key assignments memory system data method for organizing, it is special Sign is, in SMR data in magnetic disk storing process, when the capacity of each value is greater than the threshold value of its own available capacity, and And storage system at this time load it is relatively light when, carry out garbage reclamation at this time, the granularity of garbage reclamation is for each key assignments To progress, and each key-value pair carry out garbage collection operation be it is businesslike, first according to Zone on SMR disk (region) divides data collection, and pointer tuple is then updated on SSD, then completes for the garbage reclamation of this key-value pair.
6. it is according to claim 2 a kind of based on SSD-SMR disk mixing key assignments memory system data method for organizing, it is special Sign is, after storage system, which receives upper layer application, sends read request, the LSM tree traversed first in memory searches target key, If searching failure, then the LSM tree on SSD searches target key, if searching failure, then returns to user's error message, table This bright key is not stored in storage system, if finding target key, reads the pointer nodal information where current key, The value of SMR disk is read according to pointer nodal information, and returns data to user.
7. it is according to claim 2 a kind of based on SSD-SMR disk mixing key assignments memory system data method for organizing, it is special Sign is, after storage system, which receives upper layer application, sends write request, LSM tree of the traversal on memory and SSD first is searched Target key shows to be this time write operation, new space is distributed on SMR disk, value is written to sky if searching failure Address information and deviant, data size information and key are then combined into four-tuple by the first address of free space, by this tuple It is inserted into LSM tree;If searching successfully, this operation be update operation, at this time first on SMR disk value original sky Between upper additional new data, then update nodal information on LSM tree.
CN201811296432.6A 2018-11-01 2018-11-01 One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing Pending CN109521959A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811296432.6A CN109521959A (en) 2018-11-01 2018-11-01 One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811296432.6A CN109521959A (en) 2018-11-01 2018-11-01 One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing

Publications (1)

Publication Number Publication Date
CN109521959A true CN109521959A (en) 2019-03-26

Family

ID=65774281

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811296432.6A Pending CN109521959A (en) 2018-11-01 2018-11-01 One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing

Country Status (1)

Country Link
CN (1) CN109521959A (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110321367A (en) * 2019-06-28 2019-10-11 北京奇艺世纪科技有限公司 A kind of date storage method, data query method and relevant apparatus, electronic equipment
CN110347336A (en) * 2019-06-10 2019-10-18 华中科技大学 A kind of key assignments storage system based on NVM with SSD mixing storage organization
CN111026329A (en) * 2019-11-18 2020-04-17 华中科技大学 Key value storage system based on host management tile record disk and data processing method
CN111831423A (en) * 2019-04-15 2020-10-27 阿里巴巴集团控股有限公司 Method and system for realizing Redis memory database on nonvolatile memory
WO2021027340A1 (en) * 2019-08-13 2021-02-18 华为技术有限公司 Storage method and apparatus for key value (kv) and storage device
CN112395212A (en) * 2020-11-05 2021-02-23 华中科技大学 Method and system for reducing garbage recovery and write amplification of key value separation storage system
CN113094372A (en) * 2021-04-16 2021-07-09 三星(中国)半导体有限公司 Data access method, data access control device and data access system
CN113900590A (en) * 2021-09-28 2022-01-07 重庆紫光华山智安科技有限公司 Shingled disk storage method, apparatus, device and medium
CN116860722A (en) * 2023-08-31 2023-10-10 中国科学院软件研究所 Database persistence organization optimization method
WO2024060944A1 (en) * 2022-09-22 2024-03-28 超聚变数字技术有限公司 Key value storage method and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102971732A (en) * 2010-07-02 2013-03-13 华为技术有限公司 System architecture for integrated hierarchical query processing for key/value stores
WO2013174305A1 (en) * 2012-05-24 2013-11-28 华为技术有限公司 Ssd-based key-value type local storage method and system
CN103559027A (en) * 2013-10-22 2014-02-05 北京航空航天大学 Design method of separate-storage type key-value storage system
CN107066498A (en) * 2016-12-30 2017-08-18 成都华为技术有限公司 Key assignments KV storage methods and device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102971732A (en) * 2010-07-02 2013-03-13 华为技术有限公司 System architecture for integrated hierarchical query processing for key/value stores
WO2013174305A1 (en) * 2012-05-24 2013-11-28 华为技术有限公司 Ssd-based key-value type local storage method and system
CN103559027A (en) * 2013-10-22 2014-02-05 北京航空航天大学 Design method of separate-storage type key-value storage system
CN107066498A (en) * 2016-12-30 2017-08-18 成都华为技术有限公司 Key assignments KV storage methods and device

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LANYUE LU 等: "WiscKey: Separating Keys from Values in SSD-Conscious Storage", 《ACM TRANSACTIONS ON STORAGE》 *
王洋洋 等: "基于SSD-SMR混合存储的LSM树键值存储系统的性能优化", 《计算机科学》 *

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111831423A (en) * 2019-04-15 2020-10-27 阿里巴巴集团控股有限公司 Method and system for realizing Redis memory database on nonvolatile memory
CN110347336A (en) * 2019-06-10 2019-10-18 华中科技大学 A kind of key assignments storage system based on NVM with SSD mixing storage organization
CN110321367A (en) * 2019-06-28 2019-10-11 北京奇艺世纪科技有限公司 A kind of date storage method, data query method and relevant apparatus, electronic equipment
CN110321367B (en) * 2019-06-28 2021-12-17 北京奇艺世纪科技有限公司 Data storage method, data query method, related device and electronic equipment
US11868651B2 (en) 2019-08-13 2024-01-09 Huawei Technologies Co., Ltd. Key-value KV storage method and apparatus, and storage device
WO2021027340A1 (en) * 2019-08-13 2021-02-18 华为技术有限公司 Storage method and apparatus for key value (kv) and storage device
CN112394874A (en) * 2019-08-13 2021-02-23 华为技术有限公司 Key value KV storage method and device and storage equipment
CN111026329A (en) * 2019-11-18 2020-04-17 华中科技大学 Key value storage system based on host management tile record disk and data processing method
CN111026329B (en) * 2019-11-18 2021-04-20 华中科技大学 Key value storage system based on host management tile record disk and data processing method
CN112395212A (en) * 2020-11-05 2021-02-23 华中科技大学 Method and system for reducing garbage recovery and write amplification of key value separation storage system
CN113094372A (en) * 2021-04-16 2021-07-09 三星(中国)半导体有限公司 Data access method, data access control device and data access system
US11537582B2 (en) 2021-04-16 2022-12-27 Samsung Electronics Co., Ltd. Data access method, a data access control device, and a data access system
CN113900590B (en) * 2021-09-28 2023-01-31 重庆紫光华山智安科技有限公司 Shingled disk storage method, shingled disk storage device, shingled disk storage equipment and shingled disk storage medium
CN113900590A (en) * 2021-09-28 2022-01-07 重庆紫光华山智安科技有限公司 Shingled disk storage method, apparatus, device and medium
WO2024060944A1 (en) * 2022-09-22 2024-03-28 超聚变数字技术有限公司 Key value storage method and system
CN116860722A (en) * 2023-08-31 2023-10-10 中国科学院软件研究所 Database persistence organization optimization method
CN116860722B (en) * 2023-08-31 2023-11-14 中国科学院软件研究所 Database persistence organization optimization method

Similar Documents

Publication Publication Date Title
CN109521959A (en) One kind being based on SSD-SMR disk mixing key assignments memory system data method for organizing
US11741053B2 (en) Data management system, method, terminal and medium based on hybrid storage
CN110825748B (en) High-performance and easily-expandable key value storage method by utilizing differentiated indexing mechanism
CN107423422B (en) Spatial data distributed storage and search method and system based on grid
CN104346357B (en) The file access method and system of a kind of built-in terminal
CN103019953B (en) Construction system and construction method for metadata
CN105912687B (en) Magnanimity distributed data base storage unit
US8229916B2 (en) Method for massively parallel multi-core text indexing
CN103106286B (en) Method and device for managing metadata
CN110309233A (en) Method, apparatus, server and the storage medium of data storage
US20140244606A1 (en) Method, apparatus and system for storing, reading the directory index
CN104899297A (en) Hybrid index structure with storage perception
CN113821171B (en) Key value storage method based on hash table and LSM tree
CN109558084A (en) A kind of data processing method and relevant device
WO2018205151A1 (en) Data updating method and storage device
CN104054071A (en) Method for accessing storage device and storage device
CN110134335A (en) A kind of RDF data management method, device and storage medium based on key-value pair
Li et al. HiLSM: an LSM-based key-value store for hybrid NVM-SSD storage systems
CN104216988A (en) SSD (Solid State Disk) and HDD(Hard Driver Disk)hybrid storage method for distributed big data
Amur et al. Design of a write-optimized data store
CN115794669A (en) Method, device and related equipment for expanding memory
CN103198119A (en) Method for fast searching all chained files having same repeating data deleting identification
CN103942301A (en) Distributed file system oriented to access and application of multiple data types
Weintraub et al. Needle in a haystack queries in cloud data lakes.
CN110008030A (en) A kind of method of metadata access, system and equipment

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20190326