According to some embodiments, a system to manage a query plan cache for a Database Management System (“DBMS”) includes a DBMS query plan cache data store. The DBMS query plan cache data store may contain, for example, electronic records representing a plurality of query plans each associated with a set of instructions created in response to a query previously submitted by a user. A DBMS query plan cache management platform may then calculate a utility score for each query plan in the DBMS query plan cache data store. At least one query plan may be evicted from the DBMS query plan cache data store based on the calculated utility score, wherein the evicting is not based on a size of the DBMS query plan cache.

The present disclosure relates to systems, methods, and non-transitory computer-readable media for generating pairs of natural language queries and corresponding query-language representations. For example, the disclosed systems can generate a contextual representation of a prior-generated dialogue sequence to compare with logical-form rules. In some implementations, the logical-form rules comprise trigger conditions and corresponding logical-form actions for constructing a logical-form representation of a subsequent dialogue sequence. Based on the comparison to logical-form rules indicating satisfaction of one or more trigger conditions, the disclosed systems can perform logical-form actions to generate a logical-form representation of a subsequent dialogue sequence. In turn, the disclosed systems can apply a natural-language-to-query-language (NL2QL) template to the logical-form representation to generate a natural language query and a corresponding query-language representation for the subsequent dialogue sequence.

Methods for operation fragmentation with metadata serialization in query processing pushdowns are performed by systems and devices. A compute node receives a query directed to database data, and generates query text fragments. Portions of metadata of the database are read from different page servers, and are serialized by the compute node. Page identities of data pages in a page server that stores the data are determined from a page index at the compute node, and the compute node provides the text fragments, the serialized metadata, and the page identities to the page server storing the data. The page server compiles the text fragments based on the serialized metadata to generate an executable query plan for the query. The page server initializes and performs execution of the executable query plan against the data as a pushdown query operation, and a result of pushdown query operation is provided to the compute node.

Various aspects of this disclosure relate to determining mapping issues in object relational mapping (ORM). An artificial intelligence (AI) model may be trained to identify errors in mapping between relational databases and objects during code compilation. Multiple AI models may be used, with different models being associated with different programming frameworks, thereby making this technique framework agnostic.

Various aspects of this disclosure relate to determining mapping issues in object relational mapping (ORM). An artificial intelligence (AI) model may be trained to identify errors in mapping between relational databases and objects during code compilation. Multiple AI models may be used, with different models being associated with different programming frameworks, thereby making this technique framework agnostic.

A data query for data is received that is associated with a first data node managed by a first executable service and a second data node managed by a second executable service. The data query comprises a subquery that is directed to the second executable service for access to the second data node. From the data query, a selection set is determined. The selection set includes the first data node and the second data node. In view of the selection set, a batch access request is generated to the second executable service that retrieves data for the subquery from the second data node in a single access request.

Methods and systems are provided for searching information in a distributed data processing system. A system for processing a semantic search query where the system may include a memory and a processor coupled to the memory being configured to, receive a structured search query, process the structured search query to deconstruct into query elements, identify a set of connected elements that define a data source associated with the received structured search query based on a processed query element, process the query elements to determine one or more command data element types associated with the received structured search query, and process data associated with the defined data source according to a command data element type to develop a semantic search query resultant data set.

A binary relational database model is described whereby application-layer object structures are easily inferred from database query templates. The object structures take the form of acyclic hypergraphs, which are induced from primal graphs representing query templates. Database applications may iterate through the collection of returned object structures, accessing the data in each structure. The returned object structures are not based on a fixed object model, thereby permitting rich structures with greater applicability than traditional ORM systems. A relationship between non-primitive entities may be directly expressed without the need for alternative join tables. Development and maintenance costs are thus substantially reduced, and data is more efficiently stored and manipulated for database applications.

Electronic communications between a client device and a server device are improved by providing a middleware component that incorporates electronic data read and/or written to a database in a hybrid data structure. The hybrid structure is further designed to allow for “NULL” or other pre-defined data values when one or more data fields are unavailable or erroneous. The client device, in turn, can be configured to check for the pre-defined data values in certain fields and to gracefully process such values. The hybrid structure with pre-defined error values therefore provides for very efficient data transmittal and processing, while retaining the ability to handle errors or other unusual situations relating to the data.

The invention relates to a processing, i.e. storing and analyzing, of measurement data. In order to store the measurement data, respective data units or data sets are created for sampling points, a plurality of measurement data temporally adjacent to the sampling-point measurement datum being stored within the data unit. A time interval between time values of the sampling-point measurement data of two consecutive data units at least is set approximately to a multiple of a sampling time interval, i.e. of a reciprocal of the measurement-value recording rate or sampling rate. The method according to the invention reduces the provision of data units because an individual data unit contains, in addition to a sampling-point measurement date, further measurement data temporally adjacent to the sampling-point measurement date. This measure reduces the management of data sets that is required in a database approximately by a factor which corresponds to the number of measurement data within the data unit designed according to the invention.