CACHE FOR EFFICIENT RECORD LOOKUPS IN AN LSM DATA STRUCTURE

    公开(公告)号:US20220188317A1

    公开(公告)日:2022-06-16

    申请号:US17653820

    申请日:2022-03-07

    Abstract: Techniques are disclosed relating to maintaining a cache usable to locate data stored in a data structure. A computer system, in various embodiments, maintains a data structure having a plurality of levels that store files for a database. The files may include one or more records that each have a key and corresponding data. The computer system may also maintain a cache for the database whose entries store, for a key, an indication of a location of a corresponding record in a file of the data structure. In some embodiments, the computer system receives a request to access a particular record stored in the data structure where the request specifies a key usable to locate the particular record. The computer system may retrieve, from the cache via the key, a particular indication of a location of the particular record and may use the particular indication to access the particular record.

    REDUCING REQUESTS USING PROBABILISTIC DATA STRUCTURES

    公开(公告)号:US20210240674A1

    公开(公告)日:2021-08-05

    申请号:US16777872

    申请日:2020-01-30

    Abstract: Techniques are disclosed relating to providing and using probabilistic data structures to at least reduce requests between database nodes. In various embodiments, a first database node processes a database transaction that involves writing a set of database records to an in-memory cache of the first database node. As part of processing the database transaction, the first database node may insert, in a set of probabilistic data structures, a set of database keys that correspond to the set of database records. The first database node may send, to a second database node, the set of probabilistic data structures to enable the second database node to determine whether to request, from the first database node, a database record associated with a database key.

    Systems and methods of managing manifest refresh in a database

    公开(公告)号:US11061889B2

    公开(公告)日:2021-07-13

    申请号:US16139166

    申请日:2018-09-24

    Abstract: Systems and methods are provided for receiving, at a database system having a memory and at least one persistent storage device to store records, a query for a least one record, where the query uses a first version of a manifest, and where each version of the records that are stored in the at least one persistent storage device are represented by metadata that is part of the first version of the manifest. A first operation may be performed based on a scan operation. The database system may determine whether a purge of the memory has occurred after the first operation. When it is determined that the memory purge has occurred, the scan operation may be restarted from a last position of the scan operation prior to the memory purge using a second version of the manifest.

    CACHE FOR EFFICIENT RECORD LOOKUPS IN AN LSM DATA STRUCTURE

    公开(公告)号:US20200320081A1

    公开(公告)日:2020-10-08

    申请号:US16908006

    申请日:2020-06-22

    Abstract: Techniques are disclosed relating to maintaining a cache usable to locate data stored in a data structure. A computer system, in various embodiments, maintains a data structure having a plurality of levels that store files for a database. The files may include one or more records that each have a key and corresponding data. The computer system may also maintain a cache for the database whose entries store, for a key, an indication of a location of a corresponding record in a file of the data structure. In some embodiments, the computer system receives a request to access a particular record stored in the data structure where the request specifies a key usable to locate the particular record. The computer system may retrieve, from the cache via the key, a particular indication of a location of the particular record and may use the particular indication to access the particular record.

    SYSTEM AND METHOD FOR EARLY REMOVAL OF TOMBSTONE RECORDS IN DATABASE

    公开(公告)号:US20200097205A1

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

    申请号:US16139717

    申请日:2018-09-24

    Abstract: A method of deleting tombstones early includes setting an initial-flag in a first record in the storage system, setting a delete-flag in a second record in the storage system, selecting a set of one or more records in the storage system to be written to an extent of the storage system in a merge operation, each of the one or more records being associated with the first key, and performing the merge operation, wherein the second record is not written to the extent during the merge operation based at least in part on a determination that the first record having the initial-flag set is the oldest record in the set and the second record having the delete-flag set is the newest record in the set.

    FORMATION AND MANIPULATION OF TEST DATA IN A DATABASE SYSTEM

    公开(公告)号:US20190163613A1

    公开(公告)日:2019-05-30

    申请号:US16263067

    申请日:2019-01-31

    Abstract: Systems and methods are provided for creating a sandbox for an original tenant at a point in time, the original tenant having original tenant data stored in an immutable storage associated with an original tenant identifier, the original tenant data as of the sandbox creation point in time being a virtual snapshot of the original tenant data accessible by a sandbox tenant, where the sandbox tenant data can be changed without changing the original tenant data, and the original tenant data can be changed without changing the sandbox tenant data. A sandbox tenant is created by associating a sandbox tenant identifier with the virtual snapshot of the original tenant data and with sandbox tenant data created by the sandbox tenant subsequent to the sandbox creation point in time. Original tenant data is subsequently created and associated with the original tenant identifier, and is not accessible to the sandbox tenant.

Patent Agency Ranking