Provided are methods and systems comprising receiving a plurality of data tables, wherein each data table comprises at least one row, generating a first handle for a first value in a table of the plurality of tables, wherein the first handle comprises an indication of whether a row in each of the plurality of tables is associated or not associated with the first value, and performing one or more operations on the first handle.

An approach for implementing function semantic based partition-wise SQL execution and partition pruning in a data processing system is provided. The system receives a query directed to a range-partitioned table and determines if operation key(s) of the query include(s) function(s) over the table partitioning key(s). If so, the system obtains a set of values corresponding to each partition by evaluating the function(s) on a low bound and/or a high bound table partitioning key value corresponding to the partition. The system may then compare the sets of values corresponding to different partitions and determine whether to aggregate results obtained by executing the query over the partitions based on the comparison. The system may also determine whether to prune any partitions from processing based on a set of correlations between the set of values for each partition and predicate(s) of the query including function(s) over the table partitioning key(s).

The automated creation of a dataflow graph of a standing query. Once the standing query dataflow graph is created, events may be flowed into the dataflow graph to execute the standing query. In execution, a store query is accessed. The store query is structured in accordance with a store query language. A syntax graph (such as an abstract syntax tree) of the store query may then be generated. Then, using the syntax graph and a set of rules of the store query language, the dataflow graph is automatically generated. This significant speeds up and makes more easy and efficient the conversion of a store query into a standing query.

Disclosed are a distributed database preprocessing method, a database proxy layer, a system and a non-transitory computer-readable storage medium. The distributed database preprocessing method, applied to a database proxy layer, may include: receiving a request corresponding to a prepared statement; and performing processing according to the request corresponding to the prepared statement and a session identifier cached in a prepared statement cache library, a session corresponding to the session identifier cached in the prepared statement cache library is a prepared statement session where a connection is successfully established between a client and a database.

SCAN operations for databases where scan time is dependent on a payload size consume too much memory space and computing time as payload sizes increase. A database table is configured to include an additional index mapping column that stores bitmaps related to the corresponding row of the table. Each bit in the bitmap corresponds to a column and indicates whether that column stores a value. Inclusion of an index column in a table decouples the time it takes to perform the SCAN operation on a column from the payload size of data stored in the column. The bitmaps stored in the index column are relatively small and uniform in size, so the SCAN operation on such a database requires only for the bitmap values of the applicable rows to be obtained from the index column and inspected.

Some embodiments provide a method for analyzing database queries performed on a database. The method receives log data associated with queries that were performed on the database, wherein the log data includes multiple sub-tables that each include a set of data entries. Based on the log data, the method assembles a set of queries that were performed on the database, where different queries in the set are assembled by combining different subsets of data entries from the sub-tables. The method performs a query interpretation operation on each query to quantify the impact of performing the assembled set of queries on the database.

Systems and methods utilize a data model database which includes a plurality of symbol data types. Each of the plurality of symbol data types have one or more symbol data fields. The data model database further includes a plurality of concrete data types. Each of the concrete data types have one or more language-agnostic concrete fields associated with each of the one or more symbol data fields. Each of the one or more language-agnostic concrete fields apply one or more concrete constraints to each of the corresponding symbol data fields. The data model database further includes a plurality of carrier data types. The plurality of carrier data types having one or more language-specific carrier fields associated with each of the one or more language-agnostic concrete fields. Each of the one or more language-specific carrier fields apply one or more carrier constraints to each of the corresponding language-agnostic concrete fields.

Systems and methods for embodiments of artificial intelligence systems for identity management are disclosed. Embodiments of the identity management systems disclosed herein may support the creation, association, searching, or visualization of any relevant context to identity management assets for a variety of purposes, including for informing the identity management systems' manual or automated decisions, processes or workflows.

SCAN operations for databases where scan time is dependent on a payload size consume too much memory space and computing time as payload sizes increase. A database table is configured to include an additional index mapping column that stores bitmaps related to the corresponding row of the table. Each bit in the bitmap corresponds to a column and indicates whether that column stores a value. Inclusion of an index column in a table decouples the time it takes to perform the SCAN operation on a column from the payload size of data stored in the column. The bitmaps stored in the index column are relatively small and uniform in size, so the SCAN operation on such a database requires only for the bitmap values of the applicable rows to be obtained from the index column and inspected.

Stored procedures are generated to perform incremental updates to a materialized view for a database. When a request to create a materialized view is received, one or more internal tables are created from the database. A stored procedure is generated that when executed will update the materialized view of the database. The stored procedure may obtain changes to the database that were not included in the internal tables and update the internal tables to include the obtained changes. The stored procedure may be performed automatically and in response to requests.