WO2024021488A1 - Procédé et appareil de stockage de métadonnées basés sur une base de données de valeurs clés distribuées - Google Patents

Procédé et appareil de stockage de métadonnées basés sur une base de données de valeurs clés distribuées Download PDF

Info

Publication number
WO2024021488A1
WO2024021488A1 PCT/CN2022/141807 CN2022141807W WO2024021488A1 WO 2024021488 A1 WO2024021488 A1 WO 2024021488A1 CN 2022141807 W CN2022141807 W CN 2022141807W WO 2024021488 A1 WO2024021488 A1 WO 2024021488A1
Authority
WO
WIPO (PCT)
Prior art keywords
metadata
storage
preset
value
hash
Prior art date
Application number
PCT/CN2022/141807
Other languages
English (en)
Chinese (zh)
Inventor
胡爱存
侯飞
梁成武
陈玉鹏
张翼
Original Assignee
天翼云科技有限公司
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 天翼云科技有限公司 filed Critical 天翼云科技有限公司
Publication of WO2024021488A1 publication Critical patent/WO2024021488A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2219—Large Object storage; Management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2453—Query optimisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2457—Query processing with adaptation to user needs
    • G06F16/24573—Query processing with adaptation to user needs using data annotations, e.g. user-defined metadata

Definitions

  • the invention relates to the field of data processing, and in particular to a metadata storage method and device based on a distributed key-value database.
  • the distributed object storage system maintains an index table for each bucket, which stores the mapping relationship between the bucket and the metadata of all objects in the bucket.
  • the existing technology adopts a dynamic sharding mechanism by creating multiple index tables.
  • the object metadata in the bucket will be rebalanced. If the bucket is stored With a large number of objects, the data rebalancing operation during sharding will be very time-consuming, blocking front-end writing and giving users a very unfriendly experience.
  • embodiments of the present invention provide a metadata storage method and device based on a distributed key-value database to solve the business congestion caused by the limited single-bucket object storage scale and the sharding mechanism in the distributed object storage system. question.
  • an embodiment of the present invention provides a metadata storage method based on a distributed key-value database.
  • the method is applied to a server, and the server is installed with a distributed object storage system.
  • the method includes:
  • the metadata is saved into the corresponding hash table and ordered list; each bucket in the distributed storage system passes through at least one hash
  • the hash table and at least one ordered list store metadata, the hash table is used to store metadata, and the ordered list is used to store retrieval information of metadata.
  • the preset types include first, second, third and fourth types, the metadata of the first type is basic metadata, and the metadata of the second type
  • the data is object attribute metadata
  • the third type of metadata is index metadata
  • the fourth type of metadata is index sequence metadata
  • the step of saving the metadata into the corresponding hash table and ordered list based on the determined preset type and key-value pair of the metadata specifically includes:
  • the metadata is stored in a container group corresponding to the preset type; each preset type of metadata corresponds to one of the container groups, and each of the container groups corresponds to at least One hash slot, and the number of hash slots corresponding to the container group is equal to each other;
  • Assign a corresponding score value to the metadata determine the ordered list corresponding to the metadata based on the assigned score value, and store the metadata in the corresponding ordered list;
  • the metadata of each item in the ordered list is sorted in order according to the score value.
  • the number of hash tables is determined based on a preset number and the total number of hash slots, and the number of hash tables exceeds The preset number is a factor of the total number.
  • the method further includes the following steps:
  • the metadata retrieval request includes retrieval information, and the retrieval information includes the index order and number of index elements of each of the ordered lists;
  • the metadata is stored in a preset map table, and based on the preset map table, the metadata stored in the preset map table is sequentially sorted, and all steps required to complete the storage and sorting of the metadata are The above preset map table is returned to the client.
  • the method further includes the following steps:
  • the metadata retrieval request includes retrieval information, and the retrieval information includes reference metadata and the number of index elements;
  • the metadata is stored in a preset map table, and based on the preset map table, the metadata stored in the preset map table is sequentially sorted, and all steps required to complete the storage and sorting of the metadata are The above preset map table is returned to the client.
  • the metadata is stored in a preset map table, and based on the preset map table, the The metadata stored in the preset map table is sequentially sorted, and the preset map table that completes the storage and sorting of the metadata is returned to the client, which also includes:
  • an embodiment of the present invention also provides a metadata storage device based on a distributed key-value database, the device is applied to a server, and the server is installed with a distributed object storage system, and the Devices include:
  • the first determination module is used to determine the metadata of the objects stored in the bucket, and determine the preset type and key-value pair of the metadata;
  • a data storage module configured to save the metadata into the corresponding hash table and ordered list based on the determined preset type and key-value pair of the metadata; each in the distributed storage system
  • Each bucket stores metadata through at least one hash table and at least one ordered list, the hash table is used to store metadata, and the ordered list is used to store retrieval information of metadata.
  • an embodiment of the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the program, the above is implemented.
  • embodiments of the present invention also provide a non-transitory computer-readable storage medium on which a computer program is stored.
  • the distributed key-based storage medium is implemented as described above. Steps for the metadata storage method for value databases.
  • embodiments of the present invention further provide a computer program product, including a computer program that, when executed by a processor, implements any one of the above-mentioned metadata storage methods based on a distributed key-value database. A step of.
  • the metadata storage method and device based on the distributed key-value database provided by the present invention stores the metadata of the object in the form of key-value pairs in the distributed key-value cluster, and adopts the method of sub-tables to use multiple Hash tables and multiple ordered lists are used to carry the metadata of objects in a bucket.
  • the storage of metadata through hash tables reduces the complexity of I/O operations and increases the storage scale of a single bucket while ensuring efficiency.
  • the storage of metadata in ordered lists provides an interface for adding, deleting, modifying, and querying object metadata. Without increasing storage costs, it achieves high efficiency and low space utilization suitable for retrieval of metadata across multiple ordered lists. .
  • Figure 1 shows a schematic flow chart of a metadata storage method based on a distributed key-value database provided by the present invention
  • Figure 2 shows a schematic flow chart of step S20 in the metadata storage method based on a distributed key-value database provided by the present invention
  • Figure 3 shows a schematic structural diagram of a metadata storage device based on a distributed key-value database provided by the present invention
  • Figure 4 shows a schematic structural diagram of the electronic device provided by the present invention.
  • Object metadata in a distributed object storage system is divided into two parts for storage: one part is the index metadata of the object, which is called omap, and omap refers to object.
  • Map is an object used to save key-value pair map data.
  • omap objects play a very important role.
  • the performance of omap directly affects the cluster.
  • omap is stored in an independent key-value (key-value) storage system outside the local file system, which is levelDB when using filestore, and rocksDB when using bluestore; the other part is the extended attributes of the object, It is called xattr and is usually used to save the version information of the object.
  • xattr is stored in the RADOS (Reliable Autonomic Distributed Object Store) object of the bucket.
  • the RADOS object is stored in the local file system. Its size is affected by the file system. Limitation, resulting in a limit on the number of objects it can carry. This results in the need to read related data in two I/O paths when reading the metadata of an object, corresponding to the local file system and the key-value storage system respectively.
  • the distributed object storage system maintains an index table for each bucket, which stores the mapping relationship between the bucket and the metadata of all objects in the bucket.
  • an index table for each bucket, which stores the mapping relationship between the bucket and the metadata of all objects in the bucket.
  • the object metadata in the bucket will be rebalanced, and the index data in the old RADOS object will be recalculated, organized and migrated to the new RADOS object. Then, if a large number of objects are stored in the bucket, the data rebalancing operation during sharding will be very time-consuming, blocking front-end writes, and giving users a very unfriendly experience.
  • the metadata storage method based on the distributed key-value database of the present invention is described below with reference to Figure 1.
  • This method is designed to solve the problems caused by the limited single-bucket object storage scale and the fragmentation mechanism in native distributed object storage.
  • this method is applied to the server side.
  • the server side is installed with a distributed object storage system. The method includes:
  • S10 Determine the metadata of the objects stored in the bucket, and determine the preset type (type) and key-value pairs of the metadata. Specifically, determine the metadata stored in each bucket on the server, as well as the preset type of metadata and key-value pairs.
  • the preset types include first, second, third and fourth types.
  • the first type of metadata is basic metadata (object metadata), basic metadata saves the basic information of the latest version of the object, including size, instance and last version
  • the second type of metadata is object attribute metadata (xattrs), which is the attribute information of the object itself
  • the third type of metadata Metadata is index metadata (omap), which stores bucket object index information, which is omap information
  • the fourth type of metadata is index sequence metadata (omap order), the index order element stores the sequence list of all omaps of the objects in the bucket.
  • each bucket in the distributed storage system stores metadata through at least one hash table and at least one ordered list.
  • the hash table is used to store metadata
  • the ordered list is used to store metadata.
  • a single-bucket multi-table metadata storage model is constructed based on the data structure of distributed key-value data.
  • the native distributed object storage system only includes object gateway and back-end data storage.
  • the present invention adds A proprietary distributed key-value module is used to store object metadata and realize separate storage of object data and metadata.
  • this application reorganizes the object's metadata, removes redundant data types, and reclassifies the metadata into four types of metadata. Since dozens of types of metadata in the native distributed object storage system are not simultaneously operated during object operations, the object metadata granularity can be reduced, and metadata read and write operations are more flexible and efficient.
  • this method will use at least one hash table and at least one ordered list for storage, and when storing metadata, it will also ensure that it is inside the container group (container). It is evenly distributed. How to achieve uniform distribution of metadata in the container group will be explained below.
  • the metadata of the object is stored in the distributed key-value cluster in the form of key-value pairs.
  • This method uses a table partitioning method and uses multiple hash tables to carry the metadata of the object in a bucket.
  • Each A hash table can store up to 4.2 billion key-value pairs.
  • Multiple hash tables can easily support the metadata of tens of billions of objects by uniformly storing the metadata of objects in a distributed key-value hash table.
  • the time complexity of its read and write operations is 0 or 1, which reduces the complexity of I/O operations and increases the scale of single-bucket storage while ensuring efficiency. There is no need to load RADOS object data from the local file system.
  • the metadata storage method based on a distributed key-value database stores the object's metadata in the form of key-value pairs in a distributed key-value cluster, and uses multiple tables in a split-table manner.
  • Hash tables and multiple ordered lists are used to carry the metadata of objects in a bucket.
  • the storage of metadata through hash tables reduces the complexity of I/O operations and increases the storage scale of a single bucket while ensuring efficiency.
  • Sequence lists store metadata and provide an interface for adding, deleting, modifying, and querying object metadata. Without increasing storage costs, it achieves high efficiency and low space utilization suitable for metadata retrieval across multiple ordered lists.
  • Step S20 specifically includes:
  • each preset type of metadata corresponds to a container group, and each container group corresponds to at least one hash slot (hash slot). slot), and the number of hash slots corresponding to the container group is equal to each other, that is, the number of hash slots corresponding to each container group remains consistent.
  • each hash table corresponds to at least one hash slot.
  • each hash table needs to be allocated a slot partition in advance.
  • the total number of slots in the entire container group is 16384.
  • the hash slot corresponding to the metadata can be determined in the following way:
  • the HASH_SLOT algorithm can be used to map the metadata of the bucket object to the corresponding hash table, so that the metadata can be evenly distributed in the corresponding container group.
  • S24 Assign a corresponding score value (score) to the metadata. Based on the assigned score value, determine the ordered list corresponding to the metadata, and store the metadata in the corresponding ordered list. In this method, the ordered list Each item of metadata in the list is sorted sequentially according to the score value. For example, based on the score value assigned/assigned by the metadata, the metadata in a single ordered list is sorted in an orderly manner according to the score value from low to high.
  • a score value is assigned to the key of the metadata.
  • the method also includes the following steps, aiming to achieve high efficiency and low space utilization suitable for retrieval of metadata across multiple ordered lists without increasing storage costs:
  • the metadata retrieval request contains retrieval information, and the retrieval information includes the index order and number of index elements of each ordered list, etc.
  • the index order and number of index elements of different ordered lists are consistent.
  • the metadata retrieval request is to retrieve the top 10 elements in each ordered list, that is, the index order is based on the highest order.
  • the front-end elements start to be retrieved in a continuous sequence, and the number of index elements is 10.
  • A20 Based on the retrieval information, retrieve the corresponding metadata from each ordered list. For example, take the consecutive n elements (metadata) from the frontmost, lastmost, i-th to i+n-1th elements from each ordered list.
  • A30 Store the metadata in the preset map table, sort the metadata stored in the preset map table based on the preset map table, and return the preset map table that has completed metadata storage and sorting to the client.
  • the preset map table can sort the stored metadata sequentially.
  • the preset map table is a list in which the retrieved metadata is sorted again. Based on the preset map table, users can perform high-efficiency, low space utilization metadata retrieval across multiple ordered lists.
  • the method further includes the following steps:
  • the metadata retrieval request also contains retrieval information.
  • the retrieval information includes reference metadata and the number of index elements.
  • the reference metadata Data is start key.
  • A50 Determine the storage location of the baseline metadata in each ordered list.
  • the baseline metadata is metadata that is definitely present in the bucket. It can be understood that the baseline metadata is and will only be stored in one of the ordered lists. Therefore, in step A50, the specific storage location of the benchmark metadata in an ordered list corresponding to the storage will be obtained, which is the storage sequence, that is, the storage element number/serial number in the ordered list; for those that do not store benchmark metadata In ordered lists, the storage location of the baseline metadata stored in these ordered lists will first be determined, that is, the storage order in the ordered lists. For example, based on the letters of the benchmark metadata and the letters of the metadata that have been stored in each other ordered list, the pre-storage position of the benchmark metadata in the ordered list where the benchmark metadata is not stored is determined.
  • the storage location includes the real storage location and the pre-storage location, and retrieve the corresponding metadata from each ordered list. For example, starting from the pre-storage location, fetch consecutive n elements (metadata) from an ordered list of unstored baseline metadata.
  • A70 Store the metadata in the preset map table, sort the metadata stored in the preset map table based on the preset map table, and return the preset map table that has completed metadata storage and sorting to the client.
  • the preset map table can sort the stored metadata sequentially.
  • the preset map table is a list in which the retrieved metadata is sorted again. Based on the preset map table, users can perform high-efficiency, low space utilization metadata retrieval across multiple ordered lists.
  • the default map table has a storage limit, which can be set by the user.
  • the storage limit is N elements.
  • the storage limit of the default map table is not reached and metadata needs to be stored, the metadata will be processed directly. Storage.
  • steps A30 and A70 will also include:
  • A80 Determine that the preset map expression reaches the storage upper limit and there is unstored metadata.
  • the storage upper limit N is less than the total number of metadata taken out S.
  • the sorting value can be understood as the storage location/storage order.
  • A90 Determine that the map table sorting value corresponding to the last/most metadata exceeds the map table sorting value corresponding to the unstored metadata, delete the last metadata, and store the unstored metadata to the preset Set up a map table. Use the above method to determine whether each unstored metadata needs to be stored in the default map table. It should be noted that when the last element is deleted and the new metadata is stored in the default map table, the default All stored metadata in the map table are reordered according to the map table sorting value, ensuring that the map table sorting value corresponding to the metadata at the end of the default map table is the maximum value among the map table sorting values of all elements.
  • the metadata storage device based on the distributed key database provided by the present invention is described below.
  • the metadata storage device based on the distributed key database described below can be used with the metadata storage method based on the distributed key database described above. mutual reference.
  • the metadata storage device based on the distributed key-value database of the present invention is described below with reference to Figure 3.
  • This device is designed to solve the problems of limited single-bucket object storage scale and business blocking caused by the sharding mechanism in native distributed object storage.
  • the device is applied to the server, and the server is installed with a distributed object storage system.
  • the device includes:
  • the first determination module 10 is used to determine the metadata of the objects stored in the bucket, and determine the preset type (type) and key-value pairs of the metadata. Specifically, determine the metadata stored in each bucket on the server, as well as the preset type of metadata and key-value pairs.
  • the preset types include first, second, third and fourth types.
  • the first type of metadata is basic metadata (object metadata), basic metadata saves the basic information of the latest version of the object, including size, instance and last version
  • the second type of metadata is object attribute metadata (xattrs), which is the attribute information of the object itself
  • the third type of metadata Metadata is index metadata (omap), which stores bucket object index information, which is omap information
  • the fourth type of metadata is index sequence metadata (omap order), the index order element stores the sequence list of all omaps of the objects in the bucket.
  • the data storage module 20 is used to save the metadata to the corresponding hash table (hash table) based on the determined preset type and key-value pair of the metadata. table) and ordered list (zset).
  • each bucket in the distributed storage system stores metadata through at least one hash table and at least one ordered list.
  • the hash table is used to store metadata
  • the ordered list is used to store metadata. Stores retrieval information for metadata.
  • a single-bucket multi-table metadata storage model is constructed based on the data structure of distributed key-value data.
  • the native distributed object storage system only includes object gateway and back-end data storage.
  • the present invention adds A proprietary distributed key-value module is used to store object metadata and realize separate storage of object data and metadata.
  • this application reorganizes the object's metadata, removes redundant data types, and reclassifies the metadata into four types of metadata. Since dozens of types of metadata in the native distributed object storage system are not simultaneously operated during object operations, the object metadata granularity can be reduced, and metadata read and write operations are more flexible and efficient.
  • the device will use at least one hash table and at least one ordered list to store, and when storing metadata, it will also ensure that it is within the container group (container). It is evenly distributed. How to achieve uniform distribution of metadata in the container group will be explained below.
  • the metadata of the object is stored in the distributed key-value cluster in the form of key-value pairs.
  • the device adopts a sub-table method and uses multiple hash tables to carry the metadata of the object in a bucket.
  • Each A hash table can store up to 4.2 billion key-value pairs.
  • Multiple hash tables can easily support the metadata of tens of billions of objects by uniformly storing the metadata of objects in a distributed key-value hash table.
  • the time complexity of its read and write operations is 0 or 1, which reduces the complexity of I/O operations and increases the scale of single-bucket storage while ensuring efficiency. There is no need to load RADOS object data from the local file system.
  • the metadata storage device based on a distributed key-value database provided by this application stores the object's metadata in the form of key-value pairs in a distributed key-value cluster, and uses multiple tables in a split-table manner.
  • Hash tables and multiple ordered lists are used to carry the metadata of objects in a bucket.
  • the storage of metadata through hash tables reduces the complexity of I/O operations and increases the storage scale of a single bucket while ensuring efficiency.
  • Sequence lists store metadata and provide an interface for adding, deleting, modifying, and querying object metadata. Without increasing storage costs, it achieves high efficiency and low space utilization suitable for metadata retrieval across multiple ordered lists.
  • Figure 4 illustrates a schematic diagram of the physical structure of an electronic device.
  • the electronic device may include: a processor (processor) 810, a communications interface (Communications Interface) 820, a memory (memory) 830 and a communication bus 840.
  • the processor 810, the communication interface 820, and the memory 830 complete communication with each other through the communication bus 840.
  • the processor 810 can call logical instructions in the memory 830 to execute a metadata storage method based on a distributed key-value database, which method includes:
  • the metadata is saved into the corresponding hash table and ordered list; each bucket in the distributed storage system passes through at least one hash
  • the hash table and at least one ordered list store metadata, the hash table is used to store metadata, and the ordered list is used to store retrieval information of metadata.
  • the above-mentioned logical instructions in the memory 830 can be implemented in the form of software functional units and can be stored in a computer-readable storage medium when sold or used as an independent product.
  • the technical solution of the present invention essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product.
  • the computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Various media that can store program code, such as Memory), magnetic disks or optical disks.
  • the present invention also provides a computer program product.
  • the computer program product includes a computer program.
  • the computer program can be stored on a non-transitory computer-readable storage medium.
  • the computer program can Execute the metadata storage method based on the distributed key-value database provided by each of the above methods, which method includes:
  • the metadata is saved into the corresponding hash table and ordered list; each bucket in the distributed storage system passes through at least one hash
  • the hash table and at least one ordered list store metadata, the hash table is used to store metadata, and the ordered list is used to store retrieval information of metadata.
  • the present invention also provides a non-transitory computer-readable storage medium on which a computer program is stored.
  • the computer program is implemented when executed by the processor to execute the elements based on the distributed key-value database provided by the above methods.
  • Data storage method which includes:
  • the metadata is saved into the corresponding hash table and ordered list; each bucket in the distributed storage system passes through at least one hash
  • the hash table and at least one ordered list store metadata, the hash table is used to store metadata, and the ordered list is used to store retrieval information of metadata.
  • the device embodiments described above are only illustrative.
  • the units described as separate components may or may not be physically separated.
  • the components shown as units may or may not be physical units, that is, they may be located in One location, or it can be distributed across multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. Persons of ordinary skill in the art can understand and implement the method without any creative effort.
  • each embodiment can be implemented by software plus a necessary general hardware platform, and of course, it can also be implemented by hardware.
  • the computer software product can be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disc, optical disk, etc., including a number of instructions to cause a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in various embodiments or certain parts of the embodiments.

Abstract

La présente invention se rapporte au domaine du traitement de données. L'invention divulgue un procédé et un appareil de stockage de métadonnées basés sur une base de données de valeurs clés distribuées. Le procédé consiste : à déterminer des métadonnées d'objets stockés dans des compartiments et à déterminer des types prédéfinis et des paires clé-valeur des métadonnées ; et à stocker les métadonnées dans des tables de hachage et des listes ordonnées correspondantes sur la base des types prédéfinis déterminés et des paires clé-valeur déterminées des métadonnées, chaque compartiment dans un système de stockage distribué stockant des métadonnées au moyen d'au moins une table de hachage et d'au moins une liste ordonnée, la table de hachage étant utilisée pour stocker des métadonnées, et la liste ordonnée étant utilisée pour stocker des informations de récupération de métadonnées. La présente invention réduit la complexité d'opérations d'entrée/de sortie et augmente l'échelle de stockage d'un seul compartiment tout en garantissant l'efficacité, ce qui permet d'obtenir une récupération efficace et à faible utilisation de l'espace appropriée pour des métadonnées à travers de multiples listes ordonnées.
PCT/CN2022/141807 2022-07-29 2022-12-26 Procédé et appareil de stockage de métadonnées basés sur une base de données de valeurs clés distribuées WO2024021488A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210906067.6A CN115454994A (zh) 2022-07-29 2022-07-29 一种基于分布式键值数据库的元数据存储方法及装置
CN202210906067.6 2022-07-29

Publications (1)

Publication Number Publication Date
WO2024021488A1 true WO2024021488A1 (fr) 2024-02-01

Family

ID=84297062

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/141807 WO2024021488A1 (fr) 2022-07-29 2022-12-26 Procédé et appareil de stockage de métadonnées basés sur une base de données de valeurs clés distribuées

Country Status (2)

Country Link
CN (1) CN115454994A (fr)
WO (1) WO2024021488A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115454994A (zh) * 2022-07-29 2022-12-09 天翼云科技有限公司 一种基于分布式键值数据库的元数据存储方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150154422A1 (en) * 2013-11-29 2015-06-04 Thomson Licensing Method for determining a statistic value on data based on encrypted data
CN113821171A (zh) * 2021-09-01 2021-12-21 浪潮云信息技术股份公司 一种基于哈希表与lsm树的键值存储方法
CN113886331A (zh) * 2021-12-03 2022-01-04 苏州浪潮智能科技有限公司 分布式对象存储方法、装置、电子设备及可读存储介质
CN115454994A (zh) * 2022-07-29 2022-12-09 天翼云科技有限公司 一种基于分布式键值数据库的元数据存储方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150154422A1 (en) * 2013-11-29 2015-06-04 Thomson Licensing Method for determining a statistic value on data based on encrypted data
CN113821171A (zh) * 2021-09-01 2021-12-21 浪潮云信息技术股份公司 一种基于哈希表与lsm树的键值存储方法
CN113886331A (zh) * 2021-12-03 2022-01-04 苏州浪潮智能科技有限公司 分布式对象存储方法、装置、电子设备及可读存储介质
CN115454994A (zh) * 2022-07-29 2022-12-09 天翼云科技有限公司 一种基于分布式键值数据库的元数据存储方法及装置

Also Published As

Publication number Publication date
CN115454994A (zh) 2022-12-09

Similar Documents

Publication Publication Date Title
JP7053682B2 (ja) データベーステナントマイグレーションのシステム及び方法
US11693830B2 (en) Metadata management method, system and medium
US9684702B2 (en) Database redistribution utilizing virtual partitions
US10248676B2 (en) Efficient B-Tree data serialization
US20160350302A1 (en) Dynamically splitting a range of a node in a distributed hash table
US8924357B2 (en) Storage performance optimization
US20160283538A1 (en) Fast multi-tier indexing supporting dynamic update
US11580162B2 (en) Key value append
WO2009009556A1 (fr) Procédé et système pour exécuter une opération de balayage sur un tableau d'une base de données orienté en colonnes
WO2019226365A1 (fr) Structures de stockage multi-niveaux évolutives et techniques permettant d'accéder à des entrées dans celles-ci
US20100082546A1 (en) Storage Tiers for Database Server System
JP6707797B2 (ja) データベース管理システム及びデータベース管理方法
CN113535670A (zh) 一种虚拟化资源镜像存储系统及其实现方法
WO2024021488A1 (fr) Procédé et appareil de stockage de métadonnées basés sur une base de données de valeurs clés distribuées
US10127238B1 (en) Methods and apparatus for filtering dynamically loadable namespaces (DLNs)
EP4302200A1 (fr) Mesure et amélioration de qualité d'index dans un système de données distribué
US20150234858A1 (en) Providing record-level alternate-index upgrade locking
WO2022267508A1 (fr) Procédé et appareil de compression de métadonnées
WO2022121274A1 (fr) Procédé et appareil de gestion de métadonnées dans un système d'enregistrement, et système d'enregistrement
JP2012243039A (ja) スナップショットデータ保管方法
US10997126B1 (en) Methods and apparatus for reorganizing dynamically loadable namespaces (DLNs)
WO2023237120A1 (fr) Système et appareil de traitement de données
Herodotou Towards a distributed multi-tier file system for cluster computing

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22952917

Country of ref document: EP

Kind code of ref document: A1