Hash Collision Tables For Relational Operations

    公开(公告)号:US20180336263A1

    公开(公告)日:2018-11-22

    申请号:US15601983

    申请日:2017-05-22

    Applicant: SAP SE

    Abstract: A system for hash collision tables for relational operations is provided. In some implementations, the system performs operations comprising generating a plurality of hash values for at least a portion of one or more database tables based on a database query, and generating a hash table for at least a portion of the plurality of hash values. The operations can further include generating first results based on execution of a first operation in the database query using the hash table. Additionally, the operations can further include generating second results based on the first results and execution of a second operation in the database query using the hash table. Related systems, methods, and articles of manufacture are also described.

    QUERY PLAN GENERATION BASED ON TABLE ADAPTER
    72.
    发明申请

    公开(公告)号:US20180150517A1

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

    申请号:US15364004

    申请日:2016-11-29

    Applicant: SAP SE

    Abstract: In some aspects, there is provided a method for database query execution planning using table adapters. In some aspects, a method may include receiving, at a database execution engine, a query; generating, by the database execution engine, a query plan for execution of the query, the query requiring access to at least one table; calling, by the database execution engine, a table adapter to prepare at least one table object to enable access, during runtime, to the at least one table; and receiving, by the database execution engine, the at least one table object prepared by the table adapter. Related systems, methods, and articles of manufacture are also described.

    Query Planning and Execution With Source and Sink Operators

    公开(公告)号:US20180150515A1

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

    申请号:US15363550

    申请日:2016-11-29

    Applicant: SAP SE

    Abstract: A system for query planning and execution with source and/or sink operators is provided. In some implementations, the system performs operations comprising identifying a plurality of operators for executing a query, allocating space in memory for storing data when a second operator comprises a collection operator for collecting the data, generating at least a portion of the data based on executing a first operator, and providing the data (e.g., access to the data) to another operator which occurs after the first operator. In some implementations, a query plan for execution of the query can be generated to include the first operator and exclude the collection operator. Related systems, methods, and articles of manufacture are also described.

    Incrementally Building Hash Collision Tables
    74.
    发明申请

    公开(公告)号:US20180137164A1

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

    申请号:US15350852

    申请日:2016-11-14

    Applicant: SAP SE

    CPC classification number: G06F16/2456

    Abstract: Disclosed herein are system, method, and computer program product embodiments for incrementally building hash collision tables. In some embodiments, hashes and hash collision tables may be used to improve efficiency of relational operations, such as those used in relational databases. An embodiment operates by determining hash collisions between data entries, then storing newly determined hash values corresponding to collisions in a hash collision table. The storing can be done incrementally, without needing to rebuild hash tables or hash collision tables for all data entries.

Patent Agency Ranking