VIRTUAL DATABASE TABLES WITH UPDATABLE LOGICAL TABLE POINTERS

    公开(公告)号:US20240168954A1

    公开(公告)日:2024-05-23

    申请号:US18426114

    申请日:2024-01-29

    Applicant: SAP SE

    CPC classification number: G06F16/24562 G06F16/2379 G06F16/24552

    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in-memory storage or in dynamic storage of a database management system. The dynamic storage includes an in-memory buffer cache and persistent storage. The logical pointer can be updated to point to the in-memory storage or the dynamic storage, including based on use statistics. Similarly, a table having data for the virtual table can be transitioned between the in-memory buffer cache and the persistent storage, including based on use statistics for the virtual table. A value for the logical pointer can be updated when the table is transferred between the in-memory buffer cache and the dynamic storage.

    Constraint data statistics
    2.
    发明授权

    公开(公告)号:US11468035B2

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

    申请号:US15796326

    申请日:2017-10-27

    Applicant: SAP SE

    Abstract: Disclosed herein are system, method, and computer program product embodiments for using a data statistic as a dynamic data integrity constraint. An embodiment operates by defining a data statistic for a column or a set of columns of a partition of a plurality of partitions of a database table. The embodiment creates a constraint data statistics object based on the data statistic. The embodiment receives a query for the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition. The embodiment derives an implied constraint based on the constraint data statistics object. The embodiment processes the query for the partition based on the implied constraint.

    SUPPORTING SCALABLE DISTRIBUTED SECONDARY INDEX USING REPLICATION ENGINE FOR HIGH-PERFORMANCE DISTRIBUTED DATABASE SYSTEMS

    公开(公告)号:US20200320051A1

    公开(公告)日:2020-10-08

    申请号:US16372644

    申请日:2019-04-02

    Applicant: SAP SE

    Abstract: Implementations of the present disclosure include providing, at each node in a set of nodes of a database system, a table partition of a plurality of table partitions, the plurality of table partitions being provided by partitioning a table using a primary key, providing, at each node in the set of nodes of the database system, a secondary index partition of a plurality of secondary index partitions, each secondary index partition including a replicate table of at least a portion of the table, the plurality of secondary index partitions being provided by partitioning the table using one or more secondary keys, and for at least one operation executed on a table partition, executing a replication protocol to replicate the at least one operation on a secondary index partition that corresponds to the table partition.

    Validating query results during asynchronous database replication

    公开(公告)号:US10545995B2

    公开(公告)日:2020-01-28

    申请号:US15601008

    申请日:2017-05-22

    Applicant: SAP SE

    Abstract: An oldest version timestamp is received from a first database. A current commit timestamp is received from a second database configured to asynchronously replicate the first database. The current global commit timestamp corresponds to a commit transaction executed in the first database and subsequently replicated in the second database. A first test query is then issued to the second database including a request for a current timestamp of the second database. A second test query is issued to the primary database requesting records associated with a target update version that has a target timestamp equal to the current snapshot timestamp. A determination is then made that a first return associated with the first test query and a second return associated with the second test query are identical indicating a successful validation. Related apparatus, systems, techniques and articles are also described.

    Unified table delta dictionary memory size and load time optimization

    公开(公告)号:US10521117B2

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

    申请号:US14951046

    申请日:2015-11-24

    Applicant: SAP SE

    Abstract: First page data from one or more pages stored on a persistent storage can be loaded into a page buffer in a main system memory of one or more computing systems, and second page data that includes first dictionary values of a first dictionary for a first database column can be loaded and pinned into the page buffer in the main system memory. First contents of a first dictionary block containing first re-direction references to the first dictionary can be copied from the loaded first page data into a first in-memory array, and the first page data can be deallocated from the page buffer. The first re-direction references can direct to the first dictionary values of the first dictionary in the pinned second page data.

    EFFECTIVE PARTITION PRUNING USING GLOBALLY ENCODED PARTITIONS

    公开(公告)号:US20190236193A1

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

    申请号:US15964624

    申请日:2018-04-27

    Applicant: SAP SE

    CPC classification number: G06F16/24561 G06F16/2282 G06F16/242 G06F16/278

    Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning using globally encoded range partition information. An embodiment operates by partitioning a data table into a plurality of data partitions, determining a plurality of sub-partitions within the data partitions, and determining a global range table based at least in part on value ranges corresponding to the sub-partitions. Further, the global range table may be used to determine bit vectors for the data partitions and query predicates. In some examples, the bit vectors may be used to determine whether to prune data partitions during execution of a query over a large data volume.

    DECLARATIVE RULES FOR OPTIMIZED ACCESS TO DATA

    公开(公告)号:US20180253473A1

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

    申请号:US15601815

    申请日:2017-05-22

    Applicant: SAP SE

    CPC classification number: G06F16/24537 G06F16/24564

    Abstract: The present disclosure involves systems, software, and computer implemented methods for using declarative rules for optimized access to data. One example method includes receiving a structured query language (SQL) query, the SQL query associated with at least one database table and at least one predicate. A determination is made as to whether the SQL query is associated with at least one declarative rule based on the at least one database table and the at least one predicate. In response to determining that the SQL query is associated with at least one declarative rule, the at least one associated declarative rule is applied, during optimization of the SQL query. The at least one declarative rule defines a transformation to the SQL query to be performed during query optimization. An updated SQL query is generated based on the applied at least one associated declarative rule and the updated SQL query is provided.

    PAGED COLUMN DICTIONARY
    9.
    发明申请

    公开(公告)号:US20180239788A1

    公开(公告)日:2018-08-23

    申请号:US15958663

    申请日:2018-04-20

    Applicant: SAP SE

    CPC classification number: G06F16/22

    Abstract: A request for an entry of a dictionary having multiple dictionary blocks may be received, where the dictionary stores string values associated with corresponding value identifiers (IDs) for dictionary compression. One of the dictionary blocks may be selectively loaded into memory, and the dictionary block that has been loaded into memory may be searched. A value ID directory may be constructed in memory, where the value ID directory includes last value IDs for the dictionary blocks, and each of the last value IDs is mapped to an index of one of the dictionary blocks that includes a string value for that last value ID. A separator directory may also be constructed in memory, where the separator directory includes separators for the dictionary blocks, and each of the separators is mapped to an index of one of the dictionary blocks that includes a string value for that separator.

Patent Agency Ranking