Lemon Inc.

Beijing Volcano Engine Technology Co., Ltd.

Zhengyu Yang

Yi Wang

Jiaxin Ou

Jingwei Zhang

Ming Zhao

Hao Wang

Hui Zhang

Yang Liu

Sheng Qiu

Yizheng Jiao

Jianyang Hu

Qizhong Mao

Decoupled computing systems include layers of same-type computing resources, and include a dispatch layer to assign tasks from one layer to another, such as input and output (I/O) flows. The I/O flows can be assigned to particular computing resources of a layer based on a weighted moving average of performance data for the layer. When traffic is high, the assignment can include random assignment to some or all of the computing resources in the layer. The I/O flows can be split between read-intensive and write-intensive flows, with more read-intensive flows being assigned based on a pick ratio.

Systems and methods for input/output dispatch

Methods and systems for garbage collection and compaction for key-value engines in a data storage and communication system. The method includes determining disk capacity usage of the key-value engine and adjusting a garbage collection percentage threshold and a number of garbage collection threads based on whether the disk capacity usage of the key-value engine meets and/or exceeds predetermined disk capacity usage thresholds. The method may further include performing a periodic compaction process to consolidate one or more expired pages of one or more applications on a log-structured merge (LSM) tree by merging one or more layers into a last layer of the one or more expired pages to reduce data handling during an occurrence of the garbage collection.

Methods and systems for garbage collection and compaction for key-value engines

Systems and methods are provided for improved point querying of a database. The index values are separated from data and retained in cache memory to allow access without requiring a disk input/output (I/O) operation and thereby having less latency resulting from such disk I/O operations. The index values can be compressed using an algorithm such as Crit-Bit-Trie to allow storage of the index values in limited cache memory space. The index values can be selected for storage according to a least recently used approach when cache memory is insufficient to store all index values to maintain a hit rate for the cached portion and reduce the disk I/O operations.

Hash engine for conducting point queries

Growing community of inventors

Los Angeles, CA, United States of America

Zhengyu Yang