REDUCING PROBABILISTIC FILTER QUERY LATENCY
    22.
    发明申请

    公开(公告)号:US20200159727A1

    公开(公告)日:2020-05-21

    申请号:US16749523

    申请日:2020-01-22

    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.

    Reducing probabilistic filter query latency

    公开(公告)号:US10579633B2

    公开(公告)日:2020-03-03

    申请号:US15691998

    申请日:2017-08-31

    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.

    MERGE TREE GARBAGE METRICS
    24.
    发明申请

    公开(公告)号:US20180225321A1

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

    申请号:US15428912

    申请日:2017-02-09

    Abstract: Systems and techniques for collecting and using merge tree garbage metrics are described herein. A kvset is created for a node in a KVS tree. Here, a set of kvset metrics for the kvset are computed as part of the node creation. The kvset is added to the node. The node is selected for a compaction operation based on a metric in the set of kvset metrics. The compaction operation is performed on the node.

    STREAM SELECTION FOR MULTI-STREAM STORAGE DEVICES

    公开(公告)号:US20180225316A1

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

    申请号:US15428976

    申请日:2017-02-09

    Abstract: Systems and techniques for stream selection from multi-stream storage devices. Notification of a KVS tree write request for a multi-stream storage device is received. The notification includes a KVS tree scope corresponding to data in the write request. A stream identifier (ID) is assigned to the write request based on the KVS tree scope and a stability value of the write request. The stream ID is returned to govern stream assignment to the write request, the stream assignment modifying a write operation of the multi-stream storage device.

    REDUCING PROBABILISTIC FILTER QUERY LATENCY

    公开(公告)号:US20220374148A1

    公开(公告)日:2022-11-24

    申请号:US17882862

    申请日:2022-08-08

    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.

    Heterogenous key-value sets in tree database

    公开(公告)号:US11238098B2

    公开(公告)日:2022-02-01

    申请号:US17017126

    申请日:2020-09-10

    Abstract: A KVS tree database and operations thereon are described herein. A KVS tree database is a multilevel tree that includes a base level and subsequent levels. The base level includes a heterogeneous kvset in a node, The heterogeneous kvset including entries for multiple KVS trees, such as a first entry for a first KVS tree and a second entry for a second KVS tree, The subsequent level includes a first node including a first homogeneous kvset for the first KVS tree and a second node including a second homogeneous kvset for the second KVS tree. Here, a homogeneous kvset includes nodes from only one KVS tree. The KVS tree database also includes a first determinative mapping of entries between the base level and the subsequent level and a second determinative mapping of entries between subsequent levels.

Patent Agency Ranking