Efficient and non-disruptive online defragmentation with record locking

    公开(公告)号:US11204911B2

    公开(公告)日:2021-12-21

    申请号:US16824933

    申请日:2020-03-20

    Applicant: SAP SE

    Abstract: Methods, systems, and computer-readable storage media for online defragmentation of memory in database systems by applying an IX-lock to each table having data stored in a marked page in a set of marked pages, generating a record map including key-value pairs, each being associated with a record location in a marked page, a value of each key-value pair initially set to a first value, iteratively executing the online defragmentation to delete data from marked pages and add the data to non-sparse pages, at least one iteration including applying a try-lock to a record in a marked page, and at iterations of the online defragmentation, updating the record map to change the value of at least one key-value pair from the first value to the second value, the second value representing that data of a marked page has been deleted from the marked page and added to a non-sparse page.

    EFFICIENT AND NON-DISRUPTIVE ONLINE DEFRAGMENTATION WITH RECORD LOCKING

    公开(公告)号:US20210294786A1

    公开(公告)日:2021-09-23

    申请号:US16824933

    申请日:2020-03-20

    Applicant: SAP SE

    Abstract: Methods, systems, and computer-readable storage media for online defragmentation of memory in database systems by applying an IX-lock to each table having data stored in a marked page in a set of marked pages, generating a record map including key-value pairs, each being associated with a record location in a marked page, a value of each key-value pair initially set to a first value, iteratively executing the online defragmentation to delete data from marked pages and add the data to non-sparse pages, at least one iteration including applying a try-lock to a record in a marked page, and at iterations of the online defragmentation, updating the record map to change the value of at least one key-value pair from the first value to the second value, the second value representing that data of a marked page has been deleted from the marked page and added to a non-sparse page.

    Memory allocation and deallocation mechanism to reduce fragmentation and enhance defragmentation performance

    公开(公告)号:US11461363B2

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

    申请号:US16835549

    申请日:2020-03-31

    Applicant: SAP SE

    Abstract: Methods, systems, and computer-readable storage media for receiving a first storage request indicating a first type of data and a first size, identifying a first sub-space based on the first type, the first sub-space including a dense group of dense segments and a sparse group of sparse segments, and determining that the dense group of the first sub-space is absent a dense segment to store data of the first storage request based on the first size, and in response: determining whether the sparse group of the first sub-space includes a sparse segment to store the data of the first storage request based on the first size, and storing the data of the first storage request to the sparse group of the first sub-space in response to determining that the sparse group of the first sub-space includes a sparse segment to store the data of the first storage request.

    MEMORY ALLOCATION AND DEALLOCATION MECHANISM TO REDUCE FRAGMENTATION AND ENHANCE DEFRAGMENTATION PERFORMANCE

    公开(公告)号:US20210311962A1

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

    申请号:US16835549

    申请日:2020-03-31

    Applicant: SAP SE

    Abstract: Methods, systems, and computer-readable storage media for receiving a first storage request indicating a first type of data and a first size, identifying a first sub-space based on the first type, the first sub-space including a dense group of dense segments and a sparse group of sparse segments, and determining that the dense group of the first sub-space is absent a dense segment to store data of the first storage request based on the first size, and in response: determining whether the sparse group of the first sub-space includes a sparse segment to store the data of the first storage request based on the first size, and storing the data of the first storage request to the sparse group of the first sub-space in response to determining that the sparse group of the first sub-space includes a sparse segment to store the data of the first storage request.

Patent Agency Ranking