中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

36 records (took 0.021 seconds)

    Reducing probabilistic filter query latency
    12.
    发明授权
    Reducing probabilistic filter query latency 有权

    公开(公告)号：US11409753B2

    公开(公告)日：2022-08-09

    申请号：US16749523

    申请日：2020-01-22

    Applicant: Micron Technology, Inc.

    Inventor： David Boles ,  John M. Groves ,  Steven Moyer ,  Alexander Tomlinson

    IPC: G06F16/2458 ,  G06F16/2455 ,  G06F16/901

    Abstract: Systems and techniques for reducing probabilistic filter query latency are described herein. A query for a probabilistic filter that is stored on a first media may be received from a caller. In response to receiving the query, cached segments of the probabilistic filter stored on a second media may be obtained. Here, the probabilistic filter provides a set membership determination that is conclusive in a determination that an element is not in a set. The query may be executed on the cached segments resulting in a partial query result. Retrieval of remaining data of the probabilistic filter from the first media to the second media may be initiated without intervention from the caller. Here, the remaining data corresponds to the query and data that is not in the cached segment. The partial query results may then be returned to the caller.

    KVS tree
    14.
    发明授权
    KVS tree 有权

    公开(公告)号：US10725988B2

    公开(公告)日：2020-07-28

    申请号：US15428877

    申请日：2017-02-09

    Applicant: Micron Technology, Inc.

    Inventor： David Boles ,  John M. Groves ,  Steven Moyer ,  Alexander Tomlinson

    IPC: G06F16/22 ,  G06F16/2455

    Abstract: A KVS tree and operations thereon are described herein. A key-value set (kvset) is received to store in a key-value data structure on at least one machine readable medium. The kvset includes a mapping of unique keys to values with the keys and the values of the kvset being immutable. The key-value data structure is organized as a tree with nodes of the tree including a temporally ordered sequence of kvsets. The kvset, once received, is written to a sequence of kvsets of a root-node of the tree.

    KVS TREE
    15.
    发明申请
    KVS TREE 审中-公开

    公开(公告)号：US20180225315A1

    公开(公告)日：2018-08-09

    申请号：US15428877

    申请日：2017-02-09

    Applicant: Micron Technology, Inc.

    Inventor： David Boles ,  John M. Groves ,  Steven Moyer ,  Alexander Tomlinson

    IPC: G06F17/30

    Abstract: A KVS tree and operations thereon are described herein. A key-value set (kvset) is received to store in a key-value data structure on at least one machine readable medium. The kvset includes a mapping of unique keys to values with the keys and the values of the kvset being immutable. The key-value data structure is organized as a tree with nodes of the tree including a temporally ordered sequence of kvsets. The kvset, once received, is written to a sequence of kvsets of a root-node of the tree.

    Replacing key-value pair sets with new key-value pair sets
    16.
    发明授权
    Replacing key-value pair sets with new key-value pair sets 有权

    公开(公告)号：US12260097B2

    公开(公告)日：2025-03-25

    申请号：US18520351

    申请日：2023-11-27

    Applicant: Micron Technology, Inc.

    Inventor： Gregory Alan Becker ,  Alexander Tomlinson

    IPC: G06F3/06

    Abstract: In some implementations, a memory device may determine, from a list of key-value pair sets, a key-value pair set. The memory device may identify, from the key-value pair set selected from the list of key-value pair sets, a first key that is included in at least one other key-value pair set from the list of key-value pair sets. The memory device may identify, from the key-value pair set selected from the list of key-value pair sets, a second key that is not included in at least one other key-value pair set from the list of key-value pair sets. The memory device may form a new key-value pair set that excludes the first key and includes the second key. The memory device may replace the key-value pair set selected from the list of key-value pair sets with the new key-value pair set.

    Key-value store tree with selective use of key portion
    18.
    发明授权
    Key-value store tree with selective use of key portion 有权

    公开(公告)号：US11048755B2

    公开(公告)日：2021-06-29

    申请号：US16220729

    申请日：2018-12-14

    Applicant: Micron Technology, Inc.

    Inventor： Alexander Tomlinson

    IPC: G06F16/901 ,  G06F16/903

    Abstract: Aspects of the present disclosure provide various embodiments for selective use of a portion of a key, such as a prefix of the key (also referred to as a key prefix of a key), with respect to a key-value store (KVS) tree data structure, such as when storing a key-value pair (associated with the key) within the KVS tree data structure or navigating through the KVS tree data structure. For some embodiments, when navigating a KVS tree based on a key, a first set of levels (e.g., a first series of levels) of the KVS tree is navigated by a first portion (e.g., a prefix) of the key, and a second set of levels (e.g., a second series of levels) of the KVS tree is navigated by a second portion (e.g., an entire portion) of the key.

Patent Agency Ranking