Cloud Storage for Database Using Object Storage

    公开(公告)号:US20220245092A1

    公开(公告)日:2022-08-04

    申请号:US17162035

    申请日:2021-01-29

    Abstract: Techniques are disclosed relating to managing distributed storage of data with low latency access and durable storage. A distributed storage system may include storage caches distributed across availability zones in front of a shared object storage. Database nodes collocated with the storage caches may handle the storage, retrieval, and manipulation of data in the storage caches and the shared object storage. The shared object storage cache provides persistent storage of data for the distributed storage system while storage of the data in the storage caches is implemented to provide low latency retrieval of the storage. The storage caches across the availability zones may be populated through the shared object storage rather than moving data across availability zones.

    KEYSPACE REFERENCES
    12.
    发明申请

    公开(公告)号:US20220129445A1

    公开(公告)日:2022-04-28

    申请号:US17083000

    申请日:2020-10-28

    Abstract: Techniques are disclosed relating to tracking record writes for keyspaces across a set of database nodes. A first database node of a database system may receive a request to perform a database transaction that includes writing a particular record for a key included in a keyspace. The first database node may access a keyspace reference catalog that stores a plurality of indications of when keyspaces were written to by database nodes of the database system. In response to determining that a second database node has written a record for the keyspace within a particular time frame, the first database node may send a request to the second database node for information indicating whether the second database node has written a record for the key. Based on a response that is received from the second database node, the first database node may determine whether to write the particular record.

    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.

    Key-value storage using a skip list

    公开(公告)号:US11544271B2

    公开(公告)日:2023-01-03

    申请号:US16908097

    申请日:2020-06-22

    Abstract: This disclosure provides various techniques that may allow for accessing values stored in a data structure that stores multiple values corresponding to database transactions using a skip list. A key may be used to traverse the skip list to access data associated with the key. The skip list maintains on ordering of multiple keys, each associated with a particular record in the data structure, using indirect links between data records in the data structure that reference buckets included in hash table. Each bucket includes pointers to one or more records in the skip list.

    KEY-VALUE STORAGE USING A SKIP LIST
    16.
    发明申请

    公开(公告)号:US20200320083A1

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

    申请号:US16908097

    申请日:2020-06-22

    Abstract: This disclosure provides various techniques that may allow for accessing values stored in a data structure that stores multiple values corresponding to database transactions using a skip list. A key may be used to traverse the skip list to access data associated with the key. The skip list maintains on ordering of multiple keys, each associated with a particular record in the data structure, using indirect links between data records in the data structure that reference buckets included in hash table. Each bucket includes pointers to one or more records in the skip list.

    MULTIVERSION CONCURRENCY CONTROL OF DATABASE RECORDS WITH UNCOMMITTED TRANSACTIONS

    公开(公告)号:US20190278762A1

    公开(公告)日:2019-09-12

    申请号:US16426052

    申请日:2019-05-30

    Abstract: Systems and methods provide multi-version concurrency control of database records with uncommitted transactions. The system and methods may include receiving a query regarding a transaction counter number. When a transaction header identifying data is updated with the assigned transaction counter number, the updated transaction header may be used in identifying data as an instance of multiversion concurrency control information by the received query. A key lookup may be performed, and when the key lookup encounters an uncommitted row for a transaction number, a corresponding transaction header identifying data to identify a data array element to determine whether the transaction number is committed, and determining the transaction counter number when the transaction number is committed. The transaction counter number may be stamped on the row version record when it is determined that the row is committed.

    DATABASE CONCURRENCY CONTROL THROUGH HASH-BUCKET LATCHING

    公开(公告)号:US20180218023A1

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

    申请号:US15420377

    申请日:2017-01-31

    Abstract: Techniques are disclosed relating to efficiently processing of concurrent database transactions. In one embodiment, a database system receives a first key-value pair for a database transaction and stores the key-value pair in a data structure for active database transactions. The storing may include indexing into a hash table of the data structure with a key of the key-value pair to identify a hash bucket of the hash table corresponding to the key, acquiring a latch associated with the identified hash bucket, and, based on a state of the acquired latch, appending, to the hash bucket, a record specifying the key-value pair. The database system may cause the key-value pair from the data structure to be committed to persistent storage in response to the database transaction being committed.

Patent Agency Ranking