A system and method of performing a cross-datasource query to provide a cross-datasource query result. A composite shape comprises a composite shape query and a plurality of shape identifiers identifying a plurality of shapes. Each of the plurality of shapes comprises a datasource identifier identifying a datasource and a shape query defining a query to be performed on the datasource. The composite shape is used to perform the composite shape query across the datasources identified in the plurality of shapes to provide the cross-datasource query result.

A computer-implemented method includes receiving a query specifying an operation to perform on a first table of a plurality of data blocks stored. Each data block in the first table includes a respective reference count indicating a number of tables referencing the data block. The method also includes determining that the operation specified by the query includes copying the plurality of data blocks in the first table into a second table and, in response, for each data block of the plurality of data blocks in the first table copied into the second table, incrementing, the respective reference count associated with the data block in the first table, appending, by the data processing hardware, into metadata of the second table, a reference of the corresponding data block copied into the second table.

Systems and methods are provided that automatically process a message input, construct an intelligent query based on the processing of the message input, and provide at least one attachable entity according to the processing results and the intelligent query. In some example aspects, a message is received. A natural language processor to determine if the message is requesting content may then process the message. If the message is determined to be requesting content, then candidate sub-queries may be generated to serve as a training set for a query that will be sent to an external search engine to retrieve the attachable entity. The sub-queries may be ranked in order of relevance and performance score. The highest ranked sub-queries may then be used in the actual query that is fired against the external search engine. The external search engine may search local and remote repositories for the top K most relevant attachable entities and present them to a user for attachment in a reply message.

Embodiments as disclosed herein allow simple specification of searches of values within regions and efficient implementation of such searches. Specifically, embodiments as disclosed may provide a search operator that addresses the problem of complex query construction for finding objects having a particular value, including a minimum or a maximum value, in one of a set of regions, and the efficient implementation of the searches specified by such search operators.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for restarting a query using a token. One of the methods includes receiving, by a computer from a requesting device, a query; determining, using a data storage system, a current result responsive to the query; generating, using the current result, a restart token that represents operations performed to determine a plurality of results responsive to the query including the current result responsive to the query and that can be used to determine a new result responsive to the query that was not included in the plurality of results responsive to the query; and providing, to the requesting device, a message that includes a) first data for the restart token that represents operations performed to determine the plurality of results responsive to the query and b) second data for the current result responsive to the query.

Systems and methods are disclosed for receiving, at a data intake and query system, a query that includes an indication to process data managed by a third-party data storage and processing system that supports a different query language than the data intake and query system. The data intake and query system identifies a third-party data storage and processing system that manages the data to be processed and generates a subquery for execution by the third-party data storage and processing system, generates instructions for one or more worker nodes to receive and process results of the subquery from the third-party data storage and processing system, and instructs the worker nodes to provide results of the processing to the data intake and query system.

Techniques for executing operations associated with sub-sets of queries in a set of nested queries are disclosed. A graphical user interface displays individual sub-queries as separate visual representations. Based on detecting a selection, a system executes a selected query in the set of nested queries, without executing parent queries in the set of nested queries. Based on detecting another selection, the system exports a selected query without exporting parent queries of the selected query. The system copies the metadata describing the selected query and transfers the metadata to another set of nested queries. Based on detecting another selection, the system displays a results count for a selected query. The system displays a number representing the number of results returned by the selected query, without displaying the query results.

A data pre-processing architecture may include an interface and a pruning logic configured to receive, via the interface, at least one filter value from a query processor; use the at least one filter value to scan rows or columns of a data table stored in a memory; generate a selection indicator identifying a set of rows or columns of the data table where the at least one filter value resides; and provide to the query processor a filtered output based on the selection indicator.

A method may include generating, based at least on an analysis plan, a logical plan, the analysis plan specifying one or more operations performed on data stored in a polystore that includes a first database management system and a second database management system. The logical plan may include a sequence of logical operators corresponding to the operators specified by the analysis plan. The generating of the logical plan may include rewriting the sequence of logical operators by at least reordering, replacing, and/or combining one or more logical operators in the sequence of logical operators. Candidate physical plans may be generated based on the logical plan. The analysis plan may be executed based on a physical plan selected from the candidate physical plans. Related systems and articles of manufacture are also provided.

A system and method of processing a search request is provided. Identification of a desired content item is based on comparing a topic of the search request to previous user input. The method includes providing access to a set of content items with metadata that describes the corresponding content items and providing information about previous searches. The method further includes receiving a present input from the user and determining a relatedness measure between the information about the previous searches and an element of the present input. If the relatedness measure is high, the method also includes selecting a subset of content items based on comparing the present input and information about the previous searches with the metadata that describes the subset of content items. Otherwise, the method includes selecting a subset of content items based on comparing the present input with the metadata that describes the subset of content items.