Abstract: In one example, a method performed by a processing system including at least one processor includes automatically inferring metadata about a structured query language database, constructing, based on the metadata, a prompt for generating a new structured query language query to be executed against the structured query language database, and providing the prompt to a language model for use in generating the new structured query language query.

Abstract: A method for transforming structured query language queries to expedite query execution includes detecting an explode operator in a structured query language query plan that is designed to execute a structured query language query against a database, identifying a query fragment within the structured query language query plan that starts with the explode operator and ends with a second operator, and replacing the query fragment in the structured query language query plan with an optimized query fragment in which the second operator operates directly on vectors that are a target of the second operator.

Abstract: A system for transforming data instances between two tree-structured schemas using a collection of bidirectional tree-structured schema modification operations.

Abstract: In one example, a method performed by a processing system including at least one processor includes automatically inferring metadata about a structured query language database, constructing, based on the metadata, a prompt for generating a new structured query language query to be executed against the structured query language database, and providing the prompt to a language model for use in generating the new structured query language query.

Abstract: A method for transforming structured query language queries to expedite query execution includes detecting an explode operator in a structured query language query plan that is designed to execute a structured query language query against a database, identifying a query fragment within the structured query language query plan that starts with the explode operator and ends with a second operator, and replacing the query fragment in the structured query language query plan with an optimized query fragment in which the second operator operates directly on vectors that are a target of the second operator.

Abstract: An exemplary embodiment of the present invention provides an exosuit support system, comprising first and second orthotic interfaces, first and second members, and first and second actuators. The first and second orthotic interfaces can be configured to attach to left and right legs of a user, respectively. The first member can comprise a first end connected to the first orthotic interface and a second end connected to a portion of the system configured to be positioned proximate a right shoulder of the user. The second member can comprise a first end connected to the second orthotic interface and a second end connected to a portion of the system configured to be positioned proximate a left shoulder of the user. The first actuator can be configured to apply a first tension to the first member. The second actuator can be configured to apply a second tension to the second member.

Abstract: Architectures and techniques are presented that can more efficiently update derived data products in response to updated source data. Source data is typically stored in source tables, whereas a materialized view of a query can generate a derived table based on the state of the source tables at the time the query is executed. When source data changes (e.g., in response to late-arriving input data), rather than recomputing the entire derived table (e.g., by again executing the original query, which can be expensive), an invertible relationship between timestamps can be leveraged to identify only those portions of the derived table that are affected by the update. Therefore, a new defining query can be generated to update only those portions of the derived table that are affected by the source data update.

Abstract: Architectures and techniques are presented that can more efficiently update derived data products in response to updated source data. Source data is typically stored in source tables, whereas a materialized view of a query can generate a derived table based on the state of the source tables at the time the query is executed. When source data changes (e.g., in response to late-arriving input data), rather than recomputing the entire derived table (e.g., by again executing the original query, which can be expensive), an invertible relationship between timestamps can be leveraged to identify only those portions of the derived table that are affected by the update. Therefore, a new defining query can be generated to update only those portions of the derived table that are affected by the source data update.

Abstract: A system for transforming data instances between two tree-structured schemas using a collection of bidirectional tree-structured schema modification operations.

Abstract: A system may include a processor, a user input, and memory comprising a graph and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations include receiving, via the user input, a query comprising a class generalization and pathway variables. The operations include identifying a query class based on at least the class generalization and determining an anchor set based on at least one of the pathway variables. The operations also include translating the pathway variables into a pathway algebraic expression based on the anchor set and the query class and executing the pathway algebraic expression on the graph to return a pathway set.

Abstract: Systems and methods utilize a data model database which includes a plurality of symbol data types. Each of the plurality of symbol data types have one or more symbol data fields. The data model database further includes a plurality of concrete data types. Each of the concrete data types have one or more language-agnostic concrete fields associated with each of the one or more symbol data fields. Each of the one or more language-agnostic concrete fields apply one or more concrete constraints to each of the corresponding symbol data fields. The data model database further includes a plurality of carrier data types. The plurality of carrier data types having one or more language-specific carrier fields associated with each of the one or more language-agnostic concrete fields. Each of the one or more language-specific carrier fields apply one or more carrier constraints to each of the corresponding language-agnostic concrete fields.

Abstract: An exemplary embodiment of the present invention provides an exosuit support system, comprising first and second orthotic interfaces, first and second members, and first and second actuators. The first and second orthotic interfaces can be configured to attach to left and right legs of a user, respectively. The first member can comprise a first end connected to the first orthotic interface and a second end connected to a portion of the system configured to be positioned proximate a right shoulder of the user. The second member can comprise a first end connected to the second orthotic interface and a second end connected to a portion of the system configured to be positioned proximate a left shoulder of the user. The first actuator can be configured to apply a first tension to the first member. The second actuator can be configured to apply a second tension to the second member.

Abstract: Methods, systems, and products characterize consistency of data in a stream warehouse. A warehouse table is derived from a continuously received a stream of data. The warehouse table is stored in memory as a plurality of temporal partitions, with each temporal partition storing data within a contiguous range of time. A level of consistency is assigned to each temporal partition in the warehouse table.

Abstract: A system may include a processor, a user input, and memory comprising a graph and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations include receiving, via the user input, a query comprising a class generalization and pathway variables. The operations include identifying a query class based on at least the class generalization and determining an anchor set based on at least one of the pathway variables. The operations also include translating the pathway variables into a pathway algebraic expression based on the anchor set and the query class and executing the pathway algebraic expression on the graph to return a pathway set.

Abstract: A device, method and computer-readable medium for generating unique identification for records in a data streaming processing system are disclosed. A method may collect an identification of a source of a data record, a timestamp of the data record and a count of a number of records a data source has added to the stream with that timestamp, generate a unique identification with the identification of the source of the data record, the timestamp of the data record and the count of the number of records the data source has added to the stream with that timestamp, apply the unique identification to the data record and transmit the data record with the unique identification to a downstream operator within a data stream processing system.

Abstract: A method, computer-readable medium, and device for processing a stream of records are disclosed. A method may receive a registration request from a data source to join in providing a plurality of records to the stream, synchronize a timing system with the data source, receive an initial timestamp from the data source, and post the initial timestamp to a plurality of operators or a plurality of subscribers before the data source is allowed to send records into the stream.

Abstract: A method includes parsing a regular pathway expression into fragments including an anchored fragment and at least one other fragment. A number of the fragments is based on at least a length limitation of the regular pathway expression. The method includes generating an operator directed acyclic graph (DAG) including non-operator nodes, operator nodes, and a root based on at least the anchored fragment. The method includes removing, from the operator DAG, at least one of the non-operator nodes and connecting a first operator node to a second operator node of the operator nodes. The first operator node includes an edge into the at least one removed non-operator node, and the second operator node includes an edge from the at least one removed node. The method includes executing the operator DAG on a graph database to return a pathway set comprising at least one pathway that satisfies the regular pathway expression.

Abstract: A system may include a processor, a user input, and memory comprising a graph and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations include receiving, via the user input, a query comprising a class generalization and pathway variables. The operations include identifying a query class based on at least the class generalization and determining an anchor set based on at least one of the pathway variables. The operations also include translating the pathway variables into a pathway algebraic expression based on the anchor set and the query class and executing the pathway algebraic expression on the graph to return a pathway set.

Abstract: A method includes receiving, via a processor, a query comprising pathway variables and at least one evaluation time and determining an anchor set based on at least one of the pathway variables. The method also includes translating the pathway variables into a pathway algebraic expression based on the anchor set and the at least one evaluation time, and executing the pathway algebraic expression on a graph database to return a pathway set.

Abstract: A system may include a processor, a user input, and memory comprising a graph database and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations include receiving, via the user input, a query comprising a class generalization and pathway variables. The operations include identifying a query class based on at least the class generalization and determining an anchor set based on at least one of the pathway variables. The operations also include translating the pathway variables into a pathway algebraic expression based on the anchor set and the query class and executing the pathway algebraic expression on the graph database to return a pathway set. The class generalization comprises at least one of a component, a class field, or metadata.