Abstract: A system, method, and computer-readable medium for performing a distributed analytics operation. The distributed analytics operation uses interface technologies to de-couple an actual data storage technology from an implementation of distributed analytics. Such a distributed analytics operation obviates requirements to deploy specific computer code onto a data storage platform to specifically target that platform for distributed predictive analytics computations.

Abstract: One or more inputs associated with a selected step of a process flow are modified. The process flow is executed from the selected step based on the modified one or more inputs. A data record associated with selected step is updated to reflect the modified one or more inputs. A process application that includes the process flow is compiled into an executable and deployed to a device.

Abstract: Techniques to store graph information in a database are disclosed. In various embodiments, each node in a graph may be modeled as a micro b-tree. Node identity, attribute, edge, and edge attribute data may be stored in one or more pages modeled on page formats typically used to store index data for a relational database index. Data associated with a plurality of nodes and edges, each of said edges representing a relationship between two or more of said nodes, may be received. For each node, one or more pages of data may be created, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a data structure that includes a variable-sized set of fixed length data slots and a variable-sized variable length data region.

Abstract: Disclosed are systems and method for providing message compression instructions by communicating with a plurality of sender machines and a plurality of receiver machines and monitoring one or more messages from the plurality of sender machines. The disclosed systems and methods may also identify a part of the one or more messages that is frequently included in a plurality of the messages sent by the plurality of sender machines, dynamically determine compression instructions to compress this part of the message, and provide the compression instructions to at least one of the plurality of sender machines, such that the compression instructions reduce size of the messages having the part of the message associated with the compression instructions.

Abstract: Platform-agnostic predictive models based on database management system instructions are described. A system identifies a representation of data transformations associated with a first predictive model that executes on a first computing platform. The system parses the representation of data transformations. The system generates database management system instructions that correspond to the parsed representation of data transformations. The system sends the database management system instructions to a second predictive model that executes on a second computing platform, thereby enabling the second predictive model to execute at least some of the database management system instructions to generate a prediction. The first computing platform and the second computing platform are different types of computing platforms.

Abstract: Techniques are disclosed to operate binary objects across private address spaces. In various embodiments, a shared memory segment is allocated for two address spaces, the first comprising a home address space and the second comprising a target address space. One or more executable modules are loaded in the home address space. One or more program call routines and an environment to schedule system request blocks (SRB) are built in the home address space. The environment to schedule system request blocks is configured to be used to schedule an SRB into the target address space, the SRB comprising information configured to cause the target address space to cause an associated one of the executable modules to execute.

Abstract: Methods, systems, and computer readable media are described herein for processing a query on a parent table and associated child tables to provide efficient search engine functionality. Search grams are determined based on the query and parent records and child records are scanned for the search grams. Gram scores are computed based on a degree of matching between the parent and child records and the search grams.

Abstract: A system, method, and computer-readable medium are disclosed performing an optimization operation. The optimization operation optimizes continuous processes by identifying process states associated with specific ranges for a limited subset of control parameter inputs. In certain embodiments, the optimization operation states comprise clear, stable, and robust process states. Such an optimization operation provides a simpler and cost effective means to optimize continuous processes. Additionally, such an optimization operation is applicable more rapidly to a wider range of real-world operational issues as they occur regularly in continuous process scenarios.

Abstract: A system, method, and computer-readable medium for performing in-database operations, comprising: presenting an automation interface to a user, the user interface automation interface enabling a user to select one or more key performance indicators; instantiating an in-database processing operation, the in-database processing operation performing feature selection from a high dimensional parameter space; executing at least one database statement within the storage system to derive a subset of diagnostic parameters from the high dimensional parameter space.

Abstract: A system, method, and computer-readable medium are disclosed for identifying sources of variation in complex manufacturing processes via a variation identification operation. In certain embodiments, the variation identification operation is performed via a variation identification system. The variation identification operation addresses special class of analytic problems, namely the estimation of variance components and related statistics from very large (big data) hierarchically nested designs of random factors. These types of data structures occur frequently across various industries, and in particular in automated and batch manufacturing where the variability in product quality as measured in final product testing should be related to batches, lots, wafers, suppliers, etc. upstream of the process.

Abstract: Techniques to provide and deploy a business process are disclosed. A business process source filed stored in a memory is received. The business process source file, as stored in memory, is provided as an input to an in-memory compiler. A business process class file stored in the memory is received as output from the in-memory compiler. The business process class file, as stored in memory, is provided to a business process engine class loader.

Abstract: Methods and systems for searching a database for a query using an integrated approach of associating transduced query string comparisons with literal query string comparisons reduces computation time and results in more relevant and accurate results. The methods and systems include a processor receiving a query, searching a database for the query, and providing results of the search. The query may be compared to data entries from the database, and a transduced version of the query may be compared to transduced data entries. Results from the comparisons between the query and the data entries may be used to guide the comparisons between the transduced query and the transduced data entries. Search results are determined based on the guided comparisons.

Abstract: Embodiments are directed to selecting a data transmission path, comprising receiving a query having attribute(s), extracting the attribute(s) from the query, performing a search in a dynamic data structure for target(s) associated with the attribute(s), identifying a first set of target(s), and transmitting a data item to each target of the first set. The method further comprises determining whether the dynamic data structure has transformed from a first state to second state, and when a transformation is determined, performing a second search in the dynamic data structure, identifying a second set of target(s), and transmitting the data item to each target of the second set. The transmitting comprises pushing, to a first target, an option to select the data item, and pushing, to a second target, an option to select the data item when the data item is not selected by the first target.

Abstract: A system, method, and computer-readable medium are disclosed for analysis and characterization of manufacturing information such as process trees or genealogies using graph theory. More specifically, using graph theory to analyze manufacturing information of a manufacturing operation allows for deep analysis of relationships between batches or units in a process tree and their closeness or distance, to identify clusters associated with specific quality characteristics or problems, to identify common antecedents of specifically labeled batches (e.g., problem batches), and/or to detect overall desirable or undesirable characteristics of the process tree (e.g., centrality, etc.).

Abstract: A minimum set of process engine components needed to perform a process application is determined. An executable code that includes the determined minimum set of process engine components and omits at least a subset of process engine components not included in the determined minimum set of process engine components is compiled. The executable code is deployed to a device.

Abstract: An information handling system performs a method for finding a nearest neighbor of a point. In some embodiments, the method may be used for agglomerative clustering. The method includes projecting a space ? of a first dimension with a first distance ? to a space P of a second, smaller dimension with a distance ?? by a projection function p. For all pairs of points v1 and v2 in ?, ?? (p(v1), p(v2))??(v1, v2), where p is the function that projects points in ? to points in P. The method also includes selecting a point v in ? and performing a search for its nearest neighbor in ? by projecting v to P and locating a set S of nearest neighbors in P of p(v). A search is then performed in ? of a set of S? of points that project onto the points in S.

Abstract: Techniques to provide and use modularized XML namespaces are disclosed. In various embodiments, a resolution request associated with a first module is received. A resolution context associated with the first module is used to determine that a component made available by a second module is associated with the resolution request. Access to a shared instance of the component made available by the second module is provided.

Abstract: Disclosed are systems and methods for providing message compression instructions by communicating with a plurality of sender machines and a plurality of receiver machines and monitoring one or more messages from the plurality of sender machines. The disclosed systems and methods may also identify a part of the one or more messages that is frequently included in a plurality of the messages sent by the plurality of sender machines, dynamically determine compression instructions to compress this part of the message, and provide the compression instructions to at least one of the plurality of sender machines, such that the compression instructions reduce size of the messages having the part of the message associated with the compression instructions.

Abstract: Processing a message is disclosed. For each field group applicable to a message from one or more unique field groups of one or more fields identified using one or more content matchers, a compiled message corresponding to the field group applicable to the message is generated. It is determined whether one or more of the compiled messages matches one or more of the one or more content matchers.

Abstract: A system, method, and computer-readable medium for extracting the samples from big data to extract most information about the relationships of interest between dimensions and variables in the data repository. More specifically, extracting information from large data repositories follows an adaptive process that uses systematic sampling procedures derived from optimal experimental designs to target from a large data set specific observations with information value of interest for the analytic task under consideration. The application of adaptive optimal design to guide exploration of large data repositories provides advantages over known big data technologies.