OBJECT HISTORY TRACKING
    1.
    发明申请

    公开(公告)号:US20240427690A1

    公开(公告)日:2024-12-26

    申请号:US18212322

    申请日:2023-06-21

    Applicant: SAP SE

    Inventor: Thomas Legler

    Abstract: Example methods and systems are directed to the enabling of object history tracking in an object-oriented programming environment. According to some examples, a tracking class includes a tracking function and a tracked class includes a tracked function. A system receives user input to link the tracked function to the tracking function. Executable code is executed to create a target object of the tracked class and to execute the tracked function with respect to the target object. Execution of the tracked function triggers the tracking function to obtain tracking data relating to the target object. The tracking data is stored as part of the target object. According to some examples, the system receives an indication of an error that occurred during execution of the executable code, retrieves the tracking data from the target object, and causes presentation of the tracking data at a user device.

    Partial compression of tree-based index structure

    公开(公告)号:US11714795B2

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

    申请号:US17483287

    申请日:2021-09-23

    Applicant: SAP SE

    Inventor: Thomas Legler

    CPC classification number: G06F16/2246 G06F12/0238 G06F16/2282

    Abstract: A system includes storage of data into a target memory location allocated to a target leaf node of a tree-based index structure, the target leaf node being a child node of a parent node of the tree-based index structure, where the tree-based index structure comprises one or more other leaf nodes which are child nodes of the parent node, and each of the target leaf node and the one or more other leaf nodes is associated with a plurality of allocated memory locations, incremental identification of all unused allocated memory locations between a first allocated memory location of a left-most one of the target leaf node and the one or more other leaf nodes and a last used allocated memory location of a right-most one of the target leaf node and the one or more other leaf nodes, and movement of data stored in the target leaf node and the one or more other leaf nodes into the identified unused allocated memory locations.

    Automated optimization for in-memory data structures of column store databases

    公开(公告)号:US11520763B2

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

    申请号:US16830645

    申请日:2020-03-26

    Applicant: SAP SE

    Inventor: Thomas Legler

    Abstract: There is provided a method for compressing a first tree data structure. The method includes determining, by a processor, to compress a first tree data structure associated with a dictionary of a database management system. The method further includes compressing the first tree data structure to generate a compressed tree data structure. The compressing includes traversing, by the processor and in response to the determining, the first tree data structure on a lowest level. The compressing further includes identifying, by the processor and in response to traversing, empty nodes on the lowest level. The compressing further includes removing the identified empty nodes to compress the lowest level. The compressing further includes constructing, in response to the removing, a second level of the compressed tree data structure based on the compressed lowest level, the second level higher in the compressed tree data structure than the compressed lowest level.

    ADAPTIVE HARDWARE TRANSACTIONAL MEMORY BASED CONCURRENCY CONTROL

    公开(公告)号:US20200310862A1

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

    申请号:US16367910

    申请日:2019-03-28

    Applicant: SAP SE

    Inventor: Thomas Legler

    Abstract: A method may include determining a threshold quantity of attempts to optimistically perform a first transaction operating data stored in a database. The threshold quantity of attempts may be determined based on an expected workload of the first transaction and/or a workload at the database. The first transaction may be performed optimistically including by tracking cache lines accessed by the first transaction and detecting, based on a second transaction writing to a cache line accessed by the first transaction, a conflict between the first transaction and the second transaction. If the first transaction is not successful performed after the threshold quantity of attempts to optimistically perform the first transaction, the first transaction may be performed in a fallback mode including by acquiring a lock to prevent the second transaction from accessing a same data in the database as the first transaction. Related systems and articles of manufacture are also provided.

    Auto unload
    6.
    发明授权

    公开(公告)号:US10706035B2

    公开(公告)日:2020-07-07

    申请号:US15945715

    申请日:2018-04-04

    Applicant: SAP SE

    Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

    Database calculation engine
    7.
    发明授权

    公开(公告)号:US09672250B2

    公开(公告)日:2017-06-06

    申请号:US15094708

    申请日:2016-04-08

    Applicant: SAP SE

    Abstract: A select query or a data referencing a calculation scenario is received by a database server from a remote application server. The specified calculation scenario is one of a plurality of calculation scenarios and it defines a data flow model that includes one or more calculation nodes. Each calculation node defines one or more operations to execute on the database server. Thereafter, the database server instantiates the specified calculation scenario and executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set. This data set is then provided by the database server to the application server. Related apparatus, systems, techniques and articles are also described.

    Determining an optimum quantity of interleaved instruction streams of defined coroutines

    公开(公告)号:US11789741B2

    公开(公告)日:2023-10-17

    申请号:US15915787

    申请日:2018-03-08

    Applicant: SAP SE

    CPC classification number: G06F9/3851 G06F9/30047

    Abstract: A method for optimizing memory access for database operations is provided. The method may include performing a first database operation by at least executing a first instruction stream associated with the first database operation. The first database operation may be defined as a coroutine to at least enable the execution of the first instruction stream to be interleaved with an execution of a second instruction stream. In response to determining that data required to continue the execution of the first instruction stream is absent from a cache, the execution of the first instruction stream may be suspended and the second instruction stream may be executed instead. Related systems and articles of manufacture, including computer program products, are also provided.

    Auto unload
    10.
    发明授权

    公开(公告)号:US11726975B2

    公开(公告)日:2023-08-15

    申请号:US17733514

    申请日:2022-04-29

    Applicant: SAP SE

    CPC classification number: G06F16/2282 G06F9/44594 G06F16/2358 G06F16/2477

    Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Patent Agency Ranking