Lock wait tracing
    1.
    发明授权

    公开(公告)号:US11698898B2

    公开(公告)日:2023-07-11

    申请号:US17089355

    申请日:2020-11-04

    CPC classification number: G06F16/2365 G06F16/2282

    Abstract: Techniques are disclosed relating to lock wait tracing. A computer system may operate a database that includes a lockable object. The computer may maintain a lock wait queue that stores an indication of processes waiting to acquire a lock on the lockable object. The computer system may store trace records for those processes that, upon releasing a respective lock on the lockable object when another process is waiting in the lock wait queue, have been in contention for the respective lock for over a threshold amount of time. The computer system may present ones of the trace records that identify a timeline that is usable to determine a set of processes that contributed to a delay in a process acquiring a lock on the lockable object.

    Fast skip list purge
    2.
    发明授权

    公开(公告)号:US11625386B2

    公开(公告)日:2023-04-11

    申请号:US17162794

    申请日:2021-01-29

    Abstract: Techniques are disclosed relating to efficiently managing skip list data structures. In some embodiments, a computing system stores a skip list including a plurality of key-value records that include one or more pointers to others of the plurality of key-value records. The computing system scans the plurality of key-value records in key order to identify key-value records to be purged from the skip list. The scanning includes maintaining a list of key-value records that include pointers that point to key-value records that have not yet been scanned by the scanning. In response to identifying a key-value record for purging, the computing system purges the key-value record by substituting the pointers included the key-value records of the list with pointers included in the key-value record being purged.

    Fast Skip List Purge
    3.
    发明申请

    公开(公告)号:US20220245123A1

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

    申请号:US17162794

    申请日:2021-01-29

    Abstract: Techniques are disclosed relating to efficiently managing skip list data structures. In some embodiments, a computing system stores a skip list including a plurality of key-value records that include one or more pointers to others of the plurality of key-value records. The computing system scans the plurality of key-value records in key order to identify key-value records to be purged from the skip list. The scanning includes maintaining a list of key-value records that include pointers that point to key-value records that have not yet been scanned by the scanning. In response to identifying a key-value record for purging, the computing system purges the key-value record by substituting the pointers included the key-value records of the list with pointers included in the key-value record being purged.

    SYSTEMS AND METHODS OF OPERATION LOCK MANAGEMENT AND SYSTEM CATALOG OVERRIDES IN DATABASE SYSTEMS

    公开(公告)号:US20200089789A1

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

    申请号:US16135242

    申请日:2018-09-19

    Abstract: Systems and methods are provided for a shared memory between a database system and a storage catalog server, which stores system catalog overrides and locks for at least a first workflow. The current system catalog overrides include at least a portion of the system catalog overrides and locks that are retrieved by the shared memory from the storage catalog server at a predetermined point in time. The database system performs a check of at least one of index validity and tenant validity for a second workflow or other database operation by checking a state of the corresponding tenant or index in the current system catalog overrides. The system catalog overrides suppress visibility of the respective system catalog changes when the database system determines that at least one of the index and the tenant is invalid based on the current system catalog overrides for the first workflow.

    KEY-VALUE STORAGE USING A SKIP LIST
    5.
    发明公开

    公开(公告)号:US20230148215A1

    公开(公告)日:2023-05-11

    申请号:US18149440

    申请日:2023-01-03

    CPC classification number: G06F16/24562

    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

    公开(公告)号:US11416470B2

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

    申请号: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.

    LOCK WAIT TRACING
    7.
    发明申请

    公开(公告)号:US20220138175A1

    公开(公告)日:2022-05-05

    申请号:US17089355

    申请日:2020-11-04

    Abstract: Techniques are disclosed relating to lock wait tracing. A computer system may operate a database that includes a lockable object. The computer may maintain a lock wait queue that stores an indication of processes waiting to acquire a lock on the lockable object. The computer system may store trace records for those processes that, upon releasing a respective lock on the lockable object when another process is waiting in the lock wait queue, have been in contention for the respective lock for over a threshold amount of time. The computer system may present ones of the trace records that identify a timeline that is usable to determine a set of processes that contributed to a delay in a process acquiring a lock on the lockable object.

    Delegated Key-Level Locking for a Transactional Multi-Version Key-Value Store

    公开(公告)号:US20180218022A1

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

    申请号:US15420255

    申请日:2017-01-31

    CPC classification number: G06F16/2343 G06F16/28

    Abstract: This disclosure provides various techniques that may allow for key-level lock requests in a database to be managed by code that manages a memory buffer for the database. The transaction-level locks and other higher level locks may be managed by a separate lock manager. In an embodiment, the code inserts key-level lock requests in the record chain even if there is a conflict, and the key-level lock requests remain in the chain after the locks are subsequently granted. Preemption may also be supported in the record chain, in some embodiments.

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

    公开(公告)号:US20180217987A1

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

    申请号:US15420342

    申请日:2017-01-31

    CPC classification number: G06F16/24562

    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

    公开(公告)号:US12013860B2

    公开(公告)日:2024-06-18

    申请号:US18149440

    申请日:2023-01-03

    CPC classification number: G06F16/24562

    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.

Patent Agency Ranking