基本信息:
- 专利标题: MAINTAINING SHARDS IN KV STORE WITH DYNAMIC KEY RANGE
- 申请号:PCT/US2018/052545 申请日:2018-09-25
- 公开(公告)号:WO2019070449A1 公开(公告)日:2019-04-11
- 发明人: LYAKAS, Alex , KAUSHIK V., Shyam
- 申请人: ZADARA STORAGE, INC.
- 申请人地址: 6 Venture, Suite 140 Irvine, California 92618 US
- 专利权人: ZADARA STORAGE, INC.
- 当前专利权人: ZADARA STORAGE, INC.
- 当前专利权人地址: 6 Venture, Suite 140 Irvine, California 92618 US
- 代理机构: HSIA, David C.
- 优先权: US15/726,192 20171005
- 主分类号: G06F16/27
- IPC分类号: G06F16/27
摘要:
A method is provided for a key-value (KV) store database management system (DBMS) to provide a KV store to an application. The method includes providing a first low-level KV store and a top-level KV store. The first low-level KV store includes a root node and leaf nodes. The top-level KV store includes a leaf node pointing to the first low-level KV store. The leaf node in the top-level KV store includes a minimum key in the first low-level KV store and a pointer to the root node of the first low-level KV store. The method further includes determining a key-value insertion to the KV store would increase a number of keys in the first low-level KV store over an upper threshold and, in response to said determining, creating a second low-level KV store. The method additionally includes determining if a total number of keys in the first low-level store and the second low-level store is less than a lower threshold from key-value deletions and, when the total number of keys in the first low-level store and the second low-level store is less than the lower threshold, merging the first and the second low-level stores.
IPC结构图谱:
G | 物理 |
--G06 | 计算;推算;计数 |
----G06F | 电数字数据处理 |
------G06F16/00 | 信息检索;数据库结构;文件系统结构 |
--------G06F16/10 | .文件系统;文件服务器 |
----------G06F16/27 | ..在数据库间或在分布式数据库内的数据复制、分配或同步;其分布式数据系统结构 |