Implementations set forth herein relate to conditionally caching responses to automated assistant queries according to certain contextual data that may be associated with each automated assistant query. Each query can be identified based on historical interactions between a user and an automated assistant, and—depending on the query, fulfillment data can be cached according to certain contextual data that influences the query response. Depending on how the contextual data changes, a cached response stored at a client device can be discarded and/or replaced with an updated cached response. For example, a query that users commonly ask prior to leaving for work can have a corresponding assistant response that depends on features of an environment of the users. This unique assistant response can be cached, before the users provide the query, to minimize latency that can occur when network or processing bandwidth is unpredictable.

A system includes reception of a query execution plan associated with a plurality of query execution pipelines, estimated execution costs and estimated intermediate result cardinalities, determination of one or more precedence relationships of the plurality of query execution pipelines, determination of an execution order of the plurality of query execution pipelines based on the estimated execution costs, the estimated intermediate result cardinalities, and the one or more precedence relationships, and providing of the execution order of the plurality of query execution pipelines and the query execution plan to a query execution engine.

Aspects of the disclosure are directed to generating cache configurations for caching data for a database. A database management system (DBMS) can search for column data to cache in a database cache to improve performance of the DBMS in resolving queries. Column data selection can be performed automatically and in the background of a deployed DBMS. Periodically, the DBMS can assess the performance benefit of having certain data cached in the database cache and select data for caching based on the assessed performance benefit. The DBMS can also determine the performance benefit of cached data when not cached, as well as select some portions of data to cache over others. The DBMS can also select data for caching based on different degrees of compression, to further improve query resolution performance.

Aspects of the disclosure are directed to late materialization of attributes in response to queries to a database implementing a database cache. Queried data is materialized in temporary memory before the data is projected as part of generating a result to the query. Instead of materializing all of the attributes referenced in a query before executing the query, a database management system materializes attributes as “late” as possible—when the operation needing the attributes is executed. The operation needing the attributes can be performed sooner, as opposed to materializing all referenced attributes are materialized before executing the query.

The present disclosure includes apparatuses and methods for acceleration of data queries in memory. A number of embodiments include an array of memory cells, and processing circuitry configured to receive, from a host, a query for particular data stored in the array, execute the query, and send only the particular data to the host upon executing the query.

One or more computer processors match a query pattern to a received query; context information related to the received query; retrieve a set of query records including the same context information as the obtained context information from an index knowledge base, wherein each query record in the set of query records include context information related to a respective history query, the query pattern, an index type associated with the query pattern, and performance information relating to the query pattern and the index type; determine that a subset of the retrieved query records includes one or more query patterns equivalent to the matched query pattern; select a query pattern and an associated index type from the subset of query records based on associated performance information in the set of query records; and perform the received query by applying the selected query pattern and the associated index type.

The subject technology receives a query, the query including a set of statements for performing the query. The subject technology populates a compilation context based at least in part the query. The subject technology invokes a compiler to perform a compilation process based on the compilation context. The subject technology performs a lookup operation on a stored plan cache for an exact match based on information from the compilation context. The subject technology, in response to determining an exact match, determines whether the particular query plan requires re-compilation based on a data dependent optimization. The subject technology determines whether a plan cache entry corresponding to the particular query plan includes a data property constraint. The subject technology determines whether the data property constraint still holds based on a set of data properties.

Evaluating stored query results including generating a database query using a state specification of a graphical user interface, wherein the database query is composed to retrieve a current query result from a cloud-based data warehouse; searching a cache local to the query execution engine for the current query result, wherein the cache comprises a first previous query result from the cloud-based data warehouse; determining, based on the searching, that the current query result may be generated using the first previous query result from the cache; and creating the current query result using at least a portion of the first previous query result from the cache.

A topic list is presented to a user. Based upon the topic selection, one or more questions linked to the topic are retrieved automatically. Each question is linked to an optimized search. A topic and question selection from the user is received. The optimized search is retrieved based upon the question selection. Search results are received and presented to the user. The topics, questions and optimized searches are predefined without user input and stored in memory. Also, a handbook with chapters can be provided and updated automatically each time visited by a user without user input. Further, the search results can be automatically displayed in a predefined display format. The format can be predefined before execution of the optimized search by associating each optimized search query with a predesignated area on one or more display pages. Each search result can be associated with a different pixel or set of pixels.

A system and method for generating a data structure for an input query are provided. In example embodiments, the system receives an input query comprising of a plurality of terms. A data structure is generated comprising of a root node and lower level nodes, the root node indicating choices available for the query input, the lower level nodes including a first node with a first term of the input query and a second node with a second term of the input query. The first node is mapped to a first category with a first confidence score indicating a confidence of the mapping of the first node to the first category. The second node is mapped to a second category with a second confidence score indicating a confidence of the mapping of the second node to the second category. The input query is rewritten based on the generated data structure