Abstract: Disclosed herein are system, method, and computer program product embodiments for maintaining of a geometric object in a database. An embodiment operates by a database maintaining a first page storing a data block in the database's on-disk store such that the data block stores at least one byte of the geometric object. After receiving the request for the geometric object, the database loads the page storing the geometric object in the in-memory store and determines the size of the geometric object. Based on the size of the geometric object, the database stores the geometric object in the in-memory store directly or in a heap of the in-memory store.

Abstract: Disclosed herein are system, method, and computer program product embodiments for maintaining of a geometric object in a database. An embodiment operates by a database maintaining a first page storing a data block in the database's on-disk store such that the data block stores at least one byte of the geometric object. After receiving the request for the geometric object, the database loads the page storing the geometric object in the in-memory store and determines the size of the geometric object. Based on the size of the geometric object, the database stores the geometric object in the in-memory store directly or in a heap of the in-memory store.

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.

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.

Abstract: Disclosed herein are system, method, and computer program product embodiments for maintaining of a geometric object in a database. An embodiment operates by a database maintaining a first page storing a data block in the database's on-disk store such that the data block stores at least one byte of the geometric object. After receiving the request for the geometric object, the database loads the page storing the geometric object in the in-memory store and determines the size of the geometric object. Based on the size of the geometric object, the database stores the geometric object in the in-memory store directly or in a heap of the in-memory store.

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.

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.

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.