中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.017 seconds)

    HIERARCHICAL WINDOW FUNCTION
    2.
    发明申请
    HIERARCHICAL WINDOW FUNCTION 审中-公开

    公开(公告)号：US20190317939A1

    公开(公告)日：2019-10-17

    申请号：US16274903

    申请日：2019-02-13

    Applicant: SAP SE

    Inventor： Manuel Caroli ,  Aleksei Burlakov

    IPC: G06F16/2455 ,  G06F16/185 ,  G06F16/22 ,  G06F16/2457

    Abstract: A method may include generating, based on a representation of a hierarchy stored in a database, a visiting sequence data structure. The hierarchy may be stored in a table in the database. Each of a plurality of rows comprising the table may correspond to one of a plurality of nodes comprising the hierarchy. The visiting sequence data structure may include a row vector specifying an order for traversing the plurality of nodes in the hierarchy. A hierarchical window function may be executed by iterating through the plurality of rows in the table in accordance with the order specified by the row vector. The execution of the hierarchical window function may further include determining, for a first node in the hierarchy, a summary value corresponding to a first value of the first node and a second value of a second node descendent from the first node.

    Hierarchical window function
    4.
    发明授权
    Hierarchical window function 有权

    公开(公告)号：US11544267B2

    公开(公告)日：2023-01-03

    申请号：US16274903

    申请日：2019-02-13

    Applicant: SAP SE

    Inventor： Manuel Caroli ,  Aleksei Burlakov

    IPC: G06F16/2455 ,  G06F16/22 ,  G06F16/2457 ,  G06F16/185

    Abstract: A method may include generating, based on a representation of a hierarchy stored in a database, a visiting sequence data structure. The hierarchy may be stored in a table in the database. Each of a plurality of rows comprising the table may correspond to one of a plurality of nodes comprising the hierarchy. The visiting sequence data structure may include a row vector specifying an order for traversing the plurality of nodes in the hierarchy. A hierarchical window function may be executed by iterating through the plurality of rows in the table in accordance with the order specified by the row vector. The execution of the hierarchical window function may further include determining, for a first node in the hierarchy, a summary value corresponding to a first value of the first node and a second value of a second node descendent from the first node.

    HEXAGON CLUSTERING OF SPATIAL DATA
    5.
    发明申请
    HEXAGON CLUSTERING OF SPATIAL DATA 审中-公开

    公开(公告)号：US20200320108A1

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

    申请号：US16374142

    申请日：2019-04-03

    Applicant: SAP SE

    Inventor： Manuel Caroli

    IPC: G06F16/29 ,  G06T17/05 ,  G06T15/10

    Abstract: Described herein are systems and method for mapping data points in a spatial data set. In some embodiments, a hexagon grid can be defined for mapping a plurality of data points in a spatial data set. Location information can be specified for each hexagon in the hexagon grid. The specifying can include calculating, for each hexagon, a first location of a first vertex and a second location of a second vertex. A rectangular grid including a plurality of rectangular cells can be mapped to the hexagon grid. A location of a data point of the plurality of data points can be determined relative to a first hexagon of the hexagon grid.

    Hexagon clustering of spatial data
    7.
    发明授权
    Hexagon clustering of spatial data 有权

    公开(公告)号：US11163808B2

    公开(公告)日：2021-11-02

    申请号：US16374142

    申请日：2019-04-03

    Applicant: SAP SE

    Inventor： Manuel Caroli

    IPC: G06F7/00 ,  G06F16/29 ,  G06T15/10 ,  G06T17/05

    Abstract: Described herein are systems and method for mapping data points in a spatial data set. In some embodiments, a hexagon grid can be defined for mapping a plurality of data points in a spatial data set. Location information can be specified for each hexagon in the hexagon grid. The specifying can include calculating, for each hexagon, a first location of a first vertex and a second location of a second vertex. A rectangular grid including a plurality of rectangular cells can be mapped to the hexagon grid. A location of a data point of the plurality of data points can be determined relative to a first hexagon of the hexagon grid.

    METADATA APPLICATION PROGRAMMING INTERFACE FOR AD HOC DATABASE QUERIES
    8.
    发明申请
    METADATA APPLICATION PROGRAMMING INTERFACE FOR AD HOC DATABASE QUERIES 审中-公开

    公开(公告)号：US20180096032A1

    公开(公告)日：2018-04-05

    申请号：US15282413

    申请日：2016-09-30

    Applicant: SAP SE

    Inventor： Bjoern Mielenhausen ,  Manuel Caroli ,  Youssef Hatem

    IPC: G06F17/30

    CPC classification number: G06F16/24544 ,  G06F16/25 ,  G06F16/252

    Abstract: Embodiments include a metadata application programming interface (API) for processing ad hoc database queries. Embodiments can be configured to process ad hoc database queries to determine the structure of the resulting data set and to provide metadata in the form of a result table, for example, in response to the queries that describes the structure of the data to be accessed by the queries. In one embodiment, this may be performed without accessing the data that would be retrieved upon executing the query. Certain embodiments may be adapted to prevent execution of the query and to return the metadata describing the structure of the data structure(s) in the resulting data set. A new “describe” statement can be incorporated into a query language expression and configured to work in a functionally coordinated manner with the API to implement a “describe” function in accordance with the techniques described in this disclosure.

Patent Agency Ranking