Merge tree garbage metrics

A technology of indicators and indicator sets, applied in special data processing applications, other database retrievals, other database indexes, etc., can solve problems such as inefficient storage and representation

Inactive Publication Date: 2019-09-27
MICRON TECH INC
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

While these structures are available in memory (e.g., in main or system state memory as opposed to storage), storage representations of these structures in persistent storage (e.g., on disk) can be inefficient

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Merge tree garbage metrics
  • Merge tree garbage metrics
  • Merge tree garbage metrics

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0401] Example 1 is a system comprising processing circuitry configured to: create a kvset for a node in a KVS tree, the creating comprising computing a set of kvset metrics for the kvset; adding the kvset to the node; selecting the node for a compaction operation based on metrics in the kvset set of metrics; and performing the compaction operation on the node.

[0402] In Example 2, the subject matter of Example 1, wherein the kvset indicator set includes the number of key-value pairs in the kvset.

[0403] In Example 3, the subject matter of any one or more of Examples 1-2, wherein the set of kvset indicators includes a number of tombstones in the kvset.

[0404] In Example 4, the subject matter according to any one or more of Examples 1 to 3, wherein the kvset index set includes all key entries for storing key-value pairs and tombstones in the kvset storage.

[0405] In Example 5, the subject matter of any one or more of Examples 1-4, wherein the set of kvset metrics incl...

example 39

[0439] Instance 39 is at least one machine-readable medium comprising instructions that, when executed by a machine, cause the machine to perform operations comprising: creating a kvset for a node in a KVS tree, the creating comprising computing a kvset of the kvset an index set; adding the kvset to the node; selecting the node for a compaction operation based on an index in the kvset index set; and performing the compaction operation on the node.

[0440] In Example 40, the subject matter of Example 39, wherein the set of kvset metrics includes a number of key-value pairs in the kvset.

[0441] In Example 41, the subject matter of any one or more of Examples 39-40, wherein the set of kvset metrics includes a number of tombstones in the kvset.

[0442] In Example 42, the subject matter of any one or more of Examples 39-41, wherein the set of kvset pointers includes a key for storing all key entries for key-value pairs and tombstones in the kvset storage.

[0443] In Example ...

example 77

[0477] Instance 77 is a machine-implemented method comprising: creating a kvset for a node in a KVS tree, the creating comprising computing a set of kvset metrics for the kvset; adding the kvset to the node; based on the kvset metrics selecting the node for a compaction operation based on aggregated metrics; and performing the compaction operation on the node.

[0478] In Example 78, the subject matter of Example 77, wherein the set of kvset metrics comprises a number of key-value pairs in the kvset.

[0479] In Example 79, the subject matter of any one or more of Examples 77-78, wherein the set of kvset metrics includes a number of tombstones in the kvset.

[0480] In Example 80, the subject matter according to any one or more of Examples 77-79, wherein the set of kvset pointers includes a key for storing all key entries for key-value pairs and tombstones in the kvset storage.

[0481] In Example 81, the subject matter according to any one or more of Examples 77-80, wherein...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

Systems and techniques for collecting and using merge tree garbage metrics are described herein. A kvset is created for a node in a KVS tree. Here, a set of kvset metrics for the kvset are computed as part of the node creation. The kvset is added to the node. The node is selected for a compaction operation based on a metric in the set of kvset metrics. The compaction operation is performed on the node.

Description

[0001] priority application [0002] This application claims the benefit of priority to US Application Serial No. 15 / 428,912, filed February 9, 2017, which is incorporated herein by reference in its entirety. technical field [0003] Embodiments described herein relate generally to a key-value data store, and more specifically to implementing merge tree garbage pointers and usage. Background technique [0004] A data structure is an organization of data that permits various ways to interact with the data stored therein. Data structures may be designed to permit, inter alia, efficient searching of data, such as in binary search trees, efficient storage of sparse data, such as with linked lists, or efficient storage of searchable data, such as with B-trees. storage. [0005] A key-value data structure accepts key-value pairs and is configured to respond to queries for the key. Key-value data structures may include structures such as dictionaries (eg, maps, hash maps, etc.)...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F16/901
CPCG06F16/9027
Inventor D·博尔斯J·M·格罗韦斯S·莫耶A·汤姆林森
Owner MICRON TECH INC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap