Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: obtaining a query statement; parsing the query statement and determining from the parsing that the query statement is a compound predicate query statement that includes a first predicate and a second predicate; responsively to the parsing, rewriting the obtained query statement to provide a transformed query statement, wherein the rewriting includes (a) specifying generating of a temporary table, wherein the specified generating uses data values of the first predicate and (b) specifying a join function that uses the temporary table and a table referenced in the query statement; evaluating a candidate access path associated to the transformed query statement; selecting the candidate access path as an access path for execution; and executing the transformed query statement according to the selected candidate access path for execution.

Methods and apparatus are disclosed for staged query compilation. One or more intermediate plans between a query and its execution plan are stored according to a common specification for plan data structures. Data sources, a plan flow, and annotations can be stored in respective fields of the plan data structure, which can be extended with a field for a serialized execution plan. Plan data structures provide a stable interface for integration of local and external software modules, and decouple plan representation from plan optimization. Use cases are disclosed for integrating offline optimization with inline software modules, for integrating local query handling with external services, for caching intermediate plans, and for archiving plans across version changes of optimizers. A hub architecture flexibly supports numerous compilation workflows. Disclosed technologies are suitable for cloud deployments and for migration of databases into the cloud.

A computer-implemented method that includes generating a graphical user interface including a coding interface and a document viewer interface. The coding interface displays a grid that includes a plurality of cells representing a plurality of documents and a plurality of fields. A selection of one of the cells is received. The cell represents a selected one of the documents, and a selected one of the fields. A rendering of the selected document is automatically displayed in the document viewer interface. A value entered into the selected cell is received and the value is transmitted to a database for storage thereby.

Techniques for associating a selected search result, for a current query, with a recently executed prior query are disclosed. The system receives a first query from a user and presents a first set of search results. The system receives a second query from the user, subsequent to presenting the first set of search results, and presents a second set of search results. The system determines that a user selects a particular search result from the second set of search results. The system determines an association between the first query and the second query. Responsive to determining that the user selected the particular search result and the association between the first query and the second query, the system associates the particular search result with the first query. Subsequently, the system receives a new request for execution of the first query and, in response, presents at least the particular search result.

Distributed pseudo-random subset generation includes obtaining a data-query indicating a first table having a first column including unique values, a second table having a second column including unique values, a join clause joining the first table and the second table on the first column and the second column, and a limit value, pseudo-random filtering the first table to obtain left intermediate data and left filtering criteria, pseudo-random filtering the second table to obtain right intermediate data and right filtering criteria, obtaining intermediate results data by full outer joining the left intermediate data and the right intermediate data, obtaining results data by filtering the intermediate results data using most-restrictive filtering criteria among the left filtering criteria and the right filtering criteria, and outputting the results data, wherein outputting the results data includes limiting the cardinality of rows of the results data to be at most the limit value.

Techniques for configuring query result information associated with query result data include configuring execution of a query using a plurality of execution stages. Query result data is generated based on the execution of the query. The query result data includes a plurality of data portions. Each data portion of the plurality of data portions is obtained at a corresponding execution stage of the plurality of execution stages. Query result information is generated based on the execution of the query. The query result information includes authentication information associated with accessing the plurality of data portions.

Described are methods, systems and computer readable media for providing a current row position query language construct and array processing query language constructs and associated processing.

Despite the increase of memory capacity and CPU computing power, memory performance remains the bottleneck of in-memory database management systems due to ever-increasing data volumes and application demands. Because the scale of data workloads has out-paced traditional CPU caches and memory bandwidth, one can improve data movement from memory to computing units to improve performance in in-memory database scenarios. A near-memory database accelerator framework offloads data-intensive database operations via or to a near-memory computation engine. The database accelerator's system architecture can include a database accelerator software module/driver and a memory module with a database accelerator engine. An application programming interface (API) can be provided to support database accelerator functionality. Memory of the database accelerator can be directly accessible by the CPU.

A database system supporting persistent queries, using an enhanced persistent query service and various data sources. On receiving a request to create a persistent query from a client software application, the persistent query service: creates a query virtual table; parses the persistent query; creates a plurality of intermediate virtual tables; establishes listeners for the query virtual table; creates a plurality of data source virtual tables; causes the plurality of data source virtual tables to retrieve initial data from data sources; and propagates data via intermediate virtual tables to the persistent query virtual table.

A system and method of query processing in a multi-level storage system having a unified table architecture. A query is received by a common query execution engine connected with the unified table architecture, the query specifying a data record. The common query execution engine performs a look-up for the data record based on the query at the first level storage structure. If the data record is not present at the first level storage structure, the common query execution engine performs separate look-ups in each of the second level storage structure and the main store.