Ab Initio Technology LLC

H Mark Bromley

Paul Bay

Marshall A Isman

Craig W Stanfill

Brond Larson

Matthew Darcy Atterbury

Joseph Skeffington Wholey, Iii

Marshall Alan Isman

Wayne Mesard

Ephraim Meriwether Vishniac

Stephen J Schmidt

John L Richardson

Arkadi Popov

Bryan Phil Douros

Daniell Garrick Stevens

Tsvetan Tsvetanov

Joseph Skeffington Wholey

Iii Wholey Joseph Skeffington

Iii Joseph Skeffington Wholey

Iii Josef Skeffington Wholey

Combining specifications of dataflow graphs includes receiving: a first dataflow graph specification that specifies two or more components connected by links representing flows of data, and a second dataflow graph specification that specifies at least one component, and at least one sub-graph interface. The sub-graph interface includes at least one flow junction representing a connection between: (1) a flow of data outside the sub-graph interface, and (2) a flow of data inside the sub-graph interface. The method includes processing information including the first dataflow graph specification and the second dataflow graph specification, to generate a combined dataflow graph specification, including: identifying an association between the sub-graph interface and the first dataflow graph specification, for at least a first flow junction, determining a direction associated with transferring a value of a descriptor, and transferring a value of a descriptor according to the determined direction.

Managing interfaces for sub-graphs

Specifying a dataflow graph includes: rendering, in a first user interface, a representation of a first dataflow graph. At least one component represents a computation associated with at least one of data flowing into an input port or data flowing out of an output port. A link between components is rendered based on user input indicating a flow of data. In a second user interface, a representation of a sub-graph of the first dataflow graph is rendered. A first flow junction represents a connection between: (1) a flow of data outside the sub-graph interface, and (2) a flow of data inside the sub-graph interface. A link is rendered between the first flow junction and a second flow junction based on user input indicating a relationship between a first descriptor and a second descriptor.

Processing data includes: receiving units of work that each include one or more work elements, and processing a first unit of work using a first compiled dataflow graph () loaded into a data processing system () in response to receiving the first unit of work. The processing includes: analysis to determine a characteristic of the first unit of work; identifying one or more compiled dataflow graphs from graphs stored in a data storage system () that include at least some that were compiled for processing a unit of work having the determined characteristic; loading one of the identified compiled dataflow graphs into the data processing system () as the first compiled dataflow graph (); and generating one or more output work elements from at least one work element in the first unit of work.

Dynamically loading graph-based computations

A graph-based computation has a plurality of nodes representing graph components connected by one or more links representing data flows between the components. Preparing the computation includes: identifying at least a first set of components to process a plurality of transactions in the computation; and associating with a first transaction a first group of one or more data records and data operations corresponding to the data records, and associating with a second transaction a second group of one or more data records and data operations corresponding to the data records. Executing the computation to process at least the first and second transactions includes delaying execution by the first set of components of a data operation corresponding to an initial data record of the second group until after execution by the first set of components of a data operation corresponding to a final data record of the first group.

Processing transactions in graph-based applications

A method for managing data includes receiving individually accessible data units, each identified by a key value; storing a plurality of blocks of data, each of at least some of the blocks being generated by combining a plurality of the data units; and providing an index that includes an entry for each of the blocks. One or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value.

Managing storage of individually accessible data units

Growing community of inventors

Lyndeborough, NH, United States of America

H Mark Bromley