18079355. SYSTEM AND METHOD FOR LSM COMPACTION simplified abstract (SK hynix Inc.)
Contents
SYSTEM AND METHOD FOR LSM COMPACTION
Organization Name
Inventor(s)
Jongryool Kim of San Jose CA (US)
Hyung Jin Lim of San Jose CA (US)
Kevin Tang of San Jose CA (US)
SYSTEM AND METHOD FOR LSM COMPACTION - A simplified explanation of the abstract
This abstract first appeared for US patent application 18079355 titled 'SYSTEM AND METHOD FOR LSM COMPACTION
Simplified Explanation: The patent application describes a compaction scheme for a log structured merge (LSM) tree, where a storage device receives user data and generates metadata pieces for the LSM tree. When the storage limit is exceeded, a compaction process is triggered to eliminate overlapping metadata elements and delete corresponding user data.
- Key Features and Innovation:
- Storage device receives user data and generates metadata for LSM tree - Compaction process triggered when storage limit exceeded - Elimination of overlapping metadata elements during compaction - Garbage collection to delete corresponding user data
- Potential Applications:
- Data storage systems - Database management systems - File systems
- Problems Solved:
- Efficient management of data in LSM trees - Optimization of storage space - Reduction of redundant metadata elements
- Benefits:
- Improved performance of data storage systems - Enhanced data organization - Reduction of storage overhead
- Commercial Applications:
- Data storage solutions for enterprises - Database software development - Cloud storage services
- Prior Art:
- Researchers in the field of data storage and database management - Patents related to LSM trees and compaction processes
- Frequently Updated Research:
- Ongoing developments in data storage technologies - Advances in database management systems
Questions about Compaction Scheme for LSM Tree:
1. What are the key advantages of using a log structured merge tree in data storage systems? 2. How does the compaction process in LSM trees contribute to overall system performance and efficiency?
Original Abstract Submitted
In a compaction scheme for a log structured merge (LSM) tree, a storage device is configured to: receive a first user data piece from a host; generate a first meta data piece for a highest level of the LSM tree, corresponding to the first user data piece; when the highest level exceeds a set storage limit, trigger a compaction process on the first and second meta data pieces to generate compacted meta data pieces excluding overlapping meta data elements of the second meta data pieces overlapped with the first meta data piece. Through a garbage collection, victim user data elements corresponding to the overlapping meta data elements are deleted.
