IN-MEMORY KEY-VALUE STORE FOR A MULTI-MODEL DATABASE

    公开(公告)号:US20190340183A1

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

    申请号:US16518114

    申请日:2019-07-22

    Abstract: Techniques related to an in-memory key-value store for a multi-model database are disclosed. In an embodiment, a relational database may be maintained on persistent storage. The relational database may be managed by a database server and may include a database table. The database table may be stored in a persistent format. Key-value records may be generated within volatile memory accessible to the database server by converting data in the database table to a key-value format. The key-value format may be different from and independent of the persistent format. A database statement referencing the database table may be executed based on determining whether to access one or more key-value records in the volatile memory or to access the data in the database table. In response to determining to access the one or more key-value records, the database server may access the one or more key-value records in the volatile memory.

    IN-MEMORY KEY-VALUE STORE FOR A MULTI-MODEL DATABASE

    公开(公告)号:US20170147664A1

    公开(公告)日:2017-05-25

    申请号:US14946489

    申请日:2015-11-19

    CPC classification number: G06F16/258 G06F16/22

    Abstract: Techniques related to an in-memory key-value store for a multi-model database are disclosed. In an embodiment, a relational database may be maintained on persistent storage. The relational database may be managed by a database server and may include a database table. The database table may be stored in a persistent format. Key-value records may be generated within volatile memory accessible to the database server by converting data in the database table to a key-value format. The key-value format may be different from and independent of the persistent format. A database statement referencing the database table may be executed based on determining whether to access one or more key-value records in the volatile memory or to access the data in the database table. In response to determining to access the one or more key-value records, the database server may access the one or more key-value records in the volatile memory.

    DATABASE-NATIVE AUTOMATIC COMPENSATION FOR SAGAS

    公开(公告)号:US20240126745A1

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

    申请号:US18223824

    申请日:2023-07-19

    CPC classification number: G06F16/2379 G06F16/2343

    Abstract: A database-native Lock-Free Reservation infrastructure is used to provide automatic compensation for the reservable column updates made by successful local transactions (or microservice actions) that are part of a saga that is being aborted. The automatic compensation is achieved by tracking the reservable column updates in a reservations journal, within the database, during the execution of the local transaction and remembering them beyond the commit of the local transaction until the finalization of the saga that the transaction is a part of. If the saga aborts, then the database server automatically uses the information retained in the reservations journal to compensate for the changes made by the committed transactions that were part of the saga.

    SYSTEM AND METHOD FOR INCREASED TRANSACTION THROUGHPUT AND IMPROVED RESPONSE TIME UNDER HIGH CONTENTION

    公开(公告)号:US20240126741A1

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

    申请号:US18223822

    申请日:2023-07-19

    CPC classification number: G06F16/2343 G06F16/2379

    Abstract: A Lock-Free Reservation mechanism is provided. When a transaction issues an update that affects a value in a “reservable column” of a row, the database server does not immediately obtain a lock that covers the row. Instead, the database server adds a reservation to a reservation journal. At the time the transaction commits, a lock is obtained and the requested update is made. In one implementation, before adding the reservation to the reservation journal, the database server determines whether making the update would violate any constraints involving the reservable column. In one implementation, the constraint check not only takes into account the current value of the data item that is being updated and the amount of the update, but also pre-existing reservations in the reservation journal that affect the same data item.

Patent Agency Ranking