Abstract: A system includes reception of a database query, determination of result set output columns associated with the database query, and determination, for each of the determined result set output columns, of one or more data sources associated with the result set output column. Sensitivity information is determined for each of the one or more data sources based on metadata, and result set sensitivity information is determined based on the determined sensitivity information. A result set is determined based on the database query, and the result set and the result set sensitivity information are transmitted.

Abstract: Systems and methods are provided for generating new insights for multi-dimensional data. A plurality of insight definitions that define insights within multi-dimensional data can be received, where the multi-dimensional data include dimensions organized in a hierarchical structure, and the insight definitions include members across the hierarchical dimensions that define a slice of the multi-dimensional data. Descriptive data about a candidate insight defined by at least one of the insight definitions that corresponds to a candidate slice of the multi-dimensional data can be received. A new insight definition based on the candidate insight can be generated, where the new insight definition corresponds to a new slice of the multi-dimensional data, and the new slice of the multi-dimensional data is proximate to the candidate slice of the multi-dimensional data with respect to the hierarchical structure.

Abstract: the present disclosure relates to systems, methods, and computer-readable media for optimizing and implementing operator trees based on a received query. For example, systems disclosed herein may generate an operator tree based on a received query. The systems described herein may systematically analyze the impact of bitvector filters in optimizing a join order of the operator tree to generate an optimized operator tree. The systems described herein may further implement the bit-vector aware operator tree by providing the optimized operator tree to an execution engine for further processing.

Abstract: Techniques are described herein for subquery removal given two set operation-based subqueries in a query, where one subquery contains the result of the other. The described optimization technique of subquery removal is enabled by join and set operation-based containment of the set operation-based subqueries where semantic equivalence can be established for a given pair of set operation-based subqueries when some table(s)—with associated join condition(s), correlation condition(s), and/or filter predicate(s)—in one subquery are not considered. Subquery removal reduces multiple access to the same table and multiple evaluations of the same join conditions required to evaluate the query. When a subquery is removed from a disjunction, this may lead to other optimizations such as subquery unnesting, e.g., when the original query configuration would not permit query unnesting and the rewritten query (with one or more removed subqueries) permits unnesting.

Abstract: A method, apparatus, system, and computer program code for retrieving data records. A set of static configuration objects is provided, including: a set of resources that describe available data items, and a set of views that express a serialized transformation of resources objects into a response. In response to receiving a data request, a computer system generates a data fetch execution plan from the set of resources and the set of views. The data fetch execution plan is generated using an executor adapted to a particular data store and set of performance requirements. The computer system retrieves the data records according to the data fetch execution plan.

Abstract: The disclosed implementations include a method performed by a data intake and query system. The method includes receiving a search query at a search head, the search query including a branching operation between sets of data, generating a first subquery and a second subquery corresponding to the sets of data for execution by a search node, generating instructions for an intermediary node to combine partial results of the first subquery and the second subquery and instructions to concurrently communicate the subqueries to a search node, and executing the query by providing the instructions for the intermediary node to the intermediary node and the subqueries to the search node, the intermediary node receiving sets of partial search results for the subqueries, performing at least a portion of the branching operation on the partial results, and communicating the combined results to another intermediary node or the search head.

Abstract: Disclosed herein is a computer-implemented method for storing Merkle tree data in memory. The Merkle tree data comprising uncle node data, first nephew node data and second nephew node data. The computer implemented method comprises determining a first nephew node memory address, determining a second nephew node memory address, storing the uncle node data at the uncle node memory address, storing the first nephew node data at the first nephew node memory address, and storing the second nephew node data at the second nephew node memory address. The first nephew node memory address is less than the uncle node memory address and the second nephew node memory address is greater than the uncle node memory address, or the first nephew node memory address is greater than the uncle node memory address and the second nephew node memory address is less than the uncle node memory address.

Abstract: System and methods for presenting updated data using persisting views is disclosed. An example method comprises: identifying a first dataset and a second dataset; tracking updates to rows in each of the first dataset and the second dataset using a first local marker and a second local marker, respectively; performing a join between the first dataset and the second dataset; creating a materialized view using the join; identifying updates to one or more rows of the first dataset and the second dataset; identifying rows in the materialized view corresponding to the one or more rows of the first dataset and the second dataset with the identified updates, and updating, by one or more processing devices, the identified rows in the materialized view based on the identified updates to the one or more rows of the first dataset and the second dataset.

Abstract: Techniques are described for enabling in-memory execution of any-sized graph data query by utilizing both depth first search (DFS) principles and breadth first search (BFS) principles to control the amount of memory used during query execution. Specifically, threads implementing a graph DBMS switch between a BFS mode of data traversal and a DFS mode of data traversal. For example, when a thread detects that there are less than a configurable threshold number of intermediate results in memory, the thread enters BFS-based traversal techniques to increase the number of intermediate results in memory. When the thread detects that there are at least the configurable threshold number of intermediate results in memory, the thread enters DFS mode to produce final results, which generally works to move the intermediate results that are currently available in memory to final query results, thereby reducing the number of intermediate results in memory.

Abstract: A branch of a main database is created, comprising a copy of the main database schema. A user edits the branch and requests that it be merged back into the main database. A schema diff is generated and used to determine differences between the main database and the edited branch. The merge is performed if it does not create a conflict. A second branch is created and edited by a second user. When the second user indicates to merge the second branch back into the main database, differences between the two branches are determined, relative to the main database. If merging the second branch back into the main database on top of the first branch does not create a conflict, a three-way merge is performed of the first branch, the second branch, and the version of the main database from which the first and second branches were generated.

Abstract: Described herein is a computer implemented method. The method comprises generating a subscription identifier based on an original SQL query and determining if a set of first stage query results is associated with the subscription identifier in a cache. If so, the method further comprises generating a second stage SQL query based on a second subset of the plurality of clauses and the set of first stage query results, causing execution of the second stage SQL query to obtain a set of second stage query results from a database, and returning the set of second stage query results.

Abstract: One embodiment included a non-transitory machine-readable medium containing instructions that when executed carry out a method of searching for a search term. The method uses, instead of an index database of search terms, an index database section of only search terms that have the prefix of the search term, such that execution can occur on an improved processing system that is relatively small. The index database section is arranged as a prefix database of terms that start with the prefix, e.g., a trie, a radix trie, or a ternary search tree of the terms. The method may be implemented as a serverless function triggered by a user entering a search term or part thereof.

Abstract: The present disclosure provides an error correction method. The error correction method includes: determining a plurality of target candidate entities from a preset dictionary tree based on a query request; for each target candidate entity, calculating a first probability that the target candidate entity is a legitimate entity; evaluating each target candidate entity to obtain an evaluation result, a target candidate entity corresponding to an evaluation result; and determining a real intent entity corresponding to the query request based on the first probability and the evaluation result.

Abstract: A method if improving the performance of any SQL query in a Massively Parallel Processing (MPP) database platform replicates a query and breaks the query down into its objects so that iterations of the query components may be analyzed for areas affecting performance. The method builds the query from the lowest part of the query (for example, a single database object may be used in the query) and rebuilds the query by iteratively adding more objects along with their related logic (joins, group by clause, select list, etc.). In each iteration, the process analyzes for the underlying causes of lower performance and fixes them.

Abstract: From a first attribute-value pair in a record, new data is created including a first token. Using a first model and using a processor and a memory, each token is vectorized into new data including a corresponding vector. From the record, a target row is selected, wherein a target attribute-value pair in the target row includes a value for which a semantic similarity computation is to be performed. Using a similarity measure, a set of most similar rows to the target row is determined, wherein each row in the set of most similar rows to the target row has a corresponding similarity measure above a threshold similarity measure and wherein each row in the set of most similar rows includes the target attribute. The set of most similar rows is used to compute a response to a database query.

Abstract: Aspects of this disclosure relate to managing hypercubes. A plurality of variables may be received from a user. Features of these variables are identified. A new hypercube data structure is generated. The hypercube is generated by assigning, using the features, a first set of variables of the plurality of variables as one or more row variables of the hypercube, assigning a second set of variables of the plurality of variables as one or more column variables of the hypercube, and assigning a variable of the plurality of variables as a nested variable of the hypercube.

Abstract: Systems and methods for managing regulatory information. The system comprises a submission controller, a registration controller and a submission archive controller. The submission controller may manage a submission structure, and allow users to search for documents in a content management system and add the documents to the submission structure. The registration controller may manage product registration information and health authority interactions globally, and capture, view and take actions upon product registrations. The submission archive controller may allow users to access a complete history of regulatory submissions and correspondence globally, with an easy to use interface. The three controllers reside in a single system that allows them to interact seamlessly with each other.

Abstract: Techniques are disclosed for textual analysis. In an example, a text analysis application constructs a discourse tree that represents rhetorical relationships between fragments of text. The application matches each fragment that has a verb to a verb signature, thereby creating a communicative discourse tree. The application identifies, in the communicative discourse tree, a terminal node including a nucleus elementary discourse unit, which is dominant to a corresponding satellite elementary discourse unit. The application extracts, from the communicative discourse tree, a particular verb signature corresponding to the nucleus elementary discourse unit. The application determines a subject from the verb signature and forms a question fragment from the subject.

Abstract: Embodiments of the invention are directed to a system, method, or computer program product structured for generating resource identification strings to avoid electronic misreads. In some embodiments, the system is structured for generating a new technology resource string of characters, comparing the new string to existing technology resource strings, and determining whether the new string is the same as an existing string. The system is also structured for, in response to determining it is not, for each existing string, pairing characters of the strings and determining whether the strings have at least a threshold number of matching character pairs; if there are, for at least one of the existing strings, determining whether characters of the non-matching pairs are commonly misread characters and determining whether there are a threshold combination of matching/commonly misread pairs; and if there are, discard the new string and generate a second new technology resource string.

Abstract: A data management system includes a data reconciliation engine that identifies data sources that contain data records referencing a resource and determines whether each of the identified data sources is a creative data source or an additive data source. When all of the identified data sources are additive data sources, the reconciliation engine terminates a data reconciliation process. When all of the identified data sources are not additive data sources, the reconciliation engine finds a first creative data source from among the identified data sources, and initiates the data reconciliation process by merging data from the identified data sources including the first creative data source, one data source-by-one data source, into a reconciled data record.