Access control for database
    1.
    发明授权

    公开(公告)号:US11005850B2

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

    申请号:US16120764

    申请日:2018-09-04

    摘要: In an embodiment of the present invention, a command for performing a database operation with respect to a table of a database is received, whereby the table has a visible key column for identification information and one or more invisible token columns for token information. The user's role from the command is obtained. A record is identified in the table based on a combination of the identification information and the token information corresponding to the user's role. The database operation is performed on the identified record.

    Parallel execution of merge operations

    公开(公告)号:US10885029B2

    公开(公告)日:2021-01-05

    申请号:US16195903

    申请日:2018-11-20

    IPC分类号: G06F16/22 G06F16/2453

    摘要: Aspects include a method that includes receiving a structured query language (SQL) database command at a processing device configured to manage a table space of a relational database, the database command including a merge statement. The method also includes identifying a group of target records from the database command, and associating each target record with one of a plurality of portions of the table space, and in response to determining that the group of target records is associated with more than one portion of the table space, sorting the target records into a plurality of sub-groups, each sub-group associated with a different portion of the table space. The method further includes generating a sub-task associated with each sub-group, the sub-task prescribing aspects of performing the merge operation using an associated sub-group respective sub-group, and performing all of the sub-tasks on the memory space in parallel.

    ENHANCEMENTS FOR OPTIMIZING QUERY EXECUTIONS

    公开(公告)号:US20190294601A1

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

    申请号:US16406049

    申请日:2019-05-08

    摘要: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

    Global filter factor estimation
    5.
    发明授权

    公开(公告)号:US10229149B2

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

    申请号:US15597555

    申请日:2017-05-17

    IPC分类号: G06F17/30

    摘要: A computer maps a literal in a database query to a digital representation, wherein the database query comprises a predicate, the literal is a part of the predicate, and the digital representation is predetermined based at least in part on external statistical data. The computer estimates a filter factor for the predicate based at least in part on the digital representation and compressed statistical data, wherein the compressed statistical data are prepared at least in part from the external statistical data.

    PARTITION ACCESS METHOD FOR QUERY OPTIMIZATION

    公开(公告)号:US20190026331A1

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

    申请号:US16137606

    申请日:2018-09-21

    IPC分类号: G06F17/30

    摘要: In an approach to determining an access method for a partition in a partition table, a computer receives a query and determines if there is a partition table utilized by the query. When there is a partition table utilized by the query, then the computer determines that a partition in the partition table meets the plurality of conditions of the query. The computer collects a plurality of partition level statistics for the partition that meets the plurality of conditions of the query. Additionally, the computer determines, based, at least in part, on the plurality of partition level statistics, a cost for one or more access methods for the partition that meets the plurality of conditions of the query. Furthermore, the computer determines, based, at least in part, on the cost for each access method, an access method for the partition that meets the plurality of conditions of the query.

    Index building in response to data input

    公开(公告)号:US10095721B2

    公开(公告)日:2018-10-09

    申请号:US14670773

    申请日:2015-03-27

    IPC分类号: G06F17/30

    摘要: In a method for managing a data index, one or more processors inserting one or more rows of data sequentially into a data table of a database. The method further includes inserting index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table, wherein an index B-tree structure is not built initially during insertion. The method further includes determining whether one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met. The method further includes responsive to determining that one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met, building an index-B-tree structure that includes the index entries inserted into the index.

    Context based access path selection

    公开(公告)号:US10013457B2

    公开(公告)日:2018-07-03

    申请号:US14854087

    申请日:2015-09-15

    IPC分类号: G06F17/30

    摘要: A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

    Enhancements for optimizing query executions

    公开(公告)号:US09996574B2

    公开(公告)日:2018-06-12

    申请号:US14755608

    申请日:2015-06-30

    IPC分类号: G06F17/30

    摘要: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

    GENERATION OF QUERY EXECUTION PLANS
    10.
    发明申请

    公开(公告)号:US20180121507A1

    公开(公告)日:2018-05-03

    申请号:US15335724

    申请日:2016-10-27

    IPC分类号: G06F17/30

    摘要: Aspects of the present disclosure relate to an approach for generating query execution plans for a database query. A computer-implemented method comprises determining whether a size of a file to be generated during execution of a database query is variable in response to obtaining the database query. The method further comprises determining a plurality of ranges for the size of the file in response to determining that the size of the file is variable. The method further comprises generating a plurality of query execution plans corresponding to the plurality of ranges. Accordingly, a plurality of query execution plans corresponding to different file sizes can be generated for the database query, and an efficient and cost effective query execution plan may be selected based on the actual file size during the execution of the database query.