A method for implementing access controls for items of data belonging to a self-describing data structure including obtaining a query definition specifying a requested item of data in the self-describing data structure, determining domains associated with the requested item, the domains including a set of items within the self-describing data structure on an execution path of a query executed according to the query definition. For each respective domain associated with the requested item, the method includes determining subdomains associated with the requested item, determining a role of the user for the respective domain, the role is associated with a set of access permissions to items of data within the domain, and generating an output corresponding to whether access to the requested item is granted based on a policy for each of the subdomains associated with the requested item and the role of the user for the domain.

A system including a data center hosting a representational state transfer (REST) server in communication with a client network, wherein the REST server includes a GraphQL schema describing tables and fields of a communicatively coupled database. The REST server is configured to: receive a request that includes a GraphQL query; open a streaming connection to the client network; and output a beginning of a response via the streaming connection. The REST server is also configured to process the GraphQL query based on the GraphQL schema to generate a GraphQL result, and to output the GraphQL result in a body of the response via the streaming connection. The REST server is further configured to output an end of the response via the streaming connection, such that the response is correctly formatted in JavaScript Object Notation (JSON).

Techniques support graph pattern matching queries inside a relational database management system (RDBMS) that supports SQL execution. The techniques compile a graph pattern matching query that includes a bounded recursive pattern query into a SQL query that can then be executed by the relational engine. As a result, techniques enable execution of graph pattern matching queries that include bounded recursive patterns on top of the relational engine by avoiding any change in the existing SQL engine.

A method for performing recursive searching of items of a data structure having a data mode includes creating an instance of a query definition, the instance of the query definition comprising a unique identifier, specifying one or more elements of the query definition, providing the query definition as an input to a query engine. The method further includes the operations of determining, by the query engine, query execution instructions based on the query definition, the query instructions specifying a recursive level-by-level search until a terminal node of the data structure is reached, obtaining results of a query executed based on the query execution instructions; and outputting query results.

A method for implementing access controls for items of data belonging to a self-describing data structure including obtaining a query definition specifying a requested item of data in the self-describing data structure, determining domains associated with the requested item, the domains including a set of items within the self-describing data structure on an execution path of a query executed according to the query definition. For each respective domain associated with the requested item, the method includes determining subdomains associated with the requested item, determining a role of the user for the respective domain, the role is associated with a set of access permissions to items of data within the domain, and generating an output corresponding to whether access to the requested item is granted based on a policy for each of the subdomains associated with the requested item and the role of the user for the domain.

Pre-computed query results stored at a database server are re-computed by a computation machine. The pre-computed query results are composed of a plurality of shares. Each share includes a certain number of pre-computed query results. The computation resources of the computation machine needed to re-compute a pre-computed query result of a first share depend on whether or not other pre-computed query results of the first share are re-computed during a given time interval forming a current re-computation cycle. The computation machine receives a request to re-compute pre-computed query results of at least a first share, determines a number of pre-computed query results in the first share to be re-computed in the current re-computation cycle based on a Reinforcement Learning algorithm, and re-computes the determined number of pre-computed query results in the first share.

Provided is a database search device that, when searching an external database, efficiently executes any search command even if the usable search commands are restricted. The database search device comprises: a search command separating unit that separates input search commands into a first search command that can be executed in a prescribed database and a second search command that cannot be executed in the prescribed database; and a search command execution unit that provides the search results obtained by executing the second search command on the search results obtained by executing the first search command in the prescribed database, as the search results for the input search command.

Systems and methods are configured to determine whether a particular information object is a duplicate of an object found in separate information objects. In various embodiments, the particular information object and each separate information object includes a set of data fields for storing data values that allows identical values to be stored in different fields for the objects. The data values for the particular information object are combined to form a data structure that includes a data element for each value. A determination as to whether the particular information object is an exact or partial match of a separate information object is made by performing a function on the data structure for the particular information object and a data structure for the separate information object to identify an intersection that includes data values for the particular information object that have an identical match with values for the separate information object.

Systems and methods are described for unified processing of indexed and streaming data. A system enables users to query indexed data or specify processing pipelines to be applied to streaming data. In some instances, a user may specify a query intended to be run against indexed data, but may specify criteria that includes not-yet-indexed data (e.g., a future time frame). The system may convert the query into a data processing pipeline applied to not-yet-indexed data, thus increasing the efficiency of the system. Similarly, in some instances, a user may specify a data processing pipeline to be applied to a data stream, but specify criteria including data items outside the data stream. For example, a user may wish to apply the pipeline retroactively, to data items that have already exited the data stream. The system can convert the pipeline into a query against indexed data to satisfy the users processing requirements.

Various examples are directed to systems and methods in an analytics computing system. The analytics computing system may receive query data and an indication of a subject tuple. The analytics computing system may access analytics code comprising first proposition data corresponding to the subject tuple. The first proposition data may comprise proposition head data describing the subject tuple and proposition body data describing at least one proposition condition, the at least one proposition condition comprising a relationship between a first proposition body tuple and a second proposition body tuple. The analytics computing system may access query processing data and determine a subset of the query processing data for which the at least one proposition condition is true.