A system and method for translating questions into database queries are provided. A text to database query system receives a natural language question and a structure in a database. Question tokens are generated from the question and query tokens are generated from the structure in the database. The question tokens and query tokens are concatenated into a sentence and a sentence token is added to the sentence. A BERT network generates question hidden states for the question tokens, query hidden states for the query tokens, and a classifier hidden state for the sentence token. A translatability predictor network determines if the question is translatable or untranslatable. A decoder converts a translatable question into an executable query. A confusion span predictor network identifies a confusion span in the untranslatable question that causes the question to be untranslatable. An auto-correction module to auto-correct the tokens in the confusion span.

A search interface is displayed in a table format that includes one or more columns, each column including data items of an event attribute, the data items being of a set of events, and a plurality of rows forming cells with the one or more columns, each cell including one or more of the data items of the event attribute of a corresponding column. Based on a user selecting one or more of the cells, a list of options if displayed corresponding to the selection, and one or more commands are added to a search query that corresponds to the set of events, the one or more commands being based on at least an option that is selected from the list of options and the event attribute for each of the one or more of the data items of each of the selected one or more cells.

A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, where the master node is the root node in a tree. The master node may distribute query plans and query metadata to other nodes in the cluster. These additional nodes may request additional metadata from each other or the master nodes as necessary.

An analysis system connects to a set of data sources and perform natural language questions based on the data sources. The analysis system connects with the data sources and retrieves metadata describing data assets stored in each data source. The analysis system generates an execution plan for the natural language question. The analysis system finds data assets that match the received question based on the metadata. The analysis system ranks the data assets and presents the ranked data assets to users for allowing users to modify the execution plan. The analysis system may use execution plans of previously stored questions for executing new questions. The analysis system supports selective preprocessing of data to increase the data quality.

A system and a method for digital proof generation are provided. The system includes a data management module to manage dataset having plurality of data rows and a query execution and verification module including a commitment storage sub-module, a query execution sub-module and a result verification sub-module. The data management module receives query from the query execution sub-module, related to operation on data rows of plurality of data rows, which is processed to generate execution result associated with data rows. The execution result is transferred along with data rows to the query execution sub-module. A set of commitments associated with execution result is transferred to the commitment storage sub-module. The query execution sub-module transfers set of commitments, from the commitment storage sub-module, and data rows to the result verification sub-module for verification, and receives a verification result from the result verification sub-module.

An approach is provided for evaluating a performance of a query. A risk of selecting a low performance access path for a query is determined. The risk is determined to exceed a risk threshold. Based on the risk exceeding the risk threshold and using a machine learning optimizer, first costs of access paths for the query are determined. Using a cost-based database optimizer, second costs of the access paths are determined. Using a strong classifier operating on the first costs and the second costs, a final access path for the query is selected from the access paths.

The present disclosure discloses a task processing method and a distributed computing framework. A specific embodiment of the method includes: parsing an expression corresponding to a distributed computing task, and constructing task description information corresponding to the distributed computing task, the task description information being used to describe a corresponding relationship between an operator and a distributed dataset, and the operator acting on at least one of the distributed dataset or distributed datasets obtained by grouping the distributed dataset; determining, based on the task description information, a distributed dataset the operator acting on; and performing distributed computing on the distributed dataset the operator acting on using the operator. In the distributed computing, the acting scope and nesting relationship of the operator is described by constructing a topology.

Disclosed embodiments include a method performed by server computer(s). The method includes receiving a query and defining a query plan based on the received query. The query plan refers to datasets contained in data sources. The method further includes determining that the received query can be accelerated based on an optimized data structure contained in a memory, where the optimized data structure is derived from a dataset referred to in the query plan. The method further includes modifying the query plan to include the optimized data structure, and executing the modified query plan to obtain query results that satisfy the received query by reading the optimized data structure in lieu of reading at least some data from the data sources.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for precisely tracking memory usage in a multi-process computing environment. One of the methods includes implementing an instance of a memory usage tracker (MUT) in each process running in a node of a computer system. A MUT can maintain an account of memory usage for each of multiple logical owners running on a process on which the MUT is running. The MUT can determine an actual memory quota for each owner, and enforce the actual memory quota of the owner. Enforcing the actual memory quota of the owner can include receiving each memory allocation request, checking each allocation request and a current state of the account against the actual quota, approving or rejecting each allocation request, communicating the approval or rejection to an underlying memory manager, and updating the owner account for each approved allocation request.

An attribute information setting section loads information indicating whether or not access to each of a plurality of files is allowed, into a memory. A readout request receiving section receives a readout request including a file path from a program. A hash value deriving section derives a hash value of a file path included in the readout request. A file confirming section confirms whether or not the derived hash value matches with one of hash values of the files included in software. A determining section refers to the information loaded into the memory by the attribute information setting section in a case in which matching of the hash values is confirmed, to thereby determine whether or not a process on the file which has been subjected to the readout request is executable.