Optimal sort key compression and index rebuilding

    公开(公告)号:US10671586B2

    公开(公告)日:2020-06-02

    申请号:US15658671

    申请日:2017-07-25

    Applicant: SAP SE

    Abstract: A system and method, including determining, by a processor, distinction bit positions for index keys of a database index; determining, by the processor, concatenation of the bits of the index keys; and generating a record of the concatenation. Other systems and methods include collecting, by a processor, index keys of a database index in parallel, wherein data pages of a target table are evenly distributed to a plurality of processor cores; scanning, by each of the cores the data pages to extract compressed keys and corresponding record identifiers; sorting, by a plurality of the processor cores, pairs of the compressed key and corresponding record identifier in accordance with a parallel sorting algorithm; generating an index tree in a bottom-up fashion; and storing a record of the generated index tree.

    OPTIMAL SORT KEY COMPRESSION AND INDEX REBUILDING

    公开(公告)号:US20190034467A1

    公开(公告)日:2019-01-31

    申请号:US15658671

    申请日:2017-07-25

    Applicant: SAP SE

    CPC classification number: G06F16/2272 G06F16/2228 G06F16/23

    Abstract: A system and method, including determining, by a processor, distinction bit positions for index keys of a database index; determining, by the processor, concatenation of the bits of the index keys; and generating a record of the concatenation. Other systems and methods include collecting, by a processor, index keys of a database index in parallel, wherein data pages of a target table are evenly distributed to a plurality of processor cores; scanning, by each of the cores the data pages to extract compressed keys and corresponding record identifiers; sorting, by a plurality of the processor cores, pairs of the compressed key and corresponding record identifier in accordance with a parallel sorting algorithm; generating an index tree in a bottom-up fashion; and storing a record of the generated index tree.

    BRANCHING FOR TREE STRUCTURE IN DATABASE SYSTEM

    公开(公告)号:US20230195705A1

    公开(公告)日:2023-06-22

    申请号:US17555979

    申请日:2021-12-20

    Applicant: SAP SE

    CPC classification number: G06F16/2246 G06F16/2272 G06F16/245

    Abstract: In some embodiments, a method determines a query distinction bit (D-bit) slice for a query key using values at D-bit positions that are associated with a node in the data structure. D-bit positions are determined based on branches in the data structure. The method selects a D-bit slice for a key in the set of keys for the node based on the D-bit slice of the query key and compares a key value for the key to a query key value for the query key to determine a first D-bit position value. A D-bit position that has a second D-bit position value that is smaller in value than the first D-bit position value is selected. The D-bit position is used to determine a result for the query key.

Patent Agency Ranking