Abstract: According to an example, a system may receive a refresh column command for a column-oriented database. The refresh column command may identify a table in the column-oriented database and a denormalized column in the table. The system may determine column definitions for the column, generate a query to populate values from a data source associated with the column into the column based on the column definitions, and may execute the query to replace entire set of existing column values with the data source values.

Abstract: In an example, a top-k function is associated with a top-k projection for a data storage system. Input data to be loaded into the data storage system is divided and ranked according to the top-k function and stored in the top-k projection.

Abstract: A user-defined function (UDF) is received. Then, execution of the UDF is distributed into a plurality of phases. Lastly, each of the phases is executed separately on a relational database including an aggregate projection that stores an aggregate value calculated from a table column of a table using an aggregate function.

Abstract: According to an example, in a method for managing storage of data from an input table, a projection definition that includes an expression to be executed on data contained in a column of the input table may be accessed. The expression on the data contained in the column of the input table may be executed to obtain results data, which may be stored in an expression projection, in which the expression projection includes a column that provides physical storage for the results data. The results data may be stored in the expression projection, segmented, and encoded. In addition, the expression projection may be stored in a node.

Abstract: In an example, an aggregate function is associated with an aggregate projection for a data storage system. Input data to be loaded into the data storage system is aggregated according to the aggregate function and stored in the aggregate projection.

Abstract: As part of managing the loading of data from a source onto a database, according to an example, an interface through which a user is to define logic related to the loading of the data onto the database is provided. The user-defined logic pertains to at least one of a user-defined location identification of the source, a user-defined filter to be applied on the data, and a user-defined parsing operation to be performed on the data to convert the data into an appropriate format for the database. In addition, the user-defined logic is received and the user-defined logic is implemented to load the data onto the database.

Abstract: According to an example, a system may receive a refresh column command for a column-oriented database. The refresh column command may identify a table in the column-oriented database and a denormalized column in the table. The system may determine column definitions for the column, generate a query to populate values from a data source associated with the column into the column based on the column definitions, and may execute the query to replace entire set of existing column values with the data source values.

Abstract: A method for query processing includes receiving a query, and determining a query type by determining if the query is a structured query language (SQL) query including multiple distinct aggregates (MDAs), or a SQL query including cube, rollup or grouping sets operations. Based on the determination, the method includes processing the query to generate an output, and performing a predetermined number of maximum group by operations on the output based on the query type to generate a response to the query.

Abstract: A user-defined function (UDF) is received. Then, execution of the UDF is distributed into a plurality of phases. Lastly, each of the phases is executed separately on a relational database including an aggregate projection that stores an aggregate value calculated from a table column of a table using an aggregate function.

Abstract: In an example, an aggregate function is associated with an aggregate projection for a data storage system. Input data to be loaded into the data storage system is aggregated according to the aggregate function and stored in the aggregate projection.

Abstract: According to an example, in a method for managing storage of data from an input table, a projection definition that includes an expression to be executed on data contained in a column of the input table may be accessed. The expression on the data contained in the column of the input table may be executed to obtain results data, which may be stored in an expression projection, in which the expression projection includes a column that provides physical storage for the results data. The results data may be stored in the expression projection, segmented, and encoded. In addition, the expression projection may be stored in a node.

Abstract: In an example, a top-k function is associated with a top-k projection for a data storage system. Input data to be loaded into the data storage system is divided and ranked according to the top-k function and stored in the top-k projection.

Abstract: According to an example, in a method for executing a user-defined function on a plurality of database tuples, the user-defined function and an analysis function may be obtained. In addition, the plurality of database tuples may be divided into parts by a processor, the processor may be caused to execute the analysis function on each of the parts, and the processor may be caused to execute the user-defined function on at least one of the parts for which the analysis function returned a true predicate.

Abstract: As part of managing the loading of data from a source onto a database, according to an example, an interface through which a user is to define logic related to the loading of the data onto the database is provided. The user-defined logic pertains to at least one of a user-defined location identification of the source, a user-defined filter to be applied on the data, and a user-defined parsing operation to be performed on the data to convert the data into an appropriate format for the database. In addition, the user-defined logic is received and the user-defined logic is implemented to load the data onto the database.

Abstract: A method for query processing includes receiving a query, and determining a query type by determining if the query is a structured query language (SQL) query including multiple distinct aggregates (MDAs), or a SQL query including cube, rollup or grouping sets operations. Based on the determination, the method includes processing the query to generate an output, and performing a predetermined number of maximum group by operations on the output based on the query type to generate a response to the query.

Abstract: A method for object dependency management for historical access includes assigning versions to states of a structure for storing objects, and assigning the versions to dependency changes between the objects. The method further includes managing historical access to the objects based on an analysis of the versions and the dependency changes between the objects.

Abstract: According to an example, in a method for executing a user-defined function on a plurality of database tuples, the user-defined function and an analysis function may be obtained. In addition, the plurality of database tuples may be divided into parts by a processor, the processor may be caused to execute the analysis function on each of the parts, and the processor may be caused to execute the user-defined function on at least one of the parts for which the analysis function returned a true predicate.

Abstract: A method for executing a user-defined function on a plurality of input database tuples. The method may include causing a processor to invoke the function once; and to compute results of the function for the plurality of database tuples.

Abstract: A method for executing a user-defined function on a plurality of input database tuples. The method may include causing a processor to invoke the function once; and to compute results of the function for the plurality of database tuples.

Abstract: A system, method, and non-transitory computer readable medium are disclosed herein to optimize nested queries. At least one field is associated with each row of data evaluated by at least one nested query. A value is assigned to the at least one field so as to indicate whether each row of data satisfies the at least one nested query. The at least one field associated with each row of data is evaluated to determine satisfaction of the at least one nested query.