US10129116B2 - Techniques for capturing execution time data in dataflow graphs - Google Patents

Techniques for capturing execution time data in dataflow graphs Download PDF

Info

Publication number
US10129116B2
US10129116B2 US15/068,432 US201615068432A US10129116B2 US 10129116 B2 US10129116 B2 US 10129116B2 US 201615068432 A US201615068432 A US 201615068432A US 10129116 B2 US10129116 B2 US 10129116B2
Authority
US
United States
Prior art keywords
component
dataflow graph
data
client
server
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US15/068,432
Other versions
US20160248643A1 (en
Inventor
Jennifer M. Farver
Joshua Goldshlag
David W. Parmenter
Ian Robert Schechter
Tim Wakeling
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ab Initio Technology LLC
Original Assignee
Ab Initio Technology LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ab Initio Technology LLC filed Critical Ab Initio Technology LLC
Priority to US15/068,432 priority Critical patent/US10129116B2/en
Assigned to AB INITIO SOFTWARE LLC reassignment AB INITIO SOFTWARE LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GOLDSHLAG, JOSHUA, PARMENTER, DAVID, FARVER, JENNIFER M., SCHECHTER, IAN, WAKELING, TIM
Assigned to AB INITIO ORIGINAL WORKS LLC reassignment AB INITIO ORIGINAL WORKS LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: AB INITIO SOFTWARE LLC
Assigned to AB INITIO TECHNOLOGY LLC reassignment AB INITIO TECHNOLOGY LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: AB INITIO ORIGINAL WORKS LLC
Publication of US20160248643A1 publication Critical patent/US20160248643A1/en
Application granted granted Critical
Publication of US10129116B2 publication Critical patent/US10129116B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0484Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/04Processing captured monitoring data, e.g. for logfile generation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F17/30958
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0481Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0484Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
    • G06F3/04847Interaction techniques to control parameter settings, e.g. interaction with sliders or dials
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/30Creation or generation of source code
    • G06F8/38Creation or generation of source code for implementing user interfaces
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/70Software maintenance or management
    • G06F8/71Version control; Configuration management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/451Execution arrangements for user interfaces
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/90Buffering arrangements
    • H04L49/901Buffering arrangements using storage descriptor, e.g. read or write pointers
    • H04L67/42
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9024Graphs; Linked lists

Definitions

  • This description relates to managing objects using a client-server bridge.
  • Some client-server systems adopt one of two methods of operation. Some systems have a “thin” client, which presents an interface that provides a veneer to the user with very little ability to perform operations independent of the server (for example, an HTML web page). Some systems have a “fat” client that provides an interface capable of performing complex operations, utilizing the resources of the client hardware (for example, a user-interface based on the Microsoft foundation classes). Some “fat” clients are written in the same or similar programming languages as the server application and therefore the client could be tightly coupled to the backend server (for example, Java RMI or Microsoft's COM+ technologies).
  • a method for supporting communication between a client and a server includes receiving a first message from a client.
  • the method also includes creating an object in response to the first message.
  • the method also includes sending a response to the first message to the client.
  • the method also includes receiving changes to the object from a server.
  • the method also includes storing the changes to the object.
  • the method also includes receiving a second message from the client.
  • the method also includes sending the stored changes to the client with a response to the second message.
  • aspects can include one or more of the following features.
  • Methods may also include registering interest in the object with the server.
  • Receiving changes to the object may include receiving changes to the object associated with events generated by the server.
  • Receiving the first message may include utilizing a first protocol, and receiving the changes includes utilizing a second protocol different from the first protocol.
  • Methods may also include storing changes for multiple objects for multiple clients.
  • Receiving the first message can include receiving a request for intermediate data; and creating the object can include: compiling the portion of the dataflow graph, and producing output to an output dataset by executing the compiled portion of the dataflow graph.
  • Creating the object can further include: determining a first set of components required to generate the intermediate data; disabling components in the dataflow graph that are not in the first set of components; and creating an intermediate data sink coupled to the dataflow graph to store the output dataset. Determining the first set of components can include identifying links that do not connect a data source to the intermediate data sink.
  • Creating an intermediate data sink can include: determining that a link to the intermediate data sink represents a parallel data flow; and creating a parallel data sink as the intermediate data sink.
  • a computer-readable medium stores a computer program for supporting communication between a client and a server.
  • the computer program includes instructions for causing a computer to: receive a first message from a client; create an object in response to the first message; send a response to the first message to the client; receive changes to the object from a server; store the changes to the object; receive a second message from the client; and send the stored changes to the client with a response to the second message.
  • a system for supporting communication between a client and a server includes: a server including at least one processor; and a bridge including at least one processor configured to manage objects in the system.
  • the managing includes: receiving a first message from a client, creating an object in response to the first message, sending a response to the first message to the client, receiving changes to the object from the server, storing the changes to the object, receiving a second message from the client, and sending the stored changes to the client with a response to the second message.
  • a system for supporting communication between a client and a server includes: means for serving data; and means for managing objects in the system.
  • the managing includes: receiving a first message from a client, creating an object in response to the first message, sending a response to the first message to the client, receiving changes to the object from the means for serving data, storing the changes to the object, receiving a second message from the client, and sending the stored changes to the client with a response to the second message.
  • a server developed for a robust client may be adapted to support scripting clients. Changes to objects may be tracked and clients may be updated without necessarily maintaining a continual connection between the bridge and the client.
  • FIG. 1 is a schematic diagram of a bridged client server system.
  • FIG. 2 is a schematic diagram of exemplary communication patterns among a client, bridge, and server.
  • FIGS. 3-5 are flowcharts of exemplary operations performed by the system.
  • FIG. 6A is a diagram of an exemplary dataflow graph.
  • FIGS. 6B and 6C are diagrams of portions of an interface for customizing the dataflow graph.
  • FIG. 7A represents an exemplary display of results in the interface.
  • FIG. 7B is a diagram of an example dataflow graph.
  • FIG. 8 is a schematic diagram of a bridged client server system.
  • Some tools enable more functionality on client systems utilizing a browser than would otherwise be available on typical thin clients. Some of these tools are constructed in programming languages which differ from those used to create the server applications.
  • a “bridge” communications layer is established between a client system and a server system, as shown in FIG. 1 .
  • Clients 102 a, 102 b, 102 c are each in communication with a corresponding server session 116 a, 116 b, 116 c running in a server 104 , via a bridge 110 .
  • Messages from the clients 102 a, 102 b, 102 c to the bridge 110 are sent to a message processor 108 that translates the stateless protocol of the clients 102 a, 102 b , 102 c, for example the hypertext transport protocol (HTTP), into the collection of protocols provided by the server 104 .
  • HTTP hypertext transport protocol
  • code generation may be used to automate the conversion.
  • each of the clients, the bridge 110 , and the server 104 are running on a separate processor or computer system and are in communication over a network.
  • the clients 102 a, 102 b, 102 c may be thin clients that rely on the bridge 110 for communication with the server 104 , and there may be other fat clients (not shown) that are able to communicate directly with the server 104 .
  • a single client 102 a connects to a single client session 114 a via the bridge 112 .
  • the bridge may interact with multiple clients simultaneously.
  • the single client session 114 a in turn connects to a single server session 116 a.
  • the message processor 108 creates response objects to package the information that is exchanged, including the response from the server to a message from a client and sends the response object to the appropriate client 102 a, 102 b, 102 c.
  • communication with the bridge 110 or with the server 104 may be load balanced through a load balancer to improve performance.
  • communication between the clients 102 a , 102 b, 102 c and the bridge 110 may include a request and response.
  • the client 120 a , 102 b, 102 c may make a request to the bridge 110 and wait for a response.
  • the bridge 110 may either create a client session 114 a, 114 b, 114 c for the client 102 a, 102 b, 102 c or, if one already exists, use the existing session.
  • the bridge 110 translates the incoming message into a protocol understood by the server 104 .
  • RPCs Remote Procedure Calls
  • data e.g., “byte streams” and “object streams”
  • events e.g., unidirectional messages
  • RPCs operate by sending a request and receiving a response.
  • This basic pattern has three variations: “standalone” RPCs characterized by a process thread waiting or polling for a response without implicit completion or failure notification; “synchronous” RPCs characterized by a process thread blocking until a response indicating success or failure is received; and “asynchronous” RPCs characterized by registering a callback which will be triggered when the procedure completes.
  • RPCs made by a particular thread are guaranteed to be executed in the order they are invoked.
  • Communication between the bridge 110 and the server 104 enables message streams that include RPCs to be interleaved. Multiple different RPC messaging streams may be handled simultaneously causing the messages to arrive at the bridge overlapping with each other.
  • the bridge 110 accepts and processes each message independently.
  • the bridge 110 also permits cancellation or abort message to be sent. When receiving the abort message the bridge 110 terminates a currently running procedure, or notifies the server 104 to terminate a currently running procedure.
  • the bridge 110 and the server 104 may communicate using data streams.
  • Data streams are logical byte streams that employ a windowing protocol to restrict the amount of data that may be transmitted at once.
  • a data stream may be passed between bridge 110 and server 104 as part of an RPC request or response message, a plain message, or a progress message.
  • the data stream is established by a handshake procedure that identifies the stream for the side of the connection that has received the stream object as well as flow-control parameters.
  • the amount of data transmitted over a steam may be limited based on constraints set up by the server 104 or the bridge 110 .
  • a client 202 may maintain a representation of processes and information which may be executed and stored on a server 104 .
  • the client 202 may be made aware of changes which occur in the processes and information on the server 104 .
  • the client 202 may communicate with a bridge 110 .
  • this communication may result from programmatic interactions with the representations of data stored on the client 202 .
  • the bridge 110 receives the request and, represented by process arrows 214 , 216 may communicate with the server 104 .
  • the communications between the bridge 110 and the server 104 may utilize a set of more robust protocols than the communications between the client 202 and the bridge 104 .
  • the server 104 may notify the bridge 110 of changes to an underlying object when a message is not currently being processed.
  • the bridge 110 may register an interest in a given object and the server 104 may notify the bridge 110 when the object is altered or accessed.
  • the stateless nature of communications between the client 202 and the bridge 110 prevent the bridge 110 from communicating the changes immediately to the client 202 .
  • information may be stored on the bridge 110 and delivered to the client 202 as part of the response to a subsequent request.
  • a data stream may be established between a client and a server to allow for continual updating.
  • the client 202 may create a representation of information that does not exist on the server 104 , for example, creating a new customer object. This newly created information may be provided with a temporary identifier. The client 202 may subsequently perform several actions with the new information. In some arrangements, the client 202 may perform operations which utilize both the new information and existing information accessed from the server, sometimes updating existing information using the temporary identifier. The client 202 may perform numerous operations using the information prior to notifying the server 104 . Eventually, the client 202 may send one or more requests to the bridge 110 requesting the operations be executed on the server 104 . The bridge 110 identifies the new information which does not exist on the server 104 .
  • the bridge may create records representing the information on the server and obtain a permanent identifier.
  • the bridge 110 then reconciles the temporary identifier provided on the messages with the permanent identifier.
  • the bridge 110 provides the client 202 a mapping of the temporary identifier to the permanent identifier.
  • a message service managed by the message processor 108 receives an incoming message.
  • the message may specify a plurality of operations which may be performed using a plurality of objects. Some of the objects may already exist while other objects may be new. Generally all objects will be identified using an identifier. Existing objects will be identified using a permanent identifier, while newly created objects will be identified using a temporary identifier.
  • the message service identifies which operations need to be performed.
  • An object service on the bridge 110 identifies which of the objects already exist on the server 104 and retrieves them. For the new information, data is added to the server 104 and a permanent identifier is assigned, the object service provides the mapping between the permanent identifier and the temporary identifier.
  • a flowchart 300 represents an exemplary arrangement of operations performed by the bridge 110 .
  • the operations are executed by one or more processors of a computer system upon which the bridge is resident. While typically executed by a single electronic device, in some arrangements operation execution may be distributed among two or more electronic devices (for example, computer systems).
  • Operations include receiving a message with references 302 .
  • the reference may be a pointer to an object stored in memory, or the reference may be to an identifier which locates an object, for example.
  • the message may reference multiple objects.
  • the references may be provided in a separate list or they may be nested inside the message.
  • Operations also include checking to determine whether an object exists 304 .
  • the bridge may send a message to the server asking if the object exists.
  • operation 304 may be combined with other operations.
  • the bridge may perform an operation to attempt to fetch the object from the server 306 .
  • Specific identifiers may be used to identify new objects, for example, a specific range of keys, a specific key prefix, or another field on the message may indicate that the object is new. The bridge may perform this operation multiple times, once for each object referenced by the message.
  • Operations also include fetching the object 306 .
  • the bridge may fetch the object identified in the message from the server.
  • the bridge may cache a local copy of the object in the local storage.
  • the bridge may check its local storage for the object and if found return a response directly to the client.
  • the local copy of the object may be kept in sync with the copy on the server via back channel communications.
  • the bridge may interact with several servers and may use a routing table to determine on which server the object is located.
  • Operations also include checking to determine whether any updates are pending 308 .
  • the bridge may cache changes made to local copies of objects. These changes may be stored in a specific memory location, a table, or other storage device. The changes may be identified based on an object type and the primary key, or the object may be identified based on a globally unique identifier.
  • Operations also include adding updates to the results 310 .
  • the bridge may compile a list of those updates and attach them to a response message to be delivered to the client.
  • Operations also include creating an object 312 .
  • the bridge creates a new object. This is generally accomplished by sending a message to the server.
  • the newly created object will generally include a new identifier, different from the identifier used by the client.
  • Operations also include creating a mapping 314 .
  • the bridge creates a mapping pairing the client identifier with the permanent identifier provided when creating the object. Once the client becomes aware of the mapping the client no longer uses its original identifier and instead can adopt the permanent identifier for all subsequent communication.
  • Operations also include adding the mapping to results 316 .
  • the bridge adds the mapping onto the response message.
  • Operations also include processing the message 318 .
  • the bridge performs the operation requested. In some implementations, this operation may include sending one or more messages to the server.
  • the messages supported by the bridge are identical to messages supported by the server. In which case, the necessary programming to support the translation of messages between the client and the server may be automatically generated.
  • Operations also include sending the results to the client 320 . For example, once the message is processed the results of that message are combined with any updates and mappings and are returned to the client.
  • a flowchart 400 represents another exemplary arrangement of operations performed by the bridge 110 .
  • the operations are executed by one or more processors of a computer system upon which the bridge is resident. While typically executed by a single electronic device, in some arrangements operation execution may be distributed among two or more electronic devices (for example, computer systems).
  • Operations include receiving a first request from client 402 .
  • a request received from the client may result in the creation or access of one or more objects from the server. These objects may be cached on the bridge in order to improve performance of later access.
  • Operations also include sending results to the client 404 .
  • the response to a request is sent to the client.
  • Objects created or accessed during processing the request may be retained on the bridge in a local data store, for example a memory or a database.
  • one common copy of the object may be stored for all clients who wish to access the object.
  • the objects may be stored along with a client identifier so that each client has an individual copy stored on the bridge.
  • a common copy is stored on the bridge, unless the client modifies the object, in which case an individual version of the objects with the changes is maintained for the client.
  • Operations also include receiving updates to the object 406 .
  • the bridge may receive updates of the object from the server. Updates may be sent from the server through a data stream or event based communication.
  • Operations also include storing updates 408 .
  • the updates received for the object may be stored in a specific location.
  • changes may be stored as an audit trail that list the fields and values which were changed as well as the time the change occurred.
  • the changes may be tracked based on when the bridge was notified of the changes.
  • an entire object may be updated even if only a single value is changed.
  • Operations may also include receiving any number of additional requests from the client that are also handled by the bridge. Updates to objects can be included when providing results of those requests back to the client. This example includes receiving a second request from the client 410 , and adding updates to the results 412 .
  • the bridge may add the changes received from the server to the objects stored on the server onto the response message being sent to the client. In some cases, the bridge may also add any changes that have occurred to the objects as result of processing client's message. Operations also include sending the results to the client 414 .
  • a flowchart 500 represents an exemplary arrangement of operations performed by a client ( FIG. 1, 102 a , 102 b , 102 c ) interacting with a bridge 110 .
  • the operations are executed by one or more processors of a computer system upon which the client is resident. While typically executed by a single electronic device, in some arrangements operation execution may be distributed among two or more electronic devices (for example, computer systems).
  • Operations include sending a message to the bridge 502 .
  • the client may send a message to the bridge requesting that an action be performed related to an object stored on the server.
  • Operations also include receiving a response from the bridge 504 .
  • the client receives a response from the bridge including results of performing the requested action.
  • Operations also include checking for mappings 506 .
  • the client receives a response from the bridge, the client checks if there are any updated mappings attached to the message.
  • the operations include updating references 508 .
  • the client updates the new objects that it had created with temporary identifiers, substituting the permanent identifier assigned by the server for the temporary identifier assigned at the object creation.
  • Operations also include checking for object updates 510 .
  • the client checks the response to see if any existing objects have been updated at the server. If so, the operations include updating the objects 512 at the client. For example, the client may apply the changes included in the message to any local copies of objects that are currently stored at the client.
  • Operations also include processing the results 514 .
  • the response message from the server may convey information to the client that enables the client to take a predetermined action based on the results.
  • the response message may indicate whether the requested operation was successful or whether the operation failed.
  • the response message may also include objects and other information associated with a request. For example, a request to access a specific customer object may result in the customer object being returned in the response.
  • a dataflow graph is a computer program executed within a dataflow graph execution environment that processes data from one or more data sources. The data from the data sources are manipulated and processed according to the dataflow graph and exported to one or more data sinks.
  • Data sources and sinks can include files, databases, data streams, or queues, for example.
  • Dataflow graphs are represented as directed graphs including nodes representing data processing components each including code for processing data from at least one data input and providing data to at least one data output, and nodes representing dataset objects for accessing the data sources and/or sinks.
  • the nodes are connected by directed links representing flows of data between the components, originating at the data sources and terminating at the data sinks.
  • the data output ports of upstream components are connected to the data input ports of downstream components.
  • the dataflow graphs may be reused for different data sources and different data sinks represented by the dataset objects.
  • the data structures and program code used to implement dataflow graphs can support multiple different configurations by being parameterized to enable different sources and sinks to be substituted readily, for example.
  • the flow of the dataflow graph may be altered by the use of parameters, such that a component or a series of components may be bypassed.
  • the execution environment may be hosted on one or more general-purpose computers under the control of a suitable operating system, such as the UNIX operating system.
  • the execution environment can include a multiple-node parallel computing environment including a configuration of computer systems using multiple central processing units (CPUs), either local (e.g., multiprocessor systems such as SMP computers), or locally distributed (e.g., multiple processors coupled as clusters or MPPs), or remotely, or remotely distributed (e.g., multiple processors coupled via a local area network (LAN) and/or wide-area network (WAN)), or any combination thereof.
  • CPUs central processing units
  • LAN local area network
  • WAN wide-area network
  • a dataflow graph can be highly technical in nature in some cases. While written to achieve specific business ends, the underlying structure and construction of the graph is determined based upon technical considerations. For example, graph components may be selected to maximize reusability, or to support parallel processing. On the other hand, how and where a graph is used may be largely a business decision. Some of the parameters associated with a parameterized dataflow graph can be used to enable business users to customize dataflow graphs without requiring the user to understand the technical complexities behind its implementation. The parameterized dataflow graphs simplify customization and facilitate reuse.
  • a dataflow graph 602 may include data sources 606 a, 606 b, components 608 a - c , 610 and data sinks 612 .
  • Each of the sources, components, and sinks may be associated with a set of parameters 604 a - g .
  • a parameter for one source, component, or sink may be used to evaluate a parameter for a different source, component, or sink.
  • the sources 606 a, 606 b are connected to the input ports of components 608 a, 608 c.
  • the output port of component 608 a is connected to the input port of component 608 b.
  • the output port of component 610 is connected to data sink 612 .
  • the connections between the sources, components, and sinks define the data flow.
  • Some of the data sources, components, or sinks may have input parameters 604 a - g which may define some of the behavior of the graph.
  • a parameter may define the location of the data source or sink on a physical disk.
  • a parameter may also define the behavior of a component, for example, a parameter may define how a sorting component sorts the input (for example, sort by zip code).
  • the value of one parameter may depend upon the value of another parameter.
  • a source 606 a may be stored in a file in a particular directory.
  • the parameter set 604 a may include a parameter called “DIRECTORY” and another called “FILENAME”. In this case the FILENAME parameter would depend upon the DIRECTORY parameter.
  • DIRECTORY may be “/usr/local/” and FILENAME may be “/usr/local/input.dat”).
  • Parameters may also depend upon the parameters for other components.
  • the physical location of a sink 612 may depend upon the physical location of the source 606 a.
  • the sink 612 includes a set of parameters 604 g which includes a FILENAME parameter which depends upon the DIRECTORY parameter of the source 606 a.
  • the FILENAME parameter in the set 604 g may be “/usr/local/output.dat” where the value “/usr/local/” is obtained from the DIRECTORY parameter in the set 604 a .
  • the parameters of the parameter sets 604 a - 604 g may be combined and reorganized into different groups for interacting with a user, which reflect business considerations rather than technical ones.
  • the user interface for receiving values for the parameters based on user input can display different parameters according to relationships among the parameters in a flexible way that is not necessarily restricted by aspects of the development environment on the server. For example, referring to FIG. 6B , a user interface can be presented in which icons are displayed with relationships that represent dependencies among the parameters.
  • the parameters are divided into a first group of parameters, represented by a first source icon 624 representing parameters for a first source dataset, a second source icon 626 representing parameters for a second source dataset, a sink icon 630 representing parameters for a sink dataset, and a transformation icon 628 that representing parameters for one or more components of the dataflow graph being configured, showing their relationship to the source datasets and the sink dataset.
  • This grouping of parameters may be made based on a stored specification 622 which defines how a user will interact with the parameters from the dataflow graph within the user interface on the client and how the user interface elements, such as the icons 624 , 626 , 628 , 630 , will be related to each other and arranged for presentation in the user interface.
  • the specification is an XML document.
  • the specification may also identify the dataflow graph components and may identify particular components for which certain functions can be performed while the user is configuring the graph, such as viewing sample data, as described in more detail below.
  • the specification may include instructions for how parameters are to be displayed.
  • the specification 622 may indicate that, in response to interacting with the source dataset icon 624 , one parameter should be displayed as a text box 702 that the user may fill in, while another parameter should be a drop down list 704 with prepopulated values (for example, a list of values provided in the specification, or values provided in a lookup table), still another parameter may be displayed as a radio button 706 , etc.
  • the specification provides flexibility in how the parameters are to be presented to the user for customizing a dataflow graph in a way that can be tailored to a business and/or non-technical user.
  • the specification may include the ability for user to select fields which are processed by a component. Available fields may be displayed in the user interface and the user may select one or more fields for inclusion in the parameter set.
  • the specification may enable the user to filter a dataset by selecting values for specific fields (e.g., where the State is “FL”).
  • the specification may present different parameters based on the role of the user. For example, a template might hide or disable a group of text input controls and links unless the user has a “manager” role.
  • the system may allow a user to run sample data through the graph by initiating execution of the graph on the server from within the user interface, as configured by the parameter values, and to display the results 702 of the sample run to the user in the user interface, as shown in FIG. 7A .
  • the results 702 can be viewed in an appropriate browser or editor of the user interface, depending on what type of data are included in the results 702 .
  • the results 702 include rows that correspond to records within the sample data and columns that correspond to values in the records of for different fields.
  • the execution of the graph on the server using test data can be triggered in response to any of a variety of actions at the client, for example, in response to a user supplying a value for a parameter.
  • a dataflow graph 710 includes data sources 712 , 726 , components 714 , 720 , 728 , and 730 , and the data sink 732 .
  • a user can add watchpoints at any link in the dataflow graph.
  • the user can add watchpoint 722 to a link between component 720 and component 730 .
  • the system detects the watchpoint 722 and generates a modified version of the graph to redirect the flow of data from component 720 to an intermediate data sink 724 that stores data for the watchpoint.
  • the watchpoint 722 is implemented as a replicator allowing data to flow to the intermediate data sink 724 and data component 730 .
  • the system can utilize data from a previous watchpoint to determine data for a subsequent watchpoint. For example, in a previous execution of the graph, the developer added watchpoint 716 to the link between component 714 and component 720 . The data for the watchpoint 716 was stored in the data sink 718 . If in a subsequent execution, the developer adds watchpoint 722 without changing or modifying the data source 712 or the data component 714 the system can use the data in the data sink 718 as a data source for component 720 and consequently may disable data source 712 and component 714 .
  • Graphs can be divided into phases. Components in an earlier phase complete all execution before components in a later phase. For example, if component 730 were in a later phase than component 728 , the data flow from component 728 would be cached until component 728 has completed processing on all the data. Once component 728 completed processing all the data, then component 730 would begin processing the data.
  • the dataflow graph 710 includes components, such as component 734 , that are not connected to other components, for example, lookup tables. Disconnected components are excluded from the dataflow graph if the components is in a later phase than the watchpoints and included in the graph if the components are in the same or an earlier phase than the watchpoint.
  • the bridge 806 sends a message to the server 808 in a format understood by the server 808 , for example a COM+ message.
  • the server 808 receives the message and updates the parameter set.
  • the server 808 send a reply to the bridge 806 containing any changes that occurred to the parameter set due to the input received by the client 802 .
  • the bridge 806 decodes the message and creates a reply message for the client 802 .
  • the bridge 806 sends the reply message to the client 802 .
  • the client 802 updates the user interface 804 to reflect the changes, including displaying any components which were previously hidden due to the failure of a precondition as described above.
  • the server 808 may compile a subset of the dataflow graph, for example, if insufficient parameters are defined to enable the compilation of the complete graph or if the client 802 requests to see the intermediate data for a particular link within the dataflow graph that is being configured by the client 802 .
  • To determine the subset of the dataflow graph to compile and execute the server may use the process described above with respect to FIG. 7B where an intermediate data sink is added for the link being configured instead of for a watchpoint.
  • the resulting data is sent from the server 808 to the client 802 via the bridge 806 .
  • the software may be provided on a storage medium, such as a CD-ROM, readable by a general or special purpose programmable computer or delivered (encoded in a propagated signal) over a communication medium of a network to the computer where it is executed. All of the functions may be performed on a special purpose computer, or using special-purpose hardware, such as coprocessors.
  • the software may be implemented in a distributed manner in which different parts of the computation specified by the software are performed by different computers.
  • Each such computer program is preferably stored on or downloaded to a storage media or device (e.g., solid state memory or media, or magnetic or optical media) readable by a general or special purpose programmable computer, for configuring and operating the computer when the storage media or device is read by the computer system to perform the procedures described herein.
  • a storage media or device e.g., solid state memory or media, or magnetic or optical media
  • the inventive system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer system to operate in a specific and predefined manner to perform the functions described herein.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Human Computer Interaction (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Information Transfer Between Computers (AREA)
  • Stored Programmes (AREA)
  • User Interface Of Digital Computer (AREA)
  • Debugging And Monitoring (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Computer And Data Communications (AREA)

Abstract

A method for supporting communication between a client and a server includes receiving a first message from a client. The method also includes creating an object in response to the first message. The method also includes sending a response to the first message to the client. The method also includes receiving changes to the object from a server. The method also includes storing the changes to the object. The method also includes receiving a second message from the client. The method also includes sending the stored changes to the client with a response to the second message.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims priority under 35 U.S.C. § 120 to U.S. patent application Ser. No. 14/180,628, filed on Feb. 14, 2014, which claims priority under 35 U.S.C. § 120 to U.S. patent application Ser. No. 12/967,533, filed on Dec. 14, 2010 (now U.S. Pat. No. 8,661,154 issued on Feb. 25, 2014), which claims the benefit under U.S.C. § 119(e) to U.S. Provisional Application Ser. No. 61/286,293, filed on Dec. 14, 2009, all of which are incorporated herein by reference.
BACKGROUND
This description relates to managing objects using a client-server bridge.
Some client-server systems adopt one of two methods of operation. Some systems have a “thin” client, which presents an interface that provides a veneer to the user with very little ability to perform operations independent of the server (for example, an HTML web page). Some systems have a “fat” client that provides an interface capable of performing complex operations, utilizing the resources of the client hardware (for example, a user-interface based on the Microsoft foundation classes). Some “fat” clients are written in the same or similar programming languages as the server application and therefore the client could be tightly coupled to the backend server (for example, Java RMI or Microsoft's COM+ technologies).
SUMMARY
In one aspect, in general, a method for supporting communication between a client and a server includes receiving a first message from a client. The method also includes creating an object in response to the first message. The method also includes sending a response to the first message to the client. The method also includes receiving changes to the object from a server. The method also includes storing the changes to the object. The method also includes receiving a second message from the client. The method also includes sending the stored changes to the client with a response to the second message.
Aspects can include one or more of the following features.
Storing the changes may include creating a log of changes and sending the stored changes to the client may include sending the log of changes. Storing the changes may include updating a current state of the object and sending the stored changes to the client may include sending the current state of the object. Receiving the first message from the client may include receiving a temporary identifier for a client object; creating the object includes obtaining a permanent identifier for the object; and sending the response to the first message includes sending a mapping between the temporary identifier and the permanent identifier. Obtaining a permanent identifier may include sending a server message to the server. Sending the server message may include interleaving the server message with other server messages.
Methods may also include registering interest in the object with the server. Receiving changes to the object may include receiving changes to the object associated with events generated by the server. Receiving the first message may include utilizing a first protocol, and receiving the changes includes utilizing a second protocol different from the first protocol. Methods may also include storing changes for multiple objects for multiple clients.
The object can correspond to a portion of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components. Receiving the first message from the client can include receiving a value of a parameter for defining at least one characteristic of a component of the dataflow graph. The method can include providing an interface that receives one or more parameters for defining respective characteristics of components of the dataflow graph. The interface can display multiple user interface elements with relationships among the user interface elements being based on dependencies between components of the dataflow graph. The relationships can be defined by a specification stored on the server.
Receiving the first message can include receiving a request for intermediate data; and creating the object can include: compiling the portion of the dataflow graph, and producing output to an output dataset by executing the compiled portion of the dataflow graph. Creating the object can further include: determining a first set of components required to generate the intermediate data; disabling components in the dataflow graph that are not in the first set of components; and creating an intermediate data sink coupled to the dataflow graph to store the output dataset. Determining the first set of components can include identifying links that do not connect a data source to the intermediate data sink. Creating an intermediate data sink can include: determining that a link to the intermediate data sink represents a parallel data flow; and creating a parallel data sink as the intermediate data sink.
In another aspect, in general, a computer-readable medium stores a computer program for supporting communication between a client and a server. The computer program includes instructions for causing a computer to: receive a first message from a client; create an object in response to the first message; send a response to the first message to the client; receive changes to the object from a server; store the changes to the object; receive a second message from the client; and send the stored changes to the client with a response to the second message.
In another aspect, in general, a system for supporting communication between a client and a server includes: a server including at least one processor; and a bridge including at least one processor configured to manage objects in the system. The managing includes: receiving a first message from a client, creating an object in response to the first message, sending a response to the first message to the client, receiving changes to the object from the server, storing the changes to the object, receiving a second message from the client, and sending the stored changes to the client with a response to the second message.
In another aspect, in general, a system for supporting communication between a client and a server includes: means for serving data; and means for managing objects in the system. The managing includes: receiving a first message from a client, creating an object in response to the first message, sending a response to the first message to the client, receiving changes to the object from the means for serving data, storing the changes to the object, receiving a second message from the client, and sending the stored changes to the client with a response to the second message.
Aspects can include one or more of the following advantages. Communication between a client and a server may be simplified. A server developed for a robust client may be adapted to support scripting clients. Changes to objects may be tracked and clients may be updated without necessarily maintaining a continual connection between the bridge and the client.
Other features and advantages of the invention will become apparent from the following description, and from the claims.
DESCRIPTION OF DRAWINGS
FIG. 1 is a schematic diagram of a bridged client server system.
FIG. 2 is a schematic diagram of exemplary communication patterns among a client, bridge, and server.
FIGS. 3-5 are flowcharts of exemplary operations performed by the system.
FIG. 6A is a diagram of an exemplary dataflow graph.
FIGS. 6B and 6C are diagrams of portions of an interface for customizing the dataflow graph.
FIG. 7A represents an exemplary display of results in the interface.
FIG. 7B is a diagram of an example dataflow graph.
FIG. 8 is a schematic diagram of a bridged client server system.
DESCRIPTION
Some tools enable more functionality on client systems utilizing a browser than would otherwise be available on typical thin clients. Some of these tools are constructed in programming languages which differ from those used to create the server applications. In order to facilitate communication between a client and a server built using different technologies a “bridge” communications layer is established between a client system and a server system, as shown in FIG. 1. Clients 102 a, 102 b, 102 c are each in communication with a corresponding server session 116 a, 116 b, 116 c running in a server 104, via a bridge 110. Messages from the clients 102 a, 102 b, 102 c to the bridge 110 are sent to a message processor 108 that translates the stateless protocol of the clients 102 a, 102 b, 102 c, for example the hypertext transport protocol (HTTP), into the collection of protocols provided by the server 104. In some arrangements, code generation may be used to automate the conversion. In some arrangements, each of the clients, the bridge 110, and the server 104 are running on a separate processor or computer system and are in communication over a network. The clients 102 a, 102 b, 102 c may be thin clients that rely on the bridge 110 for communication with the server 104, and there may be other fat clients (not shown) that are able to communicate directly with the server 104.
Generally, a single client 102 a connects to a single client session 114 a via the bridge 112. The bridge may interact with multiple clients simultaneously. The single client session 114 a in turn connects to a single server session 116 a. The message processor 108 creates response objects to package the information that is exchanged, including the response from the server to a message from a client and sends the response object to the appropriate client 102 a, 102 b, 102 c. However, in some instances other configurations may be used. For example, communication with the bridge 110 or with the server 104 may be load balanced through a load balancer to improve performance.
Represented by arrows 120 a 120 b 120 c, communication between the clients 102 a, 102 b, 102 c and the bridge 110 may include a request and response. The client 120 a, 102 b, 102 c may make a request to the bridge 110 and wait for a response. The bridge 110 may either create a client session 114 a, 114 b, 114 c for the client 102 a, 102 b, 102 c or, if one already exists, use the existing session. The bridge 110 translates the incoming message into a protocol understood by the server 104. Various types of messages that can be transmitted in message streams 124 a, 124 b, 124 c between the bridge 110 and the server 104, including Remote Procedure Calls (RPCs), data (e.g., “byte streams” and “object streams”), and events (e.g., unidirectional messages).
In general, RPCs operate by sending a request and receiving a response. This basic pattern has three variations: “standalone” RPCs characterized by a process thread waiting or polling for a response without implicit completion or failure notification; “synchronous” RPCs characterized by a process thread blocking until a response indicating success or failure is received; and “asynchronous” RPCs characterized by registering a callback which will be triggered when the procedure completes. In some examples, RPCs made by a particular thread are guaranteed to be executed in the order they are invoked.
Communication between the bridge 110 and the server 104 enables message streams that include RPCs to be interleaved. Multiple different RPC messaging streams may be handled simultaneously causing the messages to arrive at the bridge overlapping with each other. The bridge 110 accepts and processes each message independently. The bridge 110 also permits cancellation or abort message to be sent. When receiving the abort message the bridge 110 terminates a currently running procedure, or notifies the server 104 to terminate a currently running procedure.
The bridge 110 and the server 104 may communicate using data streams. Data streams are logical byte streams that employ a windowing protocol to restrict the amount of data that may be transmitted at once. A data stream may be passed between bridge 110 and server 104 as part of an RPC request or response message, a plain message, or a progress message. Once a data stream is passed to the bridge or server, the data stream is established by a handshake procedure that identifies the stream for the side of the connection that has received the stream object as well as flow-control parameters. The amount of data transmitted over a steam may be limited based on constraints set up by the server 104 or the bridge 110.
Referring to FIG. 2, in some arrangements a client 202 may maintain a representation of processes and information which may be executed and stored on a server 104. The client 202 may be made aware of changes which occur in the processes and information on the server 104. Represented by arrows 210, 212 the client 202 may communicate with a bridge 110. In some arrangements, this communication may result from programmatic interactions with the representations of data stored on the client 202. The bridge 110, receives the request and, represented by process arrows 214, 216 may communicate with the server 104. As discussed above, the communications between the bridge 110 and the server 104 may utilize a set of more robust protocols than the communications between the client 202 and the bridge 104. Represented by arrow 224, the server 104 may notify the bridge 110 of changes to an underlying object when a message is not currently being processed. For example, the bridge 110 may register an interest in a given object and the server 104 may notify the bridge 110 when the object is altered or accessed. In some arrangements, the stateless nature of communications between the client 202 and the bridge 110 prevent the bridge 110 from communicating the changes immediately to the client 202. In these circumstances, information may be stored on the bridge 110 and delivered to the client 202 as part of the response to a subsequent request. In other arrangements, a data stream may be established between a client and a server to allow for continual updating.
In some arrangements, the client 202 may create a representation of information that does not exist on the server 104, for example, creating a new customer object. This newly created information may be provided with a temporary identifier. The client 202 may subsequently perform several actions with the new information. In some arrangements, the client 202 may perform operations which utilize both the new information and existing information accessed from the server, sometimes updating existing information using the temporary identifier. The client 202 may perform numerous operations using the information prior to notifying the server 104. Eventually, the client 202 may send one or more requests to the bridge 110 requesting the operations be executed on the server 104. The bridge 110 identifies the new information which does not exist on the server 104. As a result the bridge may create records representing the information on the server and obtain a permanent identifier. The bridge 110 then reconciles the temporary identifier provided on the messages with the permanent identifier. As part of the response, the bridge 110 provides the client 202 a mapping of the temporary identifier to the permanent identifier.
On the bridge 110, a message service managed by the message processor 108 receives an incoming message. In some arrangements, the message may specify a plurality of operations which may be performed using a plurality of objects. Some of the objects may already exist while other objects may be new. Generally all objects will be identified using an identifier. Existing objects will be identified using a permanent identifier, while newly created objects will be identified using a temporary identifier. The message service identifies which operations need to be performed.
An object service on the bridge 110 identifies which of the objects already exist on the server 104 and retrieves them. For the new information, data is added to the server 104 and a permanent identifier is assigned, the object service provides the mapping between the permanent identifier and the temporary identifier.
Referring to FIG. 3, a flowchart 300 represents an exemplary arrangement of operations performed by the bridge 110. Typically the operations are executed by one or more processors of a computer system upon which the bridge is resident. While typically executed by a single electronic device, in some arrangements operation execution may be distributed among two or more electronic devices (for example, computer systems).
Operations include receiving a message with references 302. The reference may be a pointer to an object stored in memory, or the reference may be to an identifier which locates an object, for example. The message may reference multiple objects. The references may be provided in a separate list or they may be nested inside the message.
Operations also include checking to determine whether an object exists 304. In some cases, the bridge may send a message to the server asking if the object exists. In other cases, operation 304 may be combined with other operations. For example, the bridge may perform an operation to attempt to fetch the object from the server 306. Specific identifiers may be used to identify new objects, for example, a specific range of keys, a specific key prefix, or another field on the message may indicate that the object is new. The bridge may perform this operation multiple times, once for each object referenced by the message.
Operations also include fetching the object 306. In some cases, the bridge may fetch the object identified in the message from the server. In other cases, the bridge may cache a local copy of the object in the local storage. Before sending a message to the server, the bridge may check its local storage for the object and if found return a response directly to the client. As discussed above, the local copy of the object may be kept in sync with the copy on the server via back channel communications. In some implementations, the bridge may interact with several servers and may use a routing table to determine on which server the object is located.
Operations also include checking to determine whether any updates are pending 308. In some arrangements, the bridge may cache changes made to local copies of objects. These changes may be stored in a specific memory location, a table, or other storage device. The changes may be identified based on an object type and the primary key, or the object may be identified based on a globally unique identifier.
Operations also include adding updates to the results 310. Once the bridge identifies that updates are pending for an object, the bridge may compile a list of those updates and attach them to a response message to be delivered to the client.
Operations also include creating an object 312. In some cases, if the object does not exist then the bridge creates a new object. This is generally accomplished by sending a message to the server. The newly created object will generally include a new identifier, different from the identifier used by the client.
Operations also include creating a mapping 314. For example, the bridge creates a mapping pairing the client identifier with the permanent identifier provided when creating the object. Once the client becomes aware of the mapping the client no longer uses its original identifier and instead can adopt the permanent identifier for all subsequent communication.
Operations also include adding the mapping to results 316. In some arrangements, in order to communicate the mapping to the client, the bridge adds the mapping onto the response message.
Operations also include processing the message 318. Once the bridge has identified, fetched, and created all necessary objects, the bridge performs the operation requested. In some implementations, this operation may include sending one or more messages to the server. In some implementations, the messages supported by the bridge are identical to messages supported by the server. In which case, the necessary programming to support the translation of messages between the client and the server may be automatically generated.
Operations also include sending the results to the client 320. For example, once the message is processed the results of that message are combined with any updates and mappings and are returned to the client.
Referring to FIG. 4, a flowchart 400 represents another exemplary arrangement of operations performed by the bridge 110. Typically the operations are executed by one or more processors of a computer system upon which the bridge is resident. While typically executed by a single electronic device, in some arrangements operation execution may be distributed among two or more electronic devices (for example, computer systems).
Operations include receiving a first request from client 402. A request received from the client may result in the creation or access of one or more objects from the server. These objects may be cached on the bridge in order to improve performance of later access.
Operations also include sending results to the client 404. In some cases, the response to a request is sent to the client. Objects created or accessed during processing the request may be retained on the bridge in a local data store, for example a memory or a database. In some arrangements, one common copy of the object may be stored for all clients who wish to access the object. In other arrangements, the objects may be stored along with a client identifier so that each client has an individual copy stored on the bridge. In other arrangements, a common copy is stored on the bridge, unless the client modifies the object, in which case an individual version of the objects with the changes is maintained for the client.
Operations also include receiving updates to the object 406. For example, the bridge may receive updates of the object from the server. Updates may be sent from the server through a data stream or event based communication.
Operations also include storing updates 408. In some arrangements, the updates received for the object may be stored in a specific location. In some arrangements, changes may be stored as an audit trail that list the fields and values which were changed as well as the time the change occurred. In other arrangements, the changes may be tracked based on when the bridge was notified of the changes. In still other arrangements, an entire object may be updated even if only a single value is changed. Operations may also include receiving any number of additional requests from the client that are also handled by the bridge. Updates to objects can be included when providing results of those requests back to the client. This example includes receiving a second request from the client 410, and adding updates to the results 412. The bridge may add the changes received from the server to the objects stored on the server onto the response message being sent to the client. In some cases, the bridge may also add any changes that have occurred to the objects as result of processing client's message. Operations also include sending the results to the client 414.
Referring to FIG. 5, a flowchart 500 represents an exemplary arrangement of operations performed by a client (FIG. 1, 102 a, 102 b, 102 c) interacting with a bridge 110. Typically, the operations are executed by one or more processors of a computer system upon which the client is resident. While typically executed by a single electronic device, in some arrangements operation execution may be distributed among two or more electronic devices (for example, computer systems).
Operations include sending a message to the bridge 502. For example, the client may send a message to the bridge requesting that an action be performed related to an object stored on the server.
Operations also include receiving a response from the bridge 504. For example, the client receives a response from the bridge including results of performing the requested action.
Operations also include checking for mappings 506. In some cases, when the client receives a response from the bridge, the client checks if there are any updated mappings attached to the message.
If there are updated mappings, the operations include updating references 508. For example, the client updates the new objects that it had created with temporary identifiers, substituting the permanent identifier assigned by the server for the temporary identifier assigned at the object creation.
Operations also include checking for object updates 510. For example, the client checks the response to see if any existing objects have been updated at the server. If so, the operations include updating the objects 512 at the client. For example, the client may apply the changes included in the message to any local copies of objects that are currently stored at the client.
Operations also include processing the results 514. For example, the response message from the server may convey information to the client that enables the client to take a predetermined action based on the results. The response message may indicate whether the requested operation was successful or whether the operation failed. The response message may also include objects and other information associated with a request. For example, a request to access a specific customer object may result in the customer object being returned in the response.
One example of a system utilizing a bridge is a system for generating a user interface to allow a non-technical user to configure parameterized dataflow graphs. A dataflow graph is a computer program executed within a dataflow graph execution environment that processes data from one or more data sources. The data from the data sources are manipulated and processed according to the dataflow graph and exported to one or more data sinks. Data sources and sinks can include files, databases, data streams, or queues, for example. Dataflow graphs are represented as directed graphs including nodes representing data processing components each including code for processing data from at least one data input and providing data to at least one data output, and nodes representing dataset objects for accessing the data sources and/or sinks. The nodes are connected by directed links representing flows of data between the components, originating at the data sources and terminating at the data sinks. The data output ports of upstream components are connected to the data input ports of downstream components. The dataflow graphs may be reused for different data sources and different data sinks represented by the dataset objects. The data structures and program code used to implement dataflow graphs can support multiple different configurations by being parameterized to enable different sources and sinks to be substituted readily, for example. Furthermore, in some arrangements, the flow of the dataflow graph may be altered by the use of parameters, such that a component or a series of components may be bypassed.
The execution environment may be hosted on one or more general-purpose computers under the control of a suitable operating system, such as the UNIX operating system. For example, the execution environment can include a multiple-node parallel computing environment including a configuration of computer systems using multiple central processing units (CPUs), either local (e.g., multiprocessor systems such as SMP computers), or locally distributed (e.g., multiple processors coupled as clusters or MPPs), or remotely, or remotely distributed (e.g., multiple processors coupled via a local area network (LAN) and/or wide-area network (WAN)), or any combination thereof.
The construction of a dataflow graph can be highly technical in nature in some cases. While written to achieve specific business ends, the underlying structure and construction of the graph is determined based upon technical considerations. For example, graph components may be selected to maximize reusability, or to support parallel processing. On the other hand, how and where a graph is used may be largely a business decision. Some of the parameters associated with a parameterized dataflow graph can be used to enable business users to customize dataflow graphs without requiring the user to understand the technical complexities behind its implementation. The parameterized dataflow graphs simplify customization and facilitate reuse.
An interface for identification of parameter values for constructing a dataflow graph can be presented on a client machine. In some implementations, the client may be accessing a development environment running on a server using a web browser on the client that provides the parameter interface, and using a scripting language which provides some capability for client side processing. The scripting language may communicate with the server to update parameters and perform other necessary operations. This communication may occur via a bridge machine which translates the communications between the client and the server running a development environment storing objects and associated parameter values for the graphs being constructed.
For example, referring to FIG. 6A a dataflow graph 602 may include data sources 606 a, 606 b, components 608 a-c, 610 and data sinks 612. Each of the sources, components, and sinks may be associated with a set of parameters 604 a-g. A parameter for one source, component, or sink may be used to evaluate a parameter for a different source, component, or sink. The sources 606 a, 606 b are connected to the input ports of components 608 a, 608 c. The output port of component 608 a is connected to the input port of component 608 b. The output port of component 610 is connected to data sink 612. The connections between the sources, components, and sinks define the data flow.
Some of the data sources, components, or sinks may have input parameters 604 a-g which may define some of the behavior of the graph. For example, a parameter may define the location of the data source or sink on a physical disk. A parameter may also define the behavior of a component, for example, a parameter may define how a sorting component sorts the input (for example, sort by zip code). In some arrangements, the value of one parameter may depend upon the value of another parameter. For example, a source 606 a may be stored in a file in a particular directory. The parameter set 604 a may include a parameter called “DIRECTORY” and another called “FILENAME”. In this case the FILENAME parameter would depend upon the DIRECTORY parameter. (e.g., DIRECTORY may be “/usr/local/” and FILENAME may be “/usr/local/input.dat”). Parameters may also depend upon the parameters for other components. For example, the physical location of a sink 612 may depend upon the physical location of the source 606 a. In this example, the sink 612 includes a set of parameters 604 g which includes a FILENAME parameter which depends upon the DIRECTORY parameter of the source 606 a. (e.g., the FILENAME parameter in the set 604 g may be “/usr/local/output.dat” where the value “/usr/local/” is obtained from the DIRECTORY parameter in the set 604 a.)
Within the user interface on the client, the parameters of the parameter sets 604 a-604 g may be combined and reorganized into different groups for interacting with a user, which reflect business considerations rather than technical ones. The user interface for receiving values for the parameters based on user input can display different parameters according to relationships among the parameters in a flexible way that is not necessarily restricted by aspects of the development environment on the server. For example, referring to FIG. 6B, a user interface can be presented in which icons are displayed with relationships that represent dependencies among the parameters. In this example, the parameters are divided into a first group of parameters, represented by a first source icon 624 representing parameters for a first source dataset, a second source icon 626 representing parameters for a second source dataset, a sink icon 630 representing parameters for a sink dataset, and a transformation icon 628 that representing parameters for one or more components of the dataflow graph being configured, showing their relationship to the source datasets and the sink dataset. This grouping of parameters may be made based on a stored specification 622 which defines how a user will interact with the parameters from the dataflow graph within the user interface on the client and how the user interface elements, such as the icons 624, 626, 628, 630, will be related to each other and arranged for presentation in the user interface. In some implementations, the specification is an XML document. The specification may also identify the dataflow graph components and may identify particular components for which certain functions can be performed while the user is configuring the graph, such as viewing sample data, as described in more detail below.
In some cases, the specification may include instructions for how parameters are to be displayed. For example, referring to FIGS. 6B and 6C, the specification 622 may indicate that, in response to interacting with the source dataset icon 624, one parameter should be displayed as a text box 702 that the user may fill in, while another parameter should be a drop down list 704 with prepopulated values (for example, a list of values provided in the specification, or values provided in a lookup table), still another parameter may be displayed as a radio button 706, etc. Thus, the specification provides flexibility in how the parameters are to be presented to the user for customizing a dataflow graph in a way that can be tailored to a business and/or non-technical user. For example, a user interface may be populated with values based on queries executed against a database (e.g., a SQL query) or from a file located on a file system. In some cases, the specification may enable the user to select a source of data for the application. For example, the specification may permit a user to select a database, a table, or a file. One or more parameters may be displayed together in groups. For example, the specification may state that parameters are to be presented together in a box on the user interface. In some implementations, the user interface may be divided into columns and rows. The specification may identify the location of the parameter or collection of parameters based on the section of the user interface where the parameters are to be displayed.
In some cases, the specification may include the ability for user to select fields which are processed by a component. Available fields may be displayed in the user interface and the user may select one or more fields for inclusion in the parameter set. The specification may enable the user to filter a dataset by selecting values for specific fields (e.g., where the State is “FL”).
In some cases, the specification may constrain the order in which a business user populates the parameter values. Represented by the dotted lines, parameters associated with the sink 630 may not be visible to the user until the user meets some predefined condition. For example, the user may have to provide a particular parameter value or fill out a set of parameters before the data sink parameter set appears. Parameters may also be defined as required indicating that a value must be assigned to the parameter.
In some cases, the specification may present different parameters based on the role of the user. For example, a template might hide or disable a group of text input controls and links unless the user has a “manager” role. In some implementations, the system may allow a user to run sample data through the graph by initiating execution of the graph on the server from within the user interface, as configured by the parameter values, and to display the results 702 of the sample run to the user in the user interface, as shown in FIG. 7A. The results 702 can be viewed in an appropriate browser or editor of the user interface, depending on what type of data are included in the results 702. In this example, the results 702 include rows that correspond to records within the sample data and columns that correspond to values in the records of for different fields. The execution of the graph on the server using test data can be triggered in response to any of a variety of actions at the client, for example, in response to a user supplying a value for a parameter.
Referring to FIG. 7B, in some implementations, the system can capture data flowing through the system by the addition of watchers. For example, a dataflow graph 710 includes data sources 712, 726, components 714, 720, 728, and 730, and the data sink 732. A user can add watchpoints at any link in the dataflow graph. For example the user can add watchpoint 722 to a link between component 720 and component 730. The system detects the watchpoint 722 and generates a modified version of the graph to redirect the flow of data from component 720 to an intermediate data sink 724 that stores data for the watchpoint. In some implementations, the watchpoint 722 is implemented as a replicator allowing data to flow to the intermediate data sink 724 and data component 730.
In some implementations, the system determines that the components 728, 730 and data source 726 and data sink 732 are not required to generate the data for the watchpoint 722. The system can elect to disable these unnecessary components to conserve system resources. Further, disabling unnecessary components can have the added advantage of simplifying development because the downstream components (for example, component 730) of the unused components (for example, component 728) may not have been fully implemented or configured. In disabling these components the system can execute a portion of the graph without the developer being required to fully configure the entire graph.
In some implementations, the system identifies links that are not required to produce data for the watchpoint. For example, the system can identify links that do not connect any source (for example, the data source 712) to the intermediate data sink 724. The components which provide data to these links can be removed.
In some implementations, the system can utilize data from a previous watchpoint to determine data for a subsequent watchpoint. For example, in a previous execution of the graph, the developer added watchpoint 716 to the link between component 714 and component 720. The data for the watchpoint 716 was stored in the data sink 718. If in a subsequent execution, the developer adds watchpoint 722 without changing or modifying the data source 712 or the data component 714 the system can use the data in the data sink 718 as a data source for component 720 and consequently may disable data source 712 and component 714.
The system can detect if the data flow is a normal flow or a parallel flow. Parallel flows are data flows which have been partitioned. Watchpoints on parallel flow use a separate data sink for each flow of data. For example, a parallel data flow which had been partitioned into six separate partitions would generate watch data in six separate data sinks.
Graphs can be divided into phases. Components in an earlier phase complete all execution before components in a later phase. For example, if component 730 were in a later phase than component 728, the data flow from component 728 would be cached until component 728 has completed processing on all the data. Once component 728 completed processing all the data, then component 730 would begin processing the data. In some scenarios, the dataflow graph 710 includes components, such as component 734, that are not connected to other components, for example, lookup tables. Disconnected components are excluded from the dataflow graph if the components is in a later phase than the watchpoints and included in the graph if the components are in the same or an earlier phase than the watchpoint.
Referring to FIG. 8, a client system 802 may be displaying the user interface 804 described above the user. The parameter set 814 generated based on interactions with the user through the user interface 804 may be stored on a server 808. Consequently, changes made by the user interface 804 are sent from the client 802 to the server 808 via a bridge 806. Represented by arrow 820, the client 802 sends a message to the bridge 806 in one format, for example a message sent using the simple object access protocol (SOAP). The bridge 806 translates the message into a new format and if necessary begins a client session with the server 808. Represented by arrow 822, the bridge 806 sends a message to the server 808 in a format understood by the server 808, for example a COM+ message. The server 808 receives the message and updates the parameter set. Represented by arrow 824, the server 808 send a reply to the bridge 806 containing any changes that occurred to the parameter set due to the input received by the client 802. The bridge 806 decodes the message and creates a reply message for the client 802. Represented by arrow 826, the bridge 806 sends the reply message to the client 802. The client 802 updates the user interface 804 to reflect the changes, including displaying any components which were previously hidden due to the failure of a precondition as described above.
The user may also indicate to the client 802 that he wishes to execute the graph being constructed using sample data based on the current set of parameters, which may or may not be complete. As above, the client 802 sends a message to the server 808 via the bridge 806. The server 808 applies any changes to the parameter set and a process 816 running on the server compiles the dataflow graph. The server executes the compiled dataflow graph, which accepts data from the sample datasets 810, 812. The executed dataflow graph produces the requested output to an output dataset 818. The output of the dataflow graph is the intermediate data requested by the client 802 and not necessarily the data which would be produced by complete execution of the dataflow graph.
In some implementations, the server 808 may compile a subset of the dataflow graph, for example, if insufficient parameters are defined to enable the compilation of the complete graph or if the client 802 requests to see the intermediate data for a particular link within the dataflow graph that is being configured by the client 802. To determine the subset of the dataflow graph to compile and execute the server may use the process described above with respect to FIG. 7B where an intermediate data sink is added for the link being configured instead of for a watchpoint.
As described above, the resulting data is sent from the server 808 to the client 802 via the bridge 806.
The object management approach described above can be implemented using software for execution on a computer. For instance, the software forms procedures in one or more computer programs that execute on one or more programmed or programmable computer systems (which may be of various architectures such as distributed, client/server, or grid) each including at least one processor, at least one data storage system (including volatile and non-volatile memory and/or storage elements), at least one input device or port, and at least one output device or port. The software may form one or more modules of a larger program, for example, that provides other services related to the design and configuration of computation graphs. The nodes and elements of the graph can be implemented as data structures stored in a computer readable medium or other organized data conforming to a data model stored in a data repository.
The software may be provided on a storage medium, such as a CD-ROM, readable by a general or special purpose programmable computer or delivered (encoded in a propagated signal) over a communication medium of a network to the computer where it is executed. All of the functions may be performed on a special purpose computer, or using special-purpose hardware, such as coprocessors. The software may be implemented in a distributed manner in which different parts of the computation specified by the software are performed by different computers. Each such computer program is preferably stored on or downloaded to a storage media or device (e.g., solid state memory or media, or magnetic or optical media) readable by a general or special purpose programmable computer, for configuring and operating the computer when the storage media or device is read by the computer system to perform the procedures described herein. The inventive system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer system to operate in a specific and predefined manner to perform the functions described herein.
A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. For example, some of the steps described above may be order independent, and thus can be performed in an order different from that described.
It is to be understood that the foregoing description is intended to illustrate and not to limit the scope of the invention, which is defined by the scope of the appended claims. For example, a number of the function steps described above may be performed in a different order without substantially affecting overall processing. Other embodiments are within the scope of the following claims.

Claims (14)

What is claimed is:
1. A method of operating a computer to provide information on execution processing operations specified by a dataflow graph, the dataflow graph including components representing operations performed on data and links representing flows of data between the components, the components comprising a first component, one or more components upstream of the first component and one or more components downstream of the first component, the method comprising:
receiving an instruction to create a watchpoint associated with a link of the dataflow graph, the link representing a flow of data from the first component of the dataflow graph;
generating, based at least in part on the created watchpoint, a second version of the dataflow graph that includes the first component, the upstream components and a second component, the second component configured to perform a monitoring function relating to execution of the dataflow graph based on data output from the first component; and
executing at least a portion of the second version of the dataflow graph, the at least a portion of the second version of the dataflow graph including the first component, the second component and at least one of the upstream components, the at least a portion of the second version of the dataflow graph not including at least one of the downstream components.
2. The method of claim 1, wherein the monitoring function comprises storing data output from the first component.
3. The method of claim 1, wherein the second component is configured to replicate data output from the first component.
4. The method of claim 1, wherein the second component is configured to store the data that is output by the first component.
5. The method of claim 1, wherein at least one of the components of the dataflow graph is less than fully configured.
6. The method of claim 5, wherein the at least one less than fully configured component of the dataflow graph is downstream from the first component.
7. The method of claim 5, wherein each component of the dataflow graph is associated with one or more parameters, and the at least one less than fully configured component of the dataflow graph is associated with a parameter that does not have a value assigned to it.
8. The method of claim 1, wherein the link of the dataflow graph represents a parallel data flow.
9. The method of claim 1, further comprising identifying one or more links of the dataflow graph that do not connect any data sources to the first component.
10. The method of claim 9, further comprising excluding components connected to the identified one or more links of the dataflow graph from being included in the modified dataflow graph.
11. A method of operating a computer to provide information on execution processing operations specified by a program, the program configured to perform a plurality of operations, the operations comprising a first operation, one or more operations upstream of the first operation and one or more operations downstream of the first operation, the method comprising:
receiving an instruction to create a watchpoint corresponding to a location in the program, the location in the program being subsequent to the first operation of the program;
generating, based at least in part on the created watchpoint, a second version of the program that includes the first operation, the upstream operations and a second operation, the second operation configured to perform a monitoring function relating to execution of the program based on data output by the first operation; and
executing at least a portion of the second version of the program, the at least a portion of the second version of the program including the first operation, the second operation and at least one of the upstream operations, the at least a portion of the second version of the program not including at least one of the downstream operations.
12. The method of claim 11, wherein the monitoring function comprises storing data output from the first operation.
13. The method of claim 11, wherein the second operation replicates data output by the first operation.
14. The method of claim 13, wherein the replicated data is written to a computer readable storage medium.
US15/068,432 2009-12-14 2016-03-11 Techniques for capturing execution time data in dataflow graphs Active 2031-10-30 US10129116B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/068,432 US10129116B2 (en) 2009-12-14 2016-03-11 Techniques for capturing execution time data in dataflow graphs

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US28629309P 2009-12-14 2009-12-14
US12/967,533 US8661154B2 (en) 2009-12-14 2010-12-14 Managing objects using a client-server bridge
US14/180,628 US20140164495A1 (en) 2009-12-14 2014-02-14 Managing objects using a client-server bridge
US15/068,432 US10129116B2 (en) 2009-12-14 2016-03-11 Techniques for capturing execution time data in dataflow graphs

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US14/180,628 Continuation US20140164495A1 (en) 2009-12-14 2014-02-14 Managing objects using a client-server bridge

Publications (2)

Publication Number Publication Date
US20160248643A1 US20160248643A1 (en) 2016-08-25
US10129116B2 true US10129116B2 (en) 2018-11-13

Family

ID=43640108

Family Applications (4)

Application Number Title Priority Date Filing Date
US12/959,985 Active US10845962B2 (en) 2009-12-14 2010-12-03 Specifying user interface elements
US12/967,533 Active 2031-02-04 US8661154B2 (en) 2009-12-14 2010-12-14 Managing objects using a client-server bridge
US14/180,628 Abandoned US20140164495A1 (en) 2009-12-14 2014-02-14 Managing objects using a client-server bridge
US15/068,432 Active 2031-10-30 US10129116B2 (en) 2009-12-14 2016-03-11 Techniques for capturing execution time data in dataflow graphs

Family Applications Before (3)

Application Number Title Priority Date Filing Date
US12/959,985 Active US10845962B2 (en) 2009-12-14 2010-12-03 Specifying user interface elements
US12/967,533 Active 2031-02-04 US8661154B2 (en) 2009-12-14 2010-12-14 Managing objects using a client-server bridge
US14/180,628 Abandoned US20140164495A1 (en) 2009-12-14 2014-02-14 Managing objects using a client-server bridge

Country Status (8)

Country Link
US (4) US10845962B2 (en)
EP (2) EP2513782A1 (en)
JP (4) JP6084037B2 (en)
KR (2) KR101862235B1 (en)
CN (3) CN102754072B (en)
AU (3) AU2010337218B2 (en)
CA (3) CA2782414C (en)
WO (2) WO2011081776A1 (en)

Families Citing this family (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2399192A4 (en) 2009-02-13 2016-09-07 Ab Initio Technology Llc Communicating with data storage systems
CA2782414C (en) 2009-12-14 2021-08-03 Ab Initio Technology Llc Specifying user interface elements
US9141403B2 (en) * 2011-02-15 2015-09-22 Microsoft Technology Licensing, Llc Data-driven schema for describing and executing management tasks in a graphical user interface
US20150135010A1 (en) * 2011-09-07 2015-05-14 Scott Thomas MacQuarrie High availability system, replicator and method
US8782595B1 (en) * 2011-10-06 2014-07-15 Google Inc. Systems and methods for rule based meta-programming of actions for rule based build systems
US10346422B2 (en) * 2012-10-18 2019-07-09 International Business Machines Corporation Use of proxy objects for integration between a content management system and a case management system
US20140114864A1 (en) * 2012-10-22 2014-04-24 International Business Machines Corporation Case management integration with external content repositories
US9811233B2 (en) * 2013-02-12 2017-11-07 Ab Initio Technology Llc Building applications for configuring processes
US11061539B2 (en) * 2013-03-15 2021-07-13 The Mathworks, Inc. Reference nodes in a computational graph
CA2932763C (en) 2013-12-05 2022-07-12 Ab Initio Technology Llc Managing interfaces for dataflow graphs composed of sub-graphs
US10067652B2 (en) * 2013-12-24 2018-09-04 Dropbox, Inc. Providing access to a cloud based content management system on a mobile device
US9423922B2 (en) * 2013-12-24 2016-08-23 Dropbox, Inc. Systems and methods for creating shared virtual spaces
US9575639B2 (en) 2014-02-27 2017-02-21 Ab Initio Technology Llc Compound controls
US9607073B2 (en) * 2014-04-17 2017-03-28 Ab Initio Technology Llc Processing data from multiple sources
US9766789B1 (en) * 2014-07-07 2017-09-19 Cloneless Media, LLC Media effects system
SG11201701667WA (en) * 2014-09-02 2017-04-27 Ab Initio Technology Llc Visually specifying subsets of components in graph-based programs through user interactions
US9760406B2 (en) 2014-09-02 2017-09-12 Ab Initio Technology Llc Controlling data processing tasks
US10496619B2 (en) 2014-09-02 2019-12-03 Ab Initio Technology Llc Compiling graph-based program specifications
AU2015311999B2 (en) * 2014-09-02 2019-09-19 Ab Initio Technology Llc Controlling data processing tasks
US9933918B2 (en) * 2014-09-02 2018-04-03 Ab Initio Technology Llc Specifying control and data connections in graph-based programs
EP3189422A1 (en) * 2014-09-02 2017-07-12 AB Initio Technology LLC Executing graph-based program specifications
EP2998817B1 (en) * 2014-09-16 2017-06-07 Aviovision System for calculating aircraft performance and method for performing the same
US9880818B2 (en) * 2014-11-05 2018-01-30 Ab Initio Technology Llc Application testing
US10055333B2 (en) 2014-11-05 2018-08-21 Ab Initio Technology Llc Debugging a graph
US10657134B2 (en) * 2015-08-05 2020-05-19 Ab Initio Technology Llc Selecting queries for execution on a stream of real-time data
US10181105B2 (en) 2015-12-11 2019-01-15 Adp, Llc Object oriented organization management with dynamic grouping
US11016646B1 (en) * 2016-03-22 2021-05-25 Open Text Corporation Method and mechanism for context driven alteration of UI artifacts instances behavior using expression based pluggable UI aspects
US10949748B2 (en) * 2016-05-13 2021-03-16 Microsoft Technology Licensing, Llc Deep learning of bots through examples and experience
US10936289B2 (en) 2016-06-03 2021-03-02 Ab Initio Technology Llc Format-specific data processing operations
JP6686762B2 (en) * 2016-07-22 2020-04-22 富士通株式会社 Information processing system, information processing apparatus, information processing method, and program
US11853529B2 (en) * 2016-11-07 2023-12-26 Tableau Software, Inc. User interface to prepare and curate data for subsequent analysis
US10802945B2 (en) * 2016-12-07 2020-10-13 Ab Initio Technology Llc Differencing of executable dataflow graphs
US10572280B2 (en) * 2017-02-17 2020-02-25 Google Llc Mobile application activity detector
US11947978B2 (en) 2017-02-23 2024-04-02 Ab Initio Technology Llc Dynamic execution of parameterized applications for the processing of keyed network data streams
US10831509B2 (en) * 2017-02-23 2020-11-10 Ab Initio Technology Llc Dynamic execution of parameterized applications for the processing of keyed network data streams
US11194551B2 (en) 2017-06-07 2021-12-07 Ab Initio Technology Llc Dataflow graph configuration
US11423083B2 (en) 2017-10-27 2022-08-23 Ab Initio Technology Llc Transforming a specification into a persistent computer program
CN108037973B (en) * 2017-12-20 2021-11-16 苏州优圣美智能系统有限公司 Data flow modeling and processing system interacting with data processing tool
CA3106682A1 (en) 2018-07-19 2020-01-23 Ab Initio Technology Llc Publishing to a data warehouse
CN109656453A (en) * 2018-12-20 2019-04-19 树根互联技术有限公司 Rule editing method, apparatus and equipment
US11061596B2 (en) * 2019-11-04 2021-07-13 Google Llc Multi-pass distributed data shuffle
US20210191845A1 (en) 2019-12-23 2021-06-24 Ab Initio Technology Llc Unit testing of components of dataflow graphs
CN112199215B (en) * 2020-10-13 2024-01-19 恒生电子股份有限公司 Message processing method, device, equipment and storage medium
CN112306578B (en) * 2020-11-06 2022-04-19 湖南快乐阳光互动娱乐传媒有限公司 DataFetcher implementation system and method capable of configuring data source
US11567758B2 (en) 2020-12-09 2023-01-31 Adp, Inc. Configuration properties management for software
CN114063877B (en) * 2021-10-29 2024-08-16 深圳市正浩创新科技股份有限公司 Method, device and equipment for displaying data of energy storage equipment

Citations (32)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05265802A (en) 1992-03-18 1993-10-15 Shimadzu Corp Software debugging device
US5966072A (en) 1996-07-02 1999-10-12 Ab Initio Software Corporation Executing computations expressed as graphs
US6102968A (en) 1998-05-21 2000-08-15 Lucent Technologies Inc. Method for automatically closing open reactive systems
US20040205208A1 (en) 2001-03-26 2004-10-14 Juha Koponen Method and arrangements for providing efficient information transfer over a limited speed communications link
US20050027860A1 (en) 1998-12-08 2005-02-03 Greg Benson System and method for controlling the usage of digital objects
US20050114369A1 (en) 2003-09-15 2005-05-26 Joel Gould Data profiling
US20060095466A1 (en) 2004-11-02 2006-05-04 Daniell Stevens Managing related data objects
US7164422B1 (en) 2000-07-28 2007-01-16 Ab Initio Software Corporation Parameterized graphs with conditional components
US7167580B2 (en) 2003-04-30 2007-01-23 Unisys Corporation Image quality assurance systems and methodologies for improving the identification of and access speed to image quality suspects in documents
US20070271381A1 (en) 2006-05-16 2007-11-22 Joseph Skeffington Wholey Managing computing resources in graph-based computations
JP2007316884A (en) 2006-05-25 2007-12-06 Hitachi Ltd Controller, control method, and control program
US20080049022A1 (en) 2006-08-10 2008-02-28 Ab Initio Software Corporation Distributing Services in Graph-Based Computations
US20080229334A1 (en) 2005-01-20 2008-09-18 International Business Machines Corporation System and method for subscription management in a messaging system
US20080256014A1 (en) 2007-04-10 2008-10-16 Joel Gould Editing and Compiling Business Rules
US20080270920A1 (en) 2007-04-24 2008-10-30 Hudson Duncan G Automatically Generating a Graphical Program with a Plurality of Models of Computation
US20090083313A1 (en) 2007-09-20 2009-03-26 Stanfill Craig W Managing Data Flows in Graph-Based Computations
US20090119302A1 (en) 2007-11-05 2009-05-07 Microsoft Corporation Asynchronous client to server updates
US20090150518A1 (en) 2000-08-22 2009-06-11 Lewin Daniel M Dynamic content assembly on edge-of-network servers in a content delivery network
US20090187654A1 (en) 2007-10-05 2009-07-23 Citrix Systems, Inc. Silicon Valley Systems and methods for monitoring components of a remote access server farm
US20090327196A1 (en) 2008-06-30 2009-12-31 Ab Initio Software Llc Data Logging in Graph-Based Computations
US20100169392A1 (en) 2001-08-01 2010-07-01 Actona Technologies Ltd. Virtual file-sharing network
US20100241694A1 (en) 2009-02-20 2010-09-23 Richard Jensen Systems and methods for intermediaries to compress data communicated via a remote display protocol
US20110153711A1 (en) 2009-12-14 2011-06-23 Ab Initio Technology Llc Managing objects using a client-server bridge
US20110283239A1 (en) 2010-05-13 2011-11-17 Microsoft Corporation Visual analysis and debugging of complex event flows
US20110307897A1 (en) 2010-06-15 2011-12-15 Ab Initio Technology Llc Dynamically loading graph-based computations
US20120131559A1 (en) 2010-11-22 2012-05-24 Microsoft Corporation Automatic Program Partition For Targeted Replay
US8484159B2 (en) 2005-06-27 2013-07-09 Ab Initio Technology Llc Managing metadata for graph-based computations
US8627296B1 (en) 2010-09-15 2014-01-07 Google Inc. Unified unit and integration test with automatic mock creation
US20140143757A1 (en) 2012-11-16 2014-05-22 Ab Initio Technology Llc Dynamic component performance monitoring
US20140189650A1 (en) 2013-05-21 2014-07-03 Concurix Corporation Setting Breakpoints Using an Interactive Graph Representing an Application
US20160124998A1 (en) 2014-11-05 2016-05-05 Ab Initio Technology Llc Debugging a graph
US9997659B2 (en) * 2012-09-14 2018-06-12 The Boeing Company Group-IV solar cell structure using group-IV or III-V heterostructures

Family Cites Families (92)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5291587A (en) * 1986-04-14 1994-03-01 National Instruments, Inc. Graphical system for executing a process and for programming a computer to execute a process, including graphical variable inputs and variable outputs
US4901221A (en) * 1986-04-14 1990-02-13 National Instruments, Inc. Graphical system for modelling a process and associated method
US5481741A (en) * 1986-04-14 1996-01-02 National Instruments Corporation Method and apparatus for providing attribute nodes in a graphical data flow environment
US4914568A (en) * 1986-10-24 1990-04-03 National Instruments, Inc. Graphical system for modelling a process and associated method
US5301301A (en) * 1991-01-30 1994-04-05 National Instruments Corporation Polymorphic dataflow block diagram system and method for programming a computer
US5438659A (en) * 1992-10-08 1995-08-01 Hewlett-Packard Company Object-action user interface management system
JPH06230953A (en) * 1993-02-03 1994-08-19 Mitsubishi Electric Corp Graphical user interface designing device
JPH07152544A (en) * 1993-09-17 1995-06-16 Toshiba Corp Diagram production support system and its method
US5844554A (en) * 1996-09-17 1998-12-01 Bt Squared Technologies, Inc. Methods and systems for user interfaces and constraint handling configurations software
US6064812A (en) * 1996-09-23 2000-05-16 National Instruments Corporation System and method for developing automation clients using a graphical data flow program
US6102965A (en) * 1996-09-23 2000-08-15 National Instruments Corporation System and method for providing client/server access to graphical programs
US6437805B1 (en) * 1996-09-23 2002-08-20 National Instruments Corporation System and method for accessing object capabilities in a graphical program
JPH10222355A (en) * 1997-01-31 1998-08-21 Toshiba Corp Gui application developing device
US6219628B1 (en) * 1997-08-18 2001-04-17 National Instruments Corporation System and method for configuring an instrument to perform measurement functions utilizing conversion of graphical programs into hardware implementations
US6173438B1 (en) * 1997-08-18 2001-01-09 National Instruments Corporation Embedded graphical programming system
US6341279B1 (en) 1998-10-12 2002-01-22 Starwave Corporation Method and apparatus for event modeling
US7000190B2 (en) * 1999-08-19 2006-02-14 National Instruments Corporation System and method for programmatically modifying a graphical program in response to program information
US7937665B1 (en) * 2000-06-13 2011-05-03 National Instruments Corporation System and method for automatically generating a graphical program to implement a prototype
US7120876B2 (en) * 1999-08-19 2006-10-10 National Instruments Corporation System and method for programmatically generating a graphical program in response to user input
US8146007B2 (en) * 1999-08-19 2012-03-27 National Instruments Corporation Converting a first graphical program into an intermediate abstract representation for new graphical program generation
US7210117B2 (en) * 1999-08-19 2007-04-24 National Instruments Corporation System and method for programmatically generating a graphical program in response to program information
US6694321B1 (en) 1999-09-23 2004-02-17 Affymetrix, Inc. System, method, and product for development and maintenance of database-related software applications
AU2001243597A1 (en) 2000-03-03 2001-09-17 Radiant Logic, Inc. System and method for providing access to databases via directories and other hierarchical structures and interfaces
JP2001344105A (en) * 2000-03-31 2001-12-14 Hitachi Software Eng Co Ltd Web application developing method, development support system, and memory medium storing program related to this method
US6763515B1 (en) * 2000-06-05 2004-07-13 National Instruments Corporation System and method for automatically generating a graphical program to perform an image processing algorithm
ATE370448T1 (en) 2000-06-09 2007-09-15 Univ Columbia LOW DELAY FIFO CIRCUITS FOR MIXED SYNCHRONOUS AND ASYNCHRONOUS SYSTEMS
US20070192863A1 (en) 2005-07-01 2007-08-16 Harsh Kapoor Systems and methods for processing data flows
US8042098B2 (en) 2000-12-06 2011-10-18 Axiomatic Design Software, Inc. Method and apparatus for producing software
US7188091B2 (en) 2001-03-21 2007-03-06 Resolutionebs, Inc. Rule processing system
US20040210445A1 (en) * 2001-04-05 2004-10-21 Luca Veronese Method and system for specifying and implementing business applications
US6801229B1 (en) 2001-04-06 2004-10-05 Plumbdesign System for creation of visual representation of data
US7493397B1 (en) 2001-06-06 2009-02-17 Microsoft Corporation Providing remote processing services over a distributed communications network
US20040093342A1 (en) 2001-06-27 2004-05-13 Ronald Arbo Universal data mapping system
US20030172193A1 (en) * 2002-03-07 2003-09-11 Olsen Jesse Dale User interface generator and method of automatically generating a user interface
US20030174165A1 (en) 2002-03-18 2003-09-18 Barney Rock D. System and method for rendering a directed graph
US7353464B1 (en) 2002-04-01 2008-04-01 Microsoft Corporation Hierarchical data navigation tool populated by a web service
US20080091491A1 (en) * 2002-04-18 2008-04-17 Bdna Corporation Method and/or system for flexible data handling
US7574652B2 (en) 2002-06-20 2009-08-11 Canon Kabushiki Kaisha Methods for interactively defining transforms and for generating queries by manipulating existing query data
US20040030993A1 (en) * 2002-08-08 2004-02-12 Hong Huey Anna Onon Methods and apparatus for representing dynamic data in a software development environment
AU2003259744A1 (en) 2002-08-09 2004-02-25 Corticon Technologies, Inc. Rule engine
EP1535164B1 (en) 2002-08-26 2012-01-04 International Business Machines Corporation Determining threat level associated with network activity
US7167850B2 (en) 2002-10-10 2007-01-23 Ab Initio Software Corporation Startup and control of graph-based computation
US7840545B2 (en) 2002-10-25 2010-11-23 International Business Machines Corporation Method and system for providing access to a database
JP2004172695A (en) * 2002-11-18 2004-06-17 Alpine Electronics Inc Method and system of multimedia reproduction, and program for customizing operation screen
AU2002953555A0 (en) 2002-12-23 2003-01-16 Canon Kabushiki Kaisha Method for presenting hierarchical data
US7644361B2 (en) 2002-12-23 2010-01-05 Canon Kabushiki Kaisha Method of using recommendations to visually create new views of data across heterogeneous sources
JP4127194B2 (en) * 2003-01-15 2008-07-30 セイコーエプソン株式会社 Layout system, layout program, and layout method
GB0306971D0 (en) 2003-03-26 2003-04-30 British Telecomm Client server model
JP2004349355A (en) * 2003-05-20 2004-12-09 Sharp Corp Semiconductor storage device, its redundancy circuit, and portable electronic equipment
US20040239674A1 (en) 2003-06-02 2004-12-02 Microsoft Corporation Modeling graphs as XML information sets and describing graphs with XML schema
US7624375B2 (en) 2003-06-12 2009-11-24 National Instruments Corporation Automatically configuring a graphical user interface element to bind to a graphical program
EP1665034B1 (en) 2003-08-13 2017-03-22 National Instruments Corporation Creating a graphical user interface for selected parameters of a graphical program
US7756907B2 (en) 2003-09-16 2010-07-13 The Board Of Trustees Of The Leland Stanford Jr. University Computer systems and methods for visualizing data
US7448047B2 (en) 2004-04-29 2008-11-04 Sybase, Inc. Database system with methodology for providing stored procedures as web services
US7913231B2 (en) 2004-05-11 2011-03-22 Sap Ag Testing pattern-based applications
US8296665B2 (en) * 2004-05-11 2012-10-23 Sap Ag Developing and executing applications with configurable patterns
US7530052B2 (en) * 2004-05-14 2009-05-05 National Instruments Corporation Creating and executing a graphical program with first model of computation that includes a structure supporting second model of computation
US7281018B1 (en) * 2004-05-26 2007-10-09 Microsoft Corporation Form template data source change
US8533229B2 (en) * 2004-06-16 2013-09-10 Salesforce.Com, Inc. Soap-based web services in a multi-tenant database system
JP4275013B2 (en) 2004-06-21 2009-06-10 三洋電機株式会社 Data flow graph processing device, processing device, reconfigurable circuit.
US7730012B2 (en) 2004-06-25 2010-06-01 Apple Inc. Methods and systems for managing data
US20050289356A1 (en) 2004-06-29 2005-12-29 Idan Shoham Process for automated and self-service reconciliation of different loging IDs between networked computer systems
WO2006043012A1 (en) * 2004-10-22 2006-04-27 New Technology/Enterprise Limited Data processing system and method
US7523440B2 (en) * 2004-11-16 2009-04-21 The Mathworks, Inc. Dynamic generation of formatted user interfaces in software environments
US7349384B2 (en) 2004-12-10 2008-03-25 Microsoft Corporation Reliable one-way messaging over request-response transport protocols
US20060190480A1 (en) 2005-02-22 2006-08-24 Transparency Software, Inc. Generation of names related to organization actions
US20060190488A1 (en) 2005-02-22 2006-08-24 Transparency Software, Inc. System and method for determining information related to user interactions with an application
US7716630B2 (en) * 2005-06-27 2010-05-11 Ab Initio Technology Llc Managing parameters for graph-based computations
JP2007011809A (en) * 2005-06-30 2007-01-18 Kureo:Kk Job management system with job flow mounted thereon
AU2006280194A1 (en) * 2005-08-11 2007-02-22 Merck & Co., Inc. Non-nucleoside reverse transcriptase inhibitors
US8078954B2 (en) 2005-09-27 2011-12-13 Oracle International Corporation System and method for page flow editor
US7739292B2 (en) 2005-09-28 2010-06-15 Altova Gmbh System and method for modeling and managing enterprise architecture data and content models and their relationships
US8095565B2 (en) * 2005-12-05 2012-01-10 Microsoft Corporation Metadata driven user interface
US7650316B2 (en) * 2006-03-10 2010-01-19 National Instruments Corporation Automatic generation of help information for specified systems
US20070233655A1 (en) * 2006-04-03 2007-10-04 National Instruments Corporation Graphical program representation of queries
JP2007280189A (en) * 2006-04-10 2007-10-25 Toshiba Corp Program generation device, method and program
WO2007134265A2 (en) * 2006-05-12 2007-11-22 Captaris, Inc. Workflow data binding
US8396848B2 (en) * 2006-06-26 2013-03-12 Microsoft Corporation Customizable parameter user interface
US7701869B2 (en) 2006-07-21 2010-04-20 National Instruments Corporation Generating a data flow diagram
CN100527131C (en) 2006-12-30 2009-08-12 中国建设银行股份有限公司 Interdynamic access method and tool of IMS data base
US7644254B2 (en) 2007-04-18 2010-01-05 International Business Machines Corporation Routing data packets with hint bit for each six orthogonal directions in three dimensional torus computer system set to avoid nodes in problem list
US9594731B2 (en) * 2007-06-29 2017-03-14 Microsoft Technology Licensing, Llc WYSIWYG, browser-based XML editor
US8156481B1 (en) 2007-10-05 2012-04-10 The Mathworks, Inc. Profiler-based optimization of automatically generated code
JP5643654B2 (en) * 2008-02-26 2014-12-17 アビニシオ テクノロジー エルエルシー Graph representation of data relevance
US20090319494A1 (en) 2008-06-20 2009-12-24 Microsoft Corporation Field mapping for data stream output
US20100235495A1 (en) 2008-09-10 2010-09-16 Salesforce.Com, Inc. Methods and systems for reducing a load on a multi-tenant database
EP2399192A4 (en) 2009-02-13 2016-09-07 Ab Initio Technology Llc Communicating with data storage systems
US8560941B2 (en) * 2009-04-08 2013-10-15 Microsoft Corporation Schema based user interface mechanisms
KR20120115233A (en) 2009-11-13 2012-10-17 아브 이니티오 테크놀로지 엘엘시 Managing record format information
CN103098053B (en) 2010-09-10 2017-06-13 起元技术有限责任公司 Method and apparatus based on the selection of attribute management data
US9811233B2 (en) 2013-02-12 2017-11-07 Ab Initio Technology Llc Building applications for configuring processes
JP2017520032A (en) 2014-04-17 2017-07-20 アビニシオ テクノロジー エルエルシー Integrated monitoring and control of processing environment

Patent Citations (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05265802A (en) 1992-03-18 1993-10-15 Shimadzu Corp Software debugging device
US5966072A (en) 1996-07-02 1999-10-12 Ab Initio Software Corporation Executing computations expressed as graphs
US6102968A (en) 1998-05-21 2000-08-15 Lucent Technologies Inc. Method for automatically closing open reactive systems
US20050027860A1 (en) 1998-12-08 2005-02-03 Greg Benson System and method for controlling the usage of digital objects
US7164422B1 (en) 2000-07-28 2007-01-16 Ab Initio Software Corporation Parameterized graphs with conditional components
US20090150518A1 (en) 2000-08-22 2009-06-11 Lewin Daniel M Dynamic content assembly on edge-of-network servers in a content delivery network
US20040205208A1 (en) 2001-03-26 2004-10-14 Juha Koponen Method and arrangements for providing efficient information transfer over a limited speed communications link
US20100169392A1 (en) 2001-08-01 2010-07-01 Actona Technologies Ltd. Virtual file-sharing network
US7167580B2 (en) 2003-04-30 2007-01-23 Unisys Corporation Image quality assurance systems and methodologies for improving the identification of and access speed to image quality suspects in documents
US20050114369A1 (en) 2003-09-15 2005-05-26 Joel Gould Data profiling
JP2008524671A (en) 2004-11-02 2008-07-10 エービー イニティオ ソフトウェア コーポレーション Managing relationship data objects
US20060095466A1 (en) 2004-11-02 2006-05-04 Daniell Stevens Managing related data objects
US20080229334A1 (en) 2005-01-20 2008-09-18 International Business Machines Corporation System and method for subscription management in a messaging system
US8484159B2 (en) 2005-06-27 2013-07-09 Ab Initio Technology Llc Managing metadata for graph-based computations
US20070271381A1 (en) 2006-05-16 2007-11-22 Joseph Skeffington Wholey Managing computing resources in graph-based computations
JP2007316884A (en) 2006-05-25 2007-12-06 Hitachi Ltd Controller, control method, and control program
US20080049022A1 (en) 2006-08-10 2008-02-28 Ab Initio Software Corporation Distributing Services in Graph-Based Computations
US20080256014A1 (en) 2007-04-10 2008-10-16 Joel Gould Editing and Compiling Business Rules
US20080270920A1 (en) 2007-04-24 2008-10-30 Hudson Duncan G Automatically Generating a Graphical Program with a Plurality of Models of Computation
US20090083313A1 (en) 2007-09-20 2009-03-26 Stanfill Craig W Managing Data Flows in Graph-Based Computations
US20090187654A1 (en) 2007-10-05 2009-07-23 Citrix Systems, Inc. Silicon Valley Systems and methods for monitoring components of a remote access server farm
US20090119302A1 (en) 2007-11-05 2009-05-07 Microsoft Corporation Asynchronous client to server updates
US20090327196A1 (en) 2008-06-30 2009-12-31 Ab Initio Software Llc Data Logging in Graph-Based Computations
US20100241694A1 (en) 2009-02-20 2010-09-23 Richard Jensen Systems and methods for intermediaries to compress data communicated via a remote display protocol
US8661154B2 (en) * 2009-12-14 2014-02-25 Ab Initio Technology Llc Managing objects using a client-server bridge
US20110153711A1 (en) 2009-12-14 2011-06-23 Ab Initio Technology Llc Managing objects using a client-server bridge
US20140164495A1 (en) 2009-12-14 2014-06-12 Ab Initio Technology Llc Managing objects using a client-server bridge
US20110283239A1 (en) 2010-05-13 2011-11-17 Microsoft Corporation Visual analysis and debugging of complex event flows
US20110307897A1 (en) 2010-06-15 2011-12-15 Ab Initio Technology Llc Dynamically loading graph-based computations
US8627296B1 (en) 2010-09-15 2014-01-07 Google Inc. Unified unit and integration test with automatic mock creation
US20120131559A1 (en) 2010-11-22 2012-05-24 Microsoft Corporation Automatic Program Partition For Targeted Replay
US9997659B2 (en) * 2012-09-14 2018-06-12 The Boeing Company Group-IV solar cell structure using group-IV or III-V heterostructures
US20140143757A1 (en) 2012-11-16 2014-05-22 Ab Initio Technology Llc Dynamic component performance monitoring
US20140189650A1 (en) 2013-05-21 2014-07-03 Concurix Corporation Setting Breakpoints Using an Interactive Graph Representing an Application
US20160124998A1 (en) 2014-11-05 2016-05-05 Ab Initio Technology Llc Debugging a graph

Non-Patent Citations (11)

* Cited by examiner, † Cited by third party
Title
Canadian Office Action for Application No. CA 2782402 dated Feb. 10, 2017.
Chinese Office Action and English translation thereof dated Jul. 8, 2014 in connection with Chinese Application No. 2010-80063818.8.
Examination Report No. 1 for Australian Application No. AU 2016201350 dated Dec. 21, 2016.
Gedik et al., Tools and strategies for debugging distributed steam processing applications. Software Practice and Experience. Oct. 2009; 39:1347-76.
International Preliminary Report on Patentability dated Jun. 28, 2012 in connection with International Application No. PCT/US2010/060270.
International Preliminary report on Patentability for International Application No. PCT/US2015/059280 dated May 18, 2017.
International Search Report and Written Opinion dated Apr. 29, 2011 in connection with International Application No. PCT/US2010/060270.
International Search Report and Written Opinion for International Application No. PCT/US2015/059280 dated Feb. 15, 2016.
Japanese Office Action and English translation thereof dated Nov. 14, 2014 in connection with Japanese Application No. 2012-543341.
Korean Office Action for Application No. 10-2012-7017686 dated Dec. 14, 2016.
U.S. Appl. No. 14/715,904, filed May 19, 2015, Offner et al.

Also Published As

Publication number Publication date
KR20120101706A (en) 2012-09-14
CA2782402C (en) 2019-08-06
AU2010337107B2 (en) 2016-04-07
US8661154B2 (en) 2014-02-25
CN107102848A (en) 2017-08-29
US20110145748A1 (en) 2011-06-16
CA2782414C (en) 2021-08-03
JP2017062839A (en) 2017-03-30
KR101862235B1 (en) 2018-05-29
EP2514176A1 (en) 2012-10-24
US20110153711A1 (en) 2011-06-23
EP2513782A1 (en) 2012-10-24
CN102754411A (en) 2012-10-24
CN102754411B (en) 2016-05-04
CN102754072B (en) 2016-10-19
JP5813655B2 (en) 2015-11-17
JP6084037B2 (en) 2017-02-22
US20160248643A1 (en) 2016-08-25
WO2011081925A4 (en) 2011-08-25
KR20120104267A (en) 2012-09-20
US20140164495A1 (en) 2014-06-12
CA3012113A1 (en) 2011-07-07
CA2782402A1 (en) 2011-07-07
JP2013513864A (en) 2013-04-22
US10845962B2 (en) 2020-11-24
CN107102848B (en) 2020-11-24
JP6200472B2 (en) 2017-09-20
AU2016201350B2 (en) 2017-12-21
AU2010337107A1 (en) 2012-06-14
JP2013513872A (en) 2013-04-22
WO2011081776A1 (en) 2011-07-07
CN102754072A (en) 2012-10-24
JP2016001502A (en) 2016-01-07
AU2010337218A1 (en) 2012-06-14
JP6313838B2 (en) 2018-04-18
KR101784784B1 (en) 2017-10-12
WO2011081925A1 (en) 2011-07-07
AU2010337218B2 (en) 2015-09-24
CA2782414A1 (en) 2011-07-07
AU2016201350A1 (en) 2016-03-24

Similar Documents

Publication Publication Date Title
US10129116B2 (en) Techniques for capturing execution time data in dataflow graphs
US7580946B2 (en) Smart integration engine and metadata-oriented architecture for automatic EII and business integration
US8788569B2 (en) Server computer system running versions of an application simultaneously
US11157242B2 (en) Systems, methods, and apparatuses for local web components development within a cloud based computing environment
US20050027559A1 (en) Generic framework for applying object-oriented models to multi-tiered enterprise applications
US20090172636A1 (en) Interactive development tool and debugger for web services
US20090320045A1 (en) Server computer component
Goodwin Learning Akka
WO2023192418A1 (en) An extensibility platform
US20040230587A1 (en) System and method for specifying application services and distributing them across multiple processors using XML
Siegel et al. The Cyc System: Notes on Architecture
Kaplan Framework for migrating deployed serverless applications
Aryal MERN stack with modern web practices
Chattopadhayay Getting Started with Oracle Tuxedo
Bitonti et al. Dynamic testing of legacy code resources on the Grid
Varsala Modernization of a legacy system: event streaming with Apache Kafka and Spring Boot
CN118210845A (en) Spark computing engine-based environment isolation method, device and equipment
Εμμανουήλ IoT platform and data management using microservices
Shi SYNERGY V3. 0 Usage Manual
Dünnweber et al. Higher-Order Component Service Architecture (HOC-SA)
Machacek et al. Spring Patterns

Legal Events

Date Code Title Description
AS Assignment

Owner name: AB INITIO SOFTWARE LLC, MASSACHUSETTS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FARVER, JENNIFER M.;GOLDSHLAG, JOSHUA;PARMENTER, DAVID;AND OTHERS;SIGNING DATES FROM 20101213 TO 20110216;REEL/FRAME:038452/0810

AS Assignment

Owner name: AB INITIO ORIGINAL WORKS LLC, MASSACHUSETTS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AB INITIO SOFTWARE LLC;REEL/FRAME:038533/0995

Effective date: 20110304

AS Assignment

Owner name: AB INITIO TECHNOLOGY LLC, MASSACHUSETTS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AB INITIO ORIGINAL WORKS LLC;REEL/FRAME:038926/0497

Effective date: 20110304

STCF Information on status: patent grant

Free format text: PATENTED CASE

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 4