Described are methods, systems and computer readable media for dynamic updating of query result displays.

Match rules for rewriting queries to use materialized views may be dynamically generated by a database system. A database system may generate rules that indicate whether a given query can use a materialized view and how to rewrite the given query to use the materialized view. A query may be received and the rules may be applied to the query to determine that the query can use the materialized view and to rewrite the query to use the materialized view. The rewritten query can then be executed.

When a query is received by a stateful data processing service, the service determines, for each table scan (and associated operations) of a query, whether to select the table scan for execution by a stateless data processing service. The selected table scans are sent to the stateless data processing service for execution, and results are received by the stateful data processing service. The stateful data processing service may also execute other table scans of the query locally, against a local data cache. If the data is not present in the local data cache, then the stateful data processing service will copy the table data into the local data cache before executing the table scan. A query result based on the remote and/or local table scans may then be returned to the client.

A cluster view method of a database to perform compaction and clustering of database objects, such as database materialized view is shown. The database can comprise a cache to store changes to storage units of tables of the database objects. The cluster view method can implement clustering to remove data based on the cache and clustering to group the data of the materialized view.

Embodiments are directed are towards the transparent summarization of events. Queries directed towards summarizing and reporting on event records may be received at a search head. Search heads may be associated with one more indexers containing event records. The search head may forward the query to the indexers the can resolve the query for concurrent execution. If a query is a collection query, indexers may generate summarization information based on event records located on the indexers. Event record fields included in the summarization information may be determined based on terms included in the collection query. If a query is a stats query, each indexer may generate a partial result set from previously generated summarization information, returning the partial result sets to the search head. Collection queries may be saved and scheduled to run and periodically update the summarization information.

Described are methods, systems and computer readable media for performance logging of complex query operations.

Described are methods, systems and computer readable media for data source refreshing.

A system and method for efficiently responding to a query. The method comprises generating a lowest level data layer, wherein the lowest level data layer is a common dataset that can be served by a plurality of higher level data layers; generating, based on the lowest level data layer, at least one dataset, wherein each generated dataset is one of the plurality of higher level data layers, wherein each higher level data layer is accessed more rapidly than all lower level data layers; searching, in at least one of the generated data layers, for data needed to generate a response to the query; determining, based on the search, at least one data layer from which the response can be generated, wherein the determined at least one data layer includes the highest level data layer from which the response can be generated; and generating, based on data of the determined at least one data layer, a response to the query.

Systems and methods are described for training a large language model with query auto-completion training data and automatically generating query auto-completion training data in an interactive GUI. A computing system continuously trains and refines a large language model utilizing masking techniques to on complex software-related queries. The computing system is further configured to utilize the large language model to provide complex software-related query suggestions to users operating a graphical user interface real-time.

An approach for implementing function semantic based partition-wise SQL execution and partition pruning in a data processing system is provided. The system receives a query directed to a range-partitioned table and determines if operation key(s) of the query include function(s) over the table partitioning key(s). If so, the system obtains a set of values corresponding to each partition by evaluating the function(s) on a low bound and/or a high bound table partitioning key value corresponding to the partition. The system may then compare the sets of values corresponding to different partitions and determine whether to aggregate results obtained by executing the query over the partitions based on the comparison. The system may also determine whether to prune any partitions from processing based on a set of correlations between the set of values for each partition and predicate(s) of the query including function(s) over the table partitioning key(s).