Abstract: Versions of a schema may be maintained for application to hierarchical data structures. Updates to include in a new version of a schema may be received. The updates may be evaluated for compatibility with a current version of the schema. Compatible updates may be included in the new version of the schema. Incompatible updates may not be included in the new version of the schema. The new version of the schema may be made available for application to hierarchical data structures inclusive of the compatible updates to the schema.

Abstract: Structured data templates and invocation statements may be used to dynamically define values, which allows for more efficient data encoding than traditional techniques. A given structured data template may be assigned a template identifier. A writer may generate an invocation statement that references a template identifier for a particular structured data template in order to generate a more compact representation of a structured portion of source data (based on the structured data template matching the structured portion of data). The structured data template may specify that any number of the fields is an “unassigned” field. The invocation statement may specify values for these fields, resulting in a more compact representation of the structured portion of data. The use of an invocation statement and a structured data template eliminates the repetitive scaffolding of an object being written out.

Abstract: A system and method for processing of queries including receiving a query including a set operation and a sort operation, wherein the set operation includes a first data structure and a second data structure and the sort operation requests a result set that is sorted based on a column or attribute of the first data structure and a column or attribute of the second data structure; generating a query plan in which a sort operation occurs prior to the set operation; determining a first, partial set of one or more resultant rows responsive to the query; sending the first, partial set of one or more resultant rows responsive to the query to a client; determining a second, partial set of one or more resultant rows responsive to the query; and sending the second, partial set of one or more resultant rows to the client.

Abstract: The invention relates to computer-implemented systems and methods for analyzing and standardizing various types of input data such as structured data, semi-structured data, unstructured data, and images and voice. Embodiments of the systems and the methods further provide for generating responses to specific questions based on the standardized input data.

Abstract: A client electronic device to provide custom functionality for video content playback. The client electronic device includes one or more processors and a non-transitory computer-readable medium having stored therein instructions, which when executed by the one or more processors, causes the client electronic device to receive a streaming manifest file and a first auxiliary manifest file, where the streaming manifest file includes references to video segments of a video content, where the first auxiliary manifest file includes timed metadata associated with the video content, where the streaming manifest file and the first auxiliary manifest file refer to a same timeline, provide the streaming manifest file to a core playback module to play the video content according to the streaming manifest file, and provide custom functionality using the timed metadata included in the first auxiliary manifest file that replaces or augments functionality provided by the core playback module.

Abstract: In some forms containing keywords and content, there may be nested levels of keywords, also referred to as a hierarchy. Content in the forms may be associated with one or more keywords in one or more of the nested levels, or in the hierarchy. Identifying keywords in adjacent cells in a table (with a nested keyword being either to the right of or below another keyword) enables distinguishing between keywords and content in filled forms, and enables correct association of content with respective keywords.

Abstract: A method includes receiving a spreadsheet file representing a plurality of decision tables, wherein the spreadsheet file does not indicate dependencies between non-labeled inputs and non-labeled outputs of the plurality of decision tables. The method further includes, for a first decision table of the plurality of decision tables, identifying, in view of an identifier of a second decision table of the plurality of decision tables, a dependent input that comprises an output of the second decision table of the plurality of decision tables. The method further includes determining, by a processing device, in view of an ordering of columns in the spreadsheet file, remaining inputs and outputs of the first decision table.

Abstract: Provided herein are systems and methods for a stream object configuration, including configuring and processing streams on views. For example, a method includes configuring by at least one hardware processor at a first computing node, a view on a source table for shared access with at least a second computing node. The view includes a query associated with the source table. The query associated with the source table is executed to obtain a plurality of query results. A stream object is generated on the view. The stream object includes the plurality of query results of executing the query and a corresponding plurality of time stamps associated with times the plurality of query results are obtained. The generated stream object is configured for the shared access with at least the second computing node.

Abstract: Disclosed embodiments include a method (system and non-transitory computer-readable medium) for backing up updated portions of a plurality files having hierarchical relationships through object storage. In one or more embodiments, a file is segregated into chunks, and objects corresponding to the chunks are generated for storage at an object storage. For a chunk, an object for storing the chunk and additional objects for storing mapping information are generated. The mapping information may include path information identifying a path of the file in a hierarchical structure, a file version list identifying a version of the file, a chunk list describing an association between the file and the chunks, a chunk version list identifying a version of the chunk, etc. When a portion of the file is updated, objects corresponding to the updated portion of the file can be generated, and stored at the object storage.

Abstract: Systems and methods for entering and storing data. User input defining a data set is received. A data collection construct including a data entry user interface for inputting data in the data set is defined using the user input. A data storage construct including queries for retrieving the data is automatically defined based on the user input. Additional user input indicating modifications to the data set is received. The data collection construct, the data storage construct, and the queries are automatically updated based on the additional user input indicating modifications to the data set.

Abstract: A technique for processing a target program is disclosed. In the technique, execution of a target program handling a data structure object is initiated. In the technique, a synthetic data structure object is created by using a mixed data object instead of handling the data structure object in a manner instructed originally in the target program. The mixed data object includes a first data object and a second data object and is configured to redirect a method call to the second data object in response to the first data object being unable to handle the method call.

Abstract: Techniques of content unification are disclosed. In some example embodiments, a computer-implemented method comprises: determining clusters based a comparison of a plurality of audio content using a first matching criteria, each cluster of the plurality of clusters comprising at least two audio content from the plurality of audio content; for each cluster of the plurality of clusters, determining a representative audio content for the cluster from the at least two audio content of the cluster; loading the corresponding representative audio content of each cluster into an index; matching the query audio content to one of the representative audio contents using a first matching criteria; determining the corresponding cluster of the matched representative audio content; and identifying a match between the query audio content and at least one of the audio content of the cluster of the matched representative audio content based on a comparison using a second matching criteria.

Abstract: Provided herein are systems and methods for configuring managed event tables. A system includes at least one hardware processor coupled to a memory and configured to collect using an event table instance within a sandbox process, log data generated by a UDF during execution of the UDF code. The log data is provided from the sandbox process to an execution node process of the execution node. The log data is formatted using the execution node process, to generate formatted log data. The formatting is based on a configuration of a managed event table that is external to the execution node. The at least one hardware processor further causes ingestion of the formatted log data from the execution node process into the managed event table.

Abstract: A vulnerability-solution resolution (VSR) system is disclosed that is designed to create and maintain associations between vulnerabilities identified by third-party scanners (TPSs) and solutions, such as software patches received from third-party vendors. The VSR system includes a data scheme that enables information regarding vulnerabilities and solutions to be stored, and enables certain relationships to be automatically created between these vulnerabilities and solutions. In particular, the VSR system is designed to automatically form certain relationships between particular vulnerabilities and solutions based on solution supersedence and inheritance. Additionally, the VSR system includes a graphical user interface (GUI) that enables a user to exclude particular relationships from consideration when recommending solutions to resolve a vulnerability or when calculating metrics regarding the vulnerability.

Abstract: Techniques for the automatic creation and maintenance of zone maps are provided. In one technique, a set of data sets is identified. For each data set, a data set width is determined based on a maximum value in the data set and a minimum value in the data set. One or more zones within the data set are identified. For each zone, a zone width is determined based on a difference between a maximum value in that zone and a minimum value in that zone. An aggregate zone width is generated that is based on the zone width of each zone. Based on the data set width and the aggregate zone width, it is determined whether to automatically generate a zone map for the data set.

Abstract: An apparatus is provided for simulation of an asset to train a user to use the asset. The apparatus includes persistent storage to store raw binary data transformable into messages associated with simulation of the asset, and a random access memory (RAM) to store a protocol name, sender identifier and message type of the messages in respective hash tables. These hash tables further include a fourth hash table that maps times of the messages to the raw binary data in the persistent storage. In response to a request for playback of messages from a selected time, the apparatus locates the raw binary data for a message chronologically last in time before the selected time using the four nested hash tables in the RAM, retrieves the raw binary data for the message from its location in the persistent storage medium, and transforms the raw binary data into the message for presentation.

Abstract: Methods and apparatus to search datasets are disclosed. An example disclosed method includes receiving a search request having at least two criteria and assigning the criteria to a first group according to a logical relationship between the criteria. The example method further includes determining which of the criteria in the first group is satisfied by a least amount of records in a database based on a plurality of counts, the counts respectively indicative of a number of corresponding records in the database satisfying a respective one of criteria exhibited by the database, and identifying a reduced set of records in the database to be searched, the reduced set of records corresponding to the first or second criteria that is satisfied by the least amount of records in the database, and reducing a search time associated with the search request by searching the reduced set of records from the database.

Abstract: In some embodiments, a method receives a query to retrieve data from a source table and insert the data into a target table and allocates a size of memory. A portion of the data from the source table is retrieved based on the size of memory and stored in the memory. Then, the method stores the retrieved portion of the data stored in the memory into the target table and continues to retrieve portions of data from the source table in increments based on the size of memory, store the retrieved portions of data in the memory, and store the retrieved portions of data from the memory in the target table until the data from the source table has been inserted into the target table.

Abstract: In various embodiments, a natural language (NL) application implements functionality that enables users to more effectively access various data storage systems based on NL requests. As described, the operations of the NL application are guided by, at least in part, on one or more templates and/or machine-learning models. Advantageously, the templates and/or machine-learning models provide a flexible framework that may be readily tailored to reduce the amount of time and user effort associated with processing NL requests and to increase the overall accuracy of NL application implementations.

Abstract: A unified data store and transaction system queries an n-tuple-based multimodal data structure via a mutable tuple-based interface the mutable tuple-based interface, the interface including a memory controller, and a query operation set. The system receives a tuple from a mutable tuple-based query interface with a tuple-reader and reading the tuple into a tuple object, and evaluates the tuple object against semantic rules via a tuple evaluator.