LSM-Tree Level Capacity Tuning for Lookup-Update Tradeoffs

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing LSM-tree-based key-value stores face challenges in optimizing performance for point lookup, range lookup, and update operations concurrently due to their constrained configurations, which limit broader optimizations.

Innovation Solution

A method and system for configuring an LSM-tree structure that determines level capacity parameters based on an optimal cost tradeoff between range lookup and update operations, allowing for dynamic adjustment of level capacity ratios and run numbers to enhance performance across different workloads.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If fixed patterns are used to specify level capacity and number of sorted runs per-level, then device complexity is reduced, but optimization performance for point lookup, range lookup, and update operations is limited

Engineering Contradiction:
Improveoptimization performanceVSAvoidconfiguration complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies dynamics by transitioning from fixed, static configuration patterns to dynamic, adaptive configuration. The system automatically adjusts level capacity ratios and run numbers based on workload characteristics and performance metrics, allowing the LSM-tree structure to adapt its configuration in response to changing operational demands rather than being constrained by predetermined fixed patterns

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent implements parameter changes by systematically varying key configuration parameters including level capacity ratios, number of sorted runs per level, and compaction thresholds. These parameter adjustments are made based on performance analysis and workload characteristics, enabling the system to optimize for different operational scenarios such as read-heavy or write-heavy workloads

Inventive Principle:
Principle #35Parameter changes

2Adaptability or versatility

If level capacity ratios are fixed, then ease of operation is improved, but adaptability to different workloads deteriorates

Engineering Contradiction:
Improveworkload adaptabilityVSAvoidconfiguration simplicity
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The patent applies self-service by implementing automated configuration management that eliminates the need for manual tuning. The system monitors its own performance metrics, analyzes workload patterns, and automatically adjusts level capacity ratios and run numbers to optimize for current conditions, making the system self-adapting without requiring operator intervention

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent implements feedback mechanisms by continuously monitoring performance metrics such as read latency, write throughput, and storage utilization. This feedback information is used to drive automatic configuration adjustments, creating a closed-loop control system that adapts level capacity ratios and run numbers based on actual operational performance and workload characteristics

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS20250342142A1Method and system for configuring a log-structured merge (LSM)-tree structure for a key-value database
Publication Date: 2025.11.06 NANYANG TECH UNIV
  • US20250342142A1 patent drawing
  • US20250342142A1 patent drawing
  • US20250342142A1 patent drawing

AI summary

A method of configuring a Log-Structured Merge (LSM)-tree structure for a key-value database is provided. The LSM-tree structure having a series of levels. The method includes: obtaining a value for a level capacity parameter associated with a largest level of the series of levels of the LSM-tree structure; determining values for level capacity parameters associated with intermediate levels, respectively, of the series of levels based on an optimal cost tradeoff between a range lookup operation cost and an update operation cost associated with the LSM-tree structure based on the obtained value for the level capacity parameter associated with the largest level; and configuring the LSM-tree structure based on the determined values for the level capacity parameters associated with the intermediate levels. There is also provided a corresponding system for configuring an LSM-tree structure for a key-value database and a corresponding LSM-tree-based key-value database system.