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: A computing device for interpreting a data model algorithm includes an object searcher, an interpreter, and a translator. The object searcher is configured to search for attributes within datasets generated from at least one method of an instantiation of the data model algorithm in a development mode workflow. The interpreter is configured to evaluate the attributes, identify attributes having a use type, identify the type information of the identified attribute, and create data schema using the identified attributes and type information. The use type can be determined based on attribute values or an interface type associated with an identified attribute. The translator is configured to compare the data schema with another data schema in response to selecting the data model algorithm for inclusion in a production mode workflow.

Abstract: A system for identifying information in high dimensional, low latency streaming data having dynamically evolving data patterns. The system processes, continuously and in real-time, the streaming data. Processing includes filtering the data based on event data to identify diagnostic data points by comparing the event data with an experimental design matrix and performing a modeling operation using the identified diagnostic data points in order to identify efficiently any current and emerging patterns of relationships between at least one outcome variable and predictor variables. The at least one a-priori, pre-designed experimental design matrix is generated based on combinations of the predictor variables and at least one outcome variable. The experimental design matrix is also generated based on at least one of main effects, limitations, constraints, and interaction effects of the predictor variables and combinations.

Abstract: Embodiments are described for a system and method to analyze data at a plurality of data sources. A data analytic workflow may be received. The data analytic workflow may include at least one operation to be performed on a plurality of data sets stored at a plurality of data sources. Instructions may be created based on the operation to be performed and a type of platform that operates the data sources. Furthermore, the instructions may be transmitted to the data sources such that the data sources may execute the operations on the data sets stored at the data sources.

Abstract: In various aspects, a method, system and computer program product provides for concurrent changes to data of a document or a file by a plurality of users at a plurality of user devices. The documents or file may be rendered in JavaScript™ Object Notation (JSON) format. The documents may be patched or changed by employing new functional operations for applying metadata for elements of the arrays associated with the document or file, and to merge changes from made among the various users. The disclosure provides for maintaining and producing new versions of the document or the file, the changes controlled so that data of the arrays are merged atomically and the updates do not fail permitting simultaneous changes to the document or file by multiple users.

Abstract: A system for identifying information in high dimensional, low latency streaming data having dynamically evolving data patterns. The system processes, continuously and in real-time, the streaming data. Processing includes filtering the data based on event data to identify diagnostic data points by comparing the event data with an experimental design matrix and performing a modeling operation using the identified diagnostic data points in order to identify efficiently any current and emerging patterns of relationships between at least one outcome variable and predictor variables. The at least one a-priori, pre-designed experimental design matrix is generated based on combinations of the predictor variables and at least one outcome variable. The experimental design matrix is also generated based on at least one of main effects, limitations, constraints, and interaction effects of the predictor variables and combinations.

Abstract: An apparatus for estimating analytics and interactive exploration of big data, stored and/or streaming, using approximate query processing is presented. The apparatus comprises a model constructor and a sampler. The model constructor identifies important predictors variables in big data using feature selection, predictor variables, and outcome variables and partitions the important predictor variables into one or more stratifications based either the identified interactions or identified relationships. The sampler generates a subset of data by querying the big data using a query constructed based on at least one stratification. The subset of data can be fed into an analytics generator. The analytics generator generates analytics data for the outcome variables based on the subset of data and an analytics algorithm and a visualization, e.g. an interactive visualization, comprising the outcome variables, the important predictor variables, the stratification, the subset of data, and the analytics data.

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 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: One or more user interactions, selected from a plurality of user interactions, and one or more visualization types, selected from a plurality of visualization types are received. Predetermined visualization data associated with displaying an interactive data analysis document is determined based at least in part on the selected user interactions and the selected visualization types. The predetermined visualization data is output.

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: 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: Methods and systems for performing a query over joined tables in the context of inexact matching provide efficient search engine functionality. The systems and methods are used to perform an efficient query on a parent table and joined child tables. 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: 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: Described is an enterprise-based, contextual network system and method to keep employees connected with one another, as well as to external resources. Current media offers a great way to stay in touch with others but is not cohesive and contextual for businesses or generally productive for businesses. The enterprise media disclosed in this application presents a way for businesses to keep all of their employees and outside resources connected, but in a professional and efficient manner for the workplace. This enterprise media adapts to its users to create an interface that will help the user complete work, connect with others, and use various applications all in one place.