中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

10 records (took 0.017 seconds)

    IN-MEMORY HASH ENTRIES AND HASHES USED TO IMPROVE KEY SEARCH OPERATIONS FOR KEYS OF A KEY VALUE STORE
    1.
    发明公开
    IN-MEMORY HASH ENTRIES AND HASHES USED TO IMPROVE KEY SEARCH OPERATIONS FOR KEYS OF A KEY VALUE STORE 审中-公开

    公开(公告)号：US20230350810A1

    公开(公告)日：2023-11-02

    申请号：US17732098

    申请日：2022-04-28

    Applicant: NetApp Inc.

    Inventor： Anil Paul Thoppil ,  Wei Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

    IPC: G06F12/1018

    CPC classification number: G06F12/1018

    Abstract: Techniques are provided for implementing a hash building process and an append hash building process. The hash building process builds in-memory hash entries for bins of keys stored within sorted logs of a log structured merge tree used to store keys of a key-value store. The in-memory hash entries can be used to identify the starting locations of bins of keys within the log structured merge tree so that a key within a bin can be searched for from the starting location of the bin as opposed to having to search the entire log structured merge tree. The append hash building process builds two hashes that can be used to more efficiently locate keys and/or ranges of keys within an unsorted append log that would otherwise require a time consuming binary search of the entire append log.

    Defragmentation for log structured merge tree to improve read and write amplification
    2.
    发明授权
    Defragmentation for log structured merge tree to improve read and write amplification 有权

    公开(公告)号：US11971859B2

    公开(公告)日：2024-04-30

    申请号：US17732046

    申请日：2022-04-28

    Applicant: NetApp Inc.

    Inventor： Anil Paul Thoppil ,  Wei Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

    IPC: G06F16/17 ,  G06F16/174 ,  G06F16/182

    CPC classification number: G06F16/1748 ,  G06F16/182

    Abstract: Techniques are provided for implementing a defragmentation process during a merge operation performed by a re-compaction process upon a log structured merge tree. The log structured merge tree is used to store keys of key-value pairs within a key-value store. As the log structured merge tree fills with keys over time, the re-compaction process is performed to merge keys down to lower levels of the log structured merge tree to re-compact the keys. Re-compaction can result in fragmentation because there is a lack of spatial locality of where the re-compaction operations re-writes the keys within storage. Fragmentation increases read and write amplification when accessing the keys stored in different locations within the storage. Accordingly, the defragmentation process is performed during a last merge operation of the re-compaction process in order to store keys together within the storage, thus reducing read and write amplification when accessing the keys.

    In-memory hash entries and hashes used to improve key search operations for keys of a key value store
    3.
    发明授权
    In-memory hash entries and hashes used to improve key search operations for keys of a key value store 有权

    公开(公告)号：US12265473B2

    公开(公告)日：2025-04-01

    申请号：US17732098

    申请日：2022-04-28

    Applicant: NetApp Inc.

    Inventor： Anil Paul Thoppil ,  Wei Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

    IPC: G06F12/1018

    Abstract: Techniques are provided for implementing a hash building process and an append hash building process. The hash building process builds in-memory hash entries for bins of keys stored within sorted logs of a log structured merge tree used to store keys of a key-value store. The in-memory hash entries can be used to identify the starting locations of bins of keys within the log structured merge tree so that a key within a bin can be searched for from the starting location of the bin as opposed to having to search the entire log structured merge tree. The append hash building process builds two hashes that can be used to more efficiently locate keys and/or ranges of keys within an unsorted append log that would otherwise require a time consuming binary search of the entire append log.

    Prefetching keys for garbage collection
    4.
    发明授权
    Prefetching keys for garbage collection 有权

    公开(公告)号：US12204800B2

    公开(公告)日：2025-01-21

    申请号：US17732065

    申请日：2022-04-28

    Applicant: NetApp Inc.

    Inventor： Anil Paul Thoppil ,  Wei Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

    IPC: G06F3/06 ,  G06F12/02

    Abstract: Techniques are provided for implementing a garbage collection process and a prediction read ahead mechanism to prefetch keys into memory to improve the efficiency and speed of the garbage collection process. A log structured merge tree is used to store keys of key-value pairs within a key-value store. If a key is no longer referenced by any worker nodes of a distributed storage architecture, then the key can be freed to store other data. Accordingly, garbage collection is performed to identify and free unused keys. The speed and efficiency of garbage collection is improved by dynamically adjusting the amount and rate at which keys are prefetched from disk and cached into faster memory for processing by the garbage collection process.

    DEFRAGMENTATION FOR LOG STRUCTURED MERGE TREE TO IMPROVE READ AND WRITE AMPLIFICATION
    5.
    发明公开
    DEFRAGMENTATION FOR LOG STRUCTURED MERGE TREE TO IMPROVE READ AND WRITE AMPLIFICATION 审中-公开

    公开(公告)号：US20240281411A1

    公开(公告)日：2024-08-22

    申请号：US18648989

    申请日：2024-04-29

    Applicant: NetApp, Inc.

    Inventor： Anil Paul Thoppil ,  Wei Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

    IPC: G06F16/174 ,  G06F16/182

    CPC classification number: G06F16/1748 ,  G06F16/182

    Abstract: Techniques are provided for implementing a defragmentation process during a merge operation performed by a re-compaction process upon a log structured merge tree. The log structured merge tree is used to store keys of key-value pairs within a key-value store. As the log structured merge tree fills with keys over time, the re-compaction process is performed to merge keys down to lower levels of the log structured merge tree to re-compact the keys. Re-compaction can result in fragmentation because there is a lack of spatial locality of where the re-compaction operations re-writes the keys within storage. Fragmentation increases read and write amplification when accessing the keys stored in different locations within the storage. Accordingly, the defragmentation process is performed during a last merge operation of the re-compaction process in order to store keys together within the storage, thus reducing read and write amplification when accessing the keys.

    DEFRAGMENTATION FOR LOG STRUCTURED MERGE TREE TO IMPROVE READ AND WRITE AMPLIFICATION
    7.
    发明公开
    DEFRAGMENTATION FOR LOG STRUCTURED MERGE TREE TO IMPROVE READ AND WRITE AMPLIFICATION 审中-公开

    公开(公告)号：US20230350850A1

    公开(公告)日：2023-11-02

    申请号：US17732046

    申请日：2022-04-28

    Applicant: NetApp Inc.

    Inventor： Anil Paul Thoppil ,  Wei Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

    IPC: G06F3/06

    CPC classification number: G06F3/0605 ,  G06F3/0685 ,  G06F3/0649

    Abstract: Techniques are provided for implementing a defragmentation process during a merge operation performed by a re-compaction process upon a log structured merge tree. The log structured merge tree is used to store keys of key-value pairs within a key-value store. As the log structured merge tree fills with keys over time, the re-compaction process is performed to merge keys down to lower levels of the log structured merge tree to re-compact the keys. Re-compaction can result in fragmentation because there is a lack of spatial locality of where the re-compaction operations re-writes the keys within storage. Fragmentation increases read and write amplification when accessing the keys stored in different locations within the storage. Accordingly, the defragmentation process is performed during a last merge operation of the re-compaction process in order to store keys together within the storage, thus reducing read and write amplification when accessing the keys.

    PREFETCHING KEYS FOR GARBAGE COLLECTION
    8.
    发明公开
    PREFETCHING KEYS FOR GARBAGE COLLECTION 审中-公开

    公开(公告)号：US20230350610A1

    公开(公告)日：2023-11-02

    申请号：US17732065

    申请日：2022-04-28

    Applicant: NetApp Inc.

    Inventor： Anil Paul Thoppil ,  We Sun ,  Meera Odugoudar ,  Szu-Wen Kuo ,  Santhosh Selvaraj

    IPC: G06F3/06

    CPC classification number: G06F3/0652 ,  G06F3/0602 ,  G06F3/068

    Abstract: Techniques are provided for implementing a garbage collection process and a prediction read ahead mechanism to prefetch keys into memory to improve the efficiency and speed of the garbage collection process. A log structured merge tree is used to store keys of key-value pairs within a key-value store. If a key is no longer referenced by any worker nodes of a distributed storage architecture, then the key can be freed to store other data. Accordingly, garbage collection is performed to identify and free unused keys. The speed and efficiency of garbage collection is improved by dynamically adjusting the amount and rate at which keys are prefetched from disk and cached into faster memory for processing by the garbage collection process.

Patent Agency Ranking