Rapid predictive analysis of very large data sets using the distributed computational graph

Description

BACKGROUND OF THE INVENTION
Field of the Invention

The present invention is in the field of analysis of very large data sets using distributed computational graph tools which allow for transformation of data through both linear and non-linear transformation pipelines.

Discussion of the State of the Art

The ability to transfer information between individuals, even over large distances, is credited with allowing mankind to rise from a species of primate gatherer-scavengers to forming simple communities. The ability to stably record information so that it could be analyzed for repetitive events, trends, and serve as a base to be expanded and built upon. It is safe to say that the availability of information in formats that allow it to be analyzed and added to by both individuals contemporary to its accrual and those who come after is the most powerful tool available to mankind and likely is what has propelled us to the level of social and technological achievement we have attained.

Nothing has augmented our ability to gather and store information analogous to the rise of electronic and computer technology. There are sensors of all types to measure just about any condition one can imagine. Computers have allowed the health information for a large portion of the human population is stored and accessible. Similarly, detailed data on vehicular accidents, both environmental and vehicle component factors Airline mishaps and crashes can be recreated and studied in great detail. Item information is recorded for the majority of consumer purchases. Further examples abound, but the point has been made. Computer database technology has allowed all of this information to be reliably stored for future retrieval and analysis. The benefits of database technology are so strong that there are very few businesses large or small that do not make some use of a data and knowledge storage solution, either directly for such tasks as inventory control and forecasting or customer relations, or indirectly for ordering. The meteoric rise of computer networking the internet has only served to turn the accrual of information into a torrent as now huge populations can exchange observations, data and ideas, even invited to do so; vast arrays of sensors can be tied together in meaningful ways all of which can be stored for future analysis and use. The receipt and storage of data has gotten to the point where an expert has been quoted as estimating that as much data is currently accrued in two days as was accrued in all history prior to 2003 (Eric Schmidt, Google). Entirely new distributed data storage and retrieval technologies such as Hadoop, and map/reduce; and graph and column based data store organization have been developed to accommodate the influx of information and provide some ability to retrieve information in a guided fashion, but such retrieval has proven to be too labor intensive and rigid to be of use in all but the more superficial and simple of campaigns. Presently, we are accruing vast amounts of information daily but do not have the tools to analyze all but a trickle into knowledge or informed action. What is needed is a system to allow the analysis of current, possibly complex and changing streaming data of interest in the context of the vast stored data that has accumulated relating to it such that meaningful conclusions made and effective action can be taken. To be of use, such a system would also need to possess the ability to self-assess its own operations and key intermediate factors in both the data stream and stored information and make changes to its own function to optimize function and maximize the probability of reliable conclusions.

Data pipelines, which are a progression of functions which each perform some action or transformation on a data stream, offer a mechanism to process quantities of data in the volume discussed directly above. To date however, data pipelines have either been extremely limited in what they do, for example “move data from a web based merchant site to a distributed data store; extract all purchases and classify by product type and region; store the result logs” or have been rigidly programmed and possibly required the uses of highly specific remote protocol calls to perform needed tasks. Even with these additions their capabilities have been very limited and, they have all been linear in configuration which precludes their use for analysis and conclusion or action discovery in a majority of complex situations where branching or even recurrent modification is needed.

What is needed is a system that intelligently combines processing of a current data stream with the ability to retrieve relevant stored data in such a way that conclusions or actions could be drawn in a predictive manner. To work in a timely and efficient manner, the system needs the ability to monitor for both operational issues within its components and should be able to learn and react to intermediate determinations of the analyses it runs and also should be able to self-modify to maintain optimal operation.

SUMMARY OF THE INVENTION

The inventor has developed a system for rapid predictive analysis of very large data sets using a distributed computational graph, that intelligently combines processing of a current data stream with the ability to retrieve relevant stored data in such a way that conclusions or actions could be drawn in a predictive manner.

According to a preferred embodiment of the invention, a system for rapid predictive analysis of very large data sets using the distributed computational graph, comprising a data receipt software module, a data filter software module, a data formalization software module, an input event data store module, a batch event analysis server, a system sanity and retrain software module, a messaging software module, a transformation pipeline software module, and an output software module, is disclosed. The data receipt software module: receives streams of input from one or more of a plurality of data sources, and sends the data stream to the data filter module. The filter software module: receives streams of data from the data receipt software module; removes data records from the stream for a plurality of reasons drawn from, but not limited to, a set comprising absence of all information, damage to data in the record, and presence of in-congruent information or missing information which invalidates the data record; splits filtered data stream into two or more identical parts; sends one identical data stream to the data formalization software module; and sends another identical data stream to the transformation pipeline module of the distributed graph computational module. The data formalization module: receives data stream from the data filter software module; formats the data within data stream based upon a set of predetermined parameters so as to prepare for meaningful storage in a data store; and places the formatted data stream into the input event data store. The input event data store: receives properly formatted data from the data formalization module; and stores the data by method suited to the long term availability, timely retrieval, and analysis of the accumulated data; The batch event analysis server: accesses the data store for information of interest based upon a set of predetermined parameters; aggregates data retrieved from the data store as predetermined that represent such interests as trends of importance, past instances of an event or set of events within a system under analysis or possible cause and effect relationships between two or more variables over many iterations; and provides summary information based upon the breadth of the data analyzed to the messaging software module; and receives communication from the messaging software module which may be in the form of requests for particular information or directives concerning the information being supplied at that time. The transformation pipeline software module: receives streaming data from the data filter software module; performs one or more functions on data within data stream; provides data resultant from the set of function pipeline back to the system; and receives directives from the system sanity and retrain module to modify the function of the pipeline. The messaging software module: receives administrative directives from those conducting the analysis; receives data store analysis summaries from batch event analysis server; receives results of pipeline data functions from transformation pipeline software module; and sends data analysis status and progress related messages as well as administrative execution directives to the system sanity and retrain software module. The system sanity and retrain software module: receives data analysis status and progress information from the messaging software module; compares all incoming information against preassigned parameters to ensure system stability; changes operational behavior within other software modules of system using preexisting guidelines to return required system function; sends alert signal through the output module concerning degraded system status as necessary; and receives and applies any administrative requests for changes in system function. Finally, the output module: receives information destined for outside of the system; formats that information based upon designated end target; and routes that information to the proper port for intended further action.

According to another preferred embodiment of the invention, a method for a system for the predictive analysis of very large data sets using the distributed computational graph, the method comprising the following steps: To receive streaming input from one or more of a plurality of data sources. To filter data of incomplete, misconfigured or damaged input. To formalize input data for use in batch and streaming portions of method using pre-designed standard. To perform a set of one or more data transformations on formalized input. To perform sanity checks of results of transformation pipeline analysis of streaming data as well as analysis process retraining based upon batch analysis of input data. Finally, to output the results of the analysis process in format predecided upon by the authors of the analysis.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

The accompanying drawings illustrate several embodiments of the invention and, together with the description, serve to explain the principles of the invention according to the embodiments. One skilled in the art will recognize that the particular embodiments illustrated in the drawings are merely exemplary, and are not intended to limit the scope of the present invention.

FIG. 1 is a block diagram illustrating an exemplary hardware architecture of a computing device used in various embodiments of the invention.

FIG. 2 is a block diagram illustrating an exemplary logical architecture for a client device, according to various embodiments of the invention.

FIG. 3 is a block diagram illustrating an exemplary architectural arrangement of clients, servers, and external services, according to various embodiments of the invention.

FIG. 4 is a block diagram illustrating an exemplary overview of a computer system as may be used in any of the various locations throughout the system

FIG. 5 is a diagram of an exemplary architecture for a system where streams of input data from one or more of a plurality of sources are analyzed to predict outcome using both batch analysis of acquired data and transformation pipeline manipulation of current streaming data according to an embodiment of the invention.

FIG. 6 (Prior Art) is a diagram of an exemplary architecture for a linear transformation pipeline system which introduces the concept of the transformation pipeline as a directed graph of transformation nodes and messages according to an embodiment of the invention.

FIG. 7 is a diagram of an exemplary architecture for a transformation pipeline system where one of the transformations receives input from more than one source which introduces the concept of the transformation pipeline as a directed graph of transformation nodes and messages according to an embodiment of the invention.

FIG. 8 is a diagram of an exemplary architecture for a transformation pipeline system where the output of one data transformation servers as the input of more than one downstream transformations which introduces the concept of the transformation pipeline as a directed graph of transformation nodes and messages according to an embodiment of the invention.

FIG. 9 is a diagram of an exemplary architecture for a transformation pipeline system where a set of three data transformations act to form a cyclical pipeline which also introduces the concept of the transformation pipeline as a directed graph of transformation nodes and messages according to an embodiment of the invention.

FIG. 10 is a process flow diagram of a method for the receipt, processing and predictive analysis of streaming data using a system of the invention.

FIG. 11 is a process flow diagram of a method for representing the operation of the transformation pipeline as a directed graph function using a system of the invention.

FIG. 12 (Prior Art) is a process flow diagram of a method for a linear data transformation pipeline using a system of the invention.

FIG. 13 is a process flow diagram of a method for the disposition of input from two antecedent data transformations into a single data transformation of transformation pipeline using a system of the invention.

FIG. 14 is a process flow diagram of a method for the disposition of output of one data transformation that then serves as input to two postliminary data transformations using a system of the invention.

FIG. 15 is a process flow diagram of a method for processing a set of three or more data transformations within a data transformation pipeline where output of the last member transformation of the set serves as input of the first member transformation thereby creating a cyclical relationship using a system of the invention.

FIG. 16 is a process flow diagram of a method for the receipt and use of streaming data into batch storage and analysis of changes over time, repetition of specific data sequences or the presence of critical data points using a system of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The inventor has conceived, and reduced to practice, various systems and methods for predictive analysis of very large data sets using a distributed computational graph.

One or more different inventions may be described in the present application. Further, for one or more of the inventions described herein, numerous alternative embodiments may be described; it should be understood that these are presented for illustrative purposes only. The described embodiments are not intended to be limiting in any sense. One or more of the inventions may be widely applicable to numerous embodiments, as is readily apparent from the disclosure. In general, embodiments are described in sufficient detail to enable those skilled in the art to practice one or more of the inventions, and it is to be understood that other embodiments may be utilized and that structural, logical, software, electrical and other changes may be made without departing from the scope of the particular inventions. Accordingly, those skilled in the art will recognize that one or more of the inventions may be practiced with various modifications and alterations. Particular features of one or more of the inventions may be described with reference to one or more particular embodiments or figures that form a part of the present disclosure, and in which are shown, by way of illustration, specific embodiments of one or more of the inventions. It should be understood, however, that such features are not limited to usage in the one or more particular embodiments or figures with reference to which they are described. The present disclosure is neither a literal description of all embodiments of one or more of the inventions nor a listing of features of one or more of the inventions that must be present in all embodiments.

Headings of sections provided in this patent application and the title of this patent application are for convenience only, and are not to be taken as limiting the disclosure in any way.

Devices that are in communication with each other need not be in continuous communication with each other, unless expressly specified otherwise. In addition, devices that are in communication with each other may communicate directly or indirectly through one or more intermediaries, logical or physical.

A description of an embodiment with several components in communication with each other does not imply that all such components are required. To the contrary, a variety of optional components may be described to illustrate a wide variety of possible embodiments of one or more of the inventions and in order to more fully illustrate one or more aspects of the inventions. Similarly, although process steps, method steps, algorithms or the like may be described in a sequential order, such processes, methods and algorithms may generally be configured to work in alternate orders, unless specifically stated to the contrary. In other words, any sequence or order of steps that may be described in this patent application does not, in and of itself, indicate a requirement that the steps be performed in that order. The steps of described processes may be performed in any order practical. Further, some steps may be performed simultaneously despite being described or implied as occurring sequentially (e.g., because one step is described after the other step). Moreover, the illustration of a process by its depiction in a drawing does not imply that the illustrated process is exclusive of other variations and modifications thereto, does not imply that the illustrated process or any of its steps are necessary to one or more of the invention(s), and does not imply that the illustrated process is preferred. Also, steps are generally described once per embodiment, but this does not mean they must occur once, or that they may only occur once each time a process, method, or algorithm is carried out or executed. Some steps may be omitted in some embodiments or some occurrences, or some steps may be executed more than once in a given embodiment or occurrence.

When a single device or article is described, it will be readily apparent that more than one device or article may be used in place of a single device or article. Similarly, where more than one device or article is described, it will be readily apparent that a single device or article may be used in place of the more than one device or article.

The functionality or the features of a device may be alternatively embodied by one or more other devices that are not explicitly described as having such functionality or features. Thus, other embodiments of one or more of the inventions need not include the device itself.

Techniques and mechanisms described or referenced herein will sometimes be described in singular form for clarity. However, it should be noted that particular embodiments include multiple iterations of a technique or multiple manifestations of a mechanism unless noted otherwise. Process descriptions or blocks in figures should be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of embodiments of the present invention in which, for example, functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those having ordinary skill in the art.

Definitions

As used herein, “graph” is a representation of information and relationships, where each primary unit of information makes up a “node” or “vertex” of the graph and the relationship between two nodes makes up an edge of the graph. Nodes can be further qualified by the connection of one or more descriptors or “properties” to that node. For example, given the node “James R,” name information for a person, qualifying properties might be “183 cm tall”, “DOB 08/13/1965” and “speaks English”. Similar to the use of properties to further describe the information in a node, a relationship between two nodes that forms an edge can be qualified using a “label”. Thus, given a second node “Thomas G,” an edge between “James R” and “Thomas G” that indicates that the two people know each other might be labeled “knows.” When graph theory notation (Graph=(Vertices, Edges)) is applied this situation, the set of nodes are used as one parameter of the ordered pair,V and the set of 2 element edge endpoints are used as the second parameter of the ordered pair, E. When the order of the edge endpoints within the pairs of E is not significant, for example, the edge James R, Thomas G is equivalent to Thomas G, James R, the graph is designated as “undirected.” Under circumstances when a relationship flows from one node to another in one direction, for example James R is “taller” than Thomas G, the order of the endpoints is significant. Graphs with such edges are designated as “directed.” In the distributed computational graph system, transformations within transformation pipeline are represented as directed graph with each transformation comprising a node and the output messages between transformations comprising edges. Distributed computational graph stipulates the potential use of non-linear transformation pipelines which are programmatically linearized. Such linearization can result in exponential growth of resource consumption. The most sensible approach to overcome possibility is to introduce new transformation pipelines just as they are needed, creating only those that are ready to compute. Such method results in transformation graphs which are highly variable in size and node, edge composition as the system processes data streams. Those familiar with the art will realize that transformation graph may assume many shapes and sizes with a vast topography of edge relationships. The examples given were chosen for illustrative purposes only and represent a small number of the simplest of possibilities. These examples should not be taken to define the possible graphs expected as part of operation of the invention

As used herein, “transformation” is a function performed on zero or more streams of input data which results in a single stream of output which may or may not then be used as input for another transformation. Transformations may comprise any combination of machine, human or machine-human interactions Transformations need not change data that enters them, one example of this type of transformation would be a storage transformation which would receive input and then act as a queue for that data for subsequent transformations. As implied above, a specific transformation may generate output data in the absence of input data. A time stamp serves as a example. In the invention, transformations are placed into pipelines such that the output of one transformation may serve as an input for another. These pipelines can consist of two or more transformations with the number of transformations limited only by the resources of the system. Historically, transformation pipelines have been linear with each transformation in the pipeline receiving input from one antecedent and providing output to one subsequent with no branching or iteration. Other pipeline configurations are possible. The invention is designed to permit several of these configurations including, but not limited to: linear, afferent branch, efferent branch and cyclical.

A “database” or “data storage subsystem” (these terms may be considered substantially synonymous), as used herein, is a system adapted for the long-term storage, indexing, and retrieval of data, the retrieval typically being via some sort of querying interface or language. “Database” may be used to refer to relational database management systems known in the art, but should not be considered to be limited to such systems. Many alternative database or data storage system technologies have been, and indeed are being, introduced in the art, including but not limited to distributed non-relational data storage systems such as Hadoop, column-oriented databases, in-memory databases, and the like. While various embodiments may preferentially employ one or another of the various data storage subsystems available in the art (or available in the future), the invention should not be construed to be so limited, as any data storage architecture may be used according to the embodiments. Similarly, while in some cases one or more particular data storage needs are described as being satisfied by separate components (for example, an expanded private capital markets database and a configuration database), these descriptions refer to functional uses of data storage systems and do not refer to their physical architecture. For instance, any group of data storage systems of databases referred to herein may be included together in a single database management system operating on a single machine, or they may be included in a single database management system operating on a cluster of machines as is known in the art. Similarly, any single database (such as an expanded private capital markets database) may be implemented on a single machine, on a set of machines using clustering technology, on several machines connected by one or more messaging systems known in the art, or in a master/slave arrangement common in the art. These examples should make clear that no particular architectural approaches to database management is preferred according to the invention, and choice of data storage technology is at the discretion of each implementer, without departing from the scope of the invention as claimed.

Hardware Architecture

Generally, the techniques disclosed herein may be implemented on hardware or a combination of software and hardware. For example, they may be implemented in an operating system kernel, in a separate user process, in a library package bound into network applications, on a specially constructed machine, on an application-specific integrated circuit (ASIC), or on a network interface card.

Software/hardware hybrid implementations of at least some of the embodiments disclosed herein may be implemented on a programmable network-resident machine (which should be understood to include intermittently connected network-aware machines) selectively activated or reconfigured by a computer program stored in memory. Such network devices may have multiple network interfaces that may be configured or designed to utilize different types of network communication protocols. A general architecture for some of these machines may be disclosed herein in order to illustrate one or more exemplary means by which a given unit of functionality may be implemented. According to specific embodiments, at least some of the features or functionalities of the various embodiments disclosed herein may be implemented on one or more general-purpose computers associated with one or more networks, such as for example an end-user computer system, a client computer, a network server or other server system possibly networked with others in a data processing center, a mobile computing device (e.g., tablet computing device, mobile phone, smartphone, laptop, and the like), a consumer electronic device, a music player, or any other suitable electronic device, router, switch, or the like, or any combination thereof. In at least some embodiments, at least some of the features or functionalities of the various embodiments disclosed herein may be implemented in one or more virtualized computing environments (e.g., network computing clouds, virtual machines hosted on one or more physical computing machines, or the like).

Referring now to FIG. 1, there is shown a block diagram depicting an exemplary computing device 100 suitable for implementing at least a portion of the features or functionalities disclosed herein. Computing device 100 may be, for example, any one of the computing machines listed in the previous paragraph, or indeed any other electronic device capable of executing software- or hardware-based instructions according to one or more programs stored in memory. Computing device 100 may be adapted to communicate with a plurality of other computing devices, such as clients or servers, over communications networks such as a wide area network a metropolitan area network, a local area network, a wireless network, the Internet, or any other network, using known protocols for such communication, whether wireless or wired.

In one embodiment, computing device 100 includes one or more central processing units (CPU) 102, one or more interfaces 110, and one or more buses 106 (such as a peripheral component interconnect (PCI) bus). When acting under the control of appropriate software or firmware, CPU 102 may be responsible for implementing specific functions associated with the functions of a specifically configured computing device or machine. For example, in at least one embodiment, a computing device 100 may be configured or designed to function as a server system utilizing CPU 102, local memory 101 and/or remote memory 120, and interface(s) 110. In at least one embodiment, CPU 102 may be caused to perform one or more of the different types of functions and/or operations under the control of software modules or components, which for example, may include an operating system and any appropriate applications software, drivers, and the like.

CPU 102 may include one or more processors 103 such as, for example, a processor from one of the Intel, ARM, Qualcomm, and AMD families of microprocessors. In some embodiments, processors 103 may include specially designed hardware such as application-specific integrated circuits (ASICs), electrically erasable programmable read-only memories (EEPROMs), field-programmable gate arrays (FPGAs), and so forth, for controlling operations of computing device 100. In a specific embodiment, a local memory 101 (such as non-volatile random access memory (RAM) and/or read-only memory (ROM), including for example one or more levels of cached memory) may also form part of CPU 102. However, there are many different ways in which memory may be coupled to system 100. Memory 101 may be used for a variety of purposes such as, for example, caching and/or storing data, programming instructions, and the like.

As used herein, the term “processor” is not limited merely to those integrated circuits referred to in the art as a processor, a mobile processor, or a microprocessor, but broadly refers to a microcontroller, a microcomputer, a programmable logic controller, an application-specific integrated circuit, and any other programmable circuit.

In one embodiment, interfaces 110 are provided as network interface cards (NICs). Generally, NICs control the sending and receiving of data packets over a computer network; other types of interfaces 110 may for example support other peripherals used with computing device 100. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, graphics interfaces, and the like. In addition, various types of interfaces may be provided such as, for example, universal serial bus (USB), Serial, Ethernet, Firewire, PCI, parallel, radio frequency (RF), Bluetooth, near-field communications (e.g., using near-field magnetics), 802.11 (WiFi), frame relay, TCP/IP, ISDN, fast Ethernet interfaces, Gigabit Ethernet interfaces, asynchronous transfer mode (ATM) interfaces, high-speed serial interface (HSSI) interfaces, Point of Sale (POS) interfaces, fiber data distributed interfaces (FDDIs), and the like. Generally, such interfaces 110 may include ports appropriate for communication with appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile and/or non-volatile memory (e.g., RAM).

Although the system shown in FIG. 1 illustrates one specific architecture for a computing device 100 for implementing one or more of the inventions described herein, it is by no means the only device architecture on which at least a portion of the features and techniques described herein may be implemented. For example, architectures having one or any number of processors 103 may be used, and such processors 103 may be present in a single device or distributed among any number of devices. In one embodiment, a single processor 103 handles communications as well as routing computations, while in other embodiments a separate dedicated communications processor may be provided. In various embodiments, different types of features or functionalities may be implemented in a system according to the invention that includes a client device (such as a tablet device or smartphone running client software) and server systems (such as a server system described in more detail below).

Regardless of network device configuration, the system of the present invention may employ one or more memories or memory modules (such as, for example, remote memory block 120 and local memory 101) configured to store data, program instructions for the general-purpose network operations, or other information relating to the functionality of the embodiments described herein (or any combinations of the above). Program instructions may control execution of or comprise an operating system and/or one or more applications, for example. Memory 120 or memories 101, 120 may also be configured to store data structures, configuration data, encryption data, historical system operations information, or any other specific or generic non-program information described herein.

Because such information and program instructions may be employed to implement one or more systems or methods described herein, at least some network device embodiments may include nontransitory machine-readable storage media, which, for example, may be configured or designed to store program instructions, state information, and the like for performing various operations described herein. Examples of such nontransitory machine-readable storage media include, but are not limited to, magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media such as optical disks, and hardware devices that are specially configured to store and perform program instructions, such as read-only memory devices (ROM), flash memory, solid state drives, memristor memory, random access memory (RAM), and the like. Examples of program instructions include both object code, such as may be produced by a compiler, machine code, such as may be produced by an assembler or a linker, byte code, such as may be generated by for example a Java compiler and may be executed using a Java virtual machine or equivalent, or files containing higher level code that may be executed by the computer using an interpreter (for example, scripts written in Python, Perl, Ruby, Groovy, or any other scripting language).

In some embodiments, systems according to the present invention may be implemented on a standalone computing system. Referring now to FIG. 2, there is shown a block diagram depicting a typical exemplary architecture of one or more embodiments or components thereof on a standalone computing system. Computing device 200 includes processors 210 that may run software that carry out one or more functions or applications of embodiments of the invention, such as for example a client application 230. Processors 210 may carry out computing instructions under control of an operating system 220 such as, for example, a version of Microsoft's Windows operating system, Apple's Mac OS/X or iOS operating systems, some variety of the Linux operating system, Google's Android operating system, or the like. In many cases, one or more shared services 225 may be operable in system 200, and may be useful for providing common services to client applications 230. Services 225 may for example be Windows services, user-space common services in a Linux environment, or any other type of common service architecture used with operating system 210. Input devices 270 may be of any type suitable for receiving user input, including for example a keyboard, touchscreen, microphone (for example, for voice input), mouse, touchpad, trackball, or any combination thereof. Output devices 260 may be of any type suitable for providing output to one or more users, whether remote or local to system 200, and may include for example one or more screens for visual output, speakers, printers, or any combination thereof. Memory 240 may be random-access memory having any structure and architecture known in the art, for use by processors 210, for example to run software. Storage devices 250 may be any magnetic, optical, mechanical, memristor, or electrical storage device for storage of data in digital form. Examples of storage devices 250 include flash memory, magnetic hard drive, CD-ROM, and/or the like.

In some embodiments, systems of the present invention may be implemented on a distributed computing network, such as one having any number of clients and/or servers. Referring now to FIG. 3, there is shown a block diagram depicting an exemplary architecture for implementing at least a portion of a system according to an embodiment of the invention on a distributed computing network. According to the embodiment, any number of clients 330 may be provided. Each client 330 may run software for implementing client-side portions of the present invention; clients may comprise a system 200 such as that illustrated in FIG. 2. In addition, any number of servers 320 may be provided for handling requests received from one or more clients 330. Clients 330 and servers 320 may communicate with one another via one or more electronic networks 310, which may be in various embodiments of the Internet, a wide area network, a mobile telephony network, a wireless network (such as WiFi, Wimax, and so forth), or a local area network (or indeed any network topology known in the art; the invention does not prefer any one network topology over any other). Networks 310 may be implemented using any known network protocols, including for example wired and/or wireless protocols.

In addition, in some embodiments, servers 320 may call external services 370 when needed to obtain additional information, or to refer to additional data concerning a particular call. Communications with external services 370 may take place, for example, via one or more networks 310. In various embodiments, external services 370 may comprise web-enabled services or functionality related to or installed on the hardware device itself. For example, in an embodiment where client applications 230 are implemented on a smartphone or other electronic device, client applications 230 may obtain information stored in a server system 320 in the cloud or on an external service 370 deployed on one or more of a particular enterprise's or user's premises.

In some embodiments of the invention, clients 330 or servers 320 (or both) may make use of one or more specialized services or appliances that may be deployed locally or remotely across one or more networks 310. For example, one or more databases 340 may be used or referred to by one or more embodiments of the invention. It should be understood by one having ordinary skill in the art that databases 340 may be arranged in a wide variety of architectures and using a wide variety of data access and manipulation means. For example, in various embodiments one or more databases 340 may comprise a relational database system using a structured query language (SQL), while others may comprise an alternative data storage technology such as those referred to in the art as “NoSQL” (for example, Hadoop, MapReduce, BigTable, and so forth). In some embodiments variant database architectures such as column-oriented databases, in-memory databases, clustered databases, distributed databases, key-value stores, or even flat file data repositories may be used according to the invention. It will be appreciated by one having ordinary skill in the art that any combination of known or future database technologies may be used as appropriate, unless a specific database technology or a specific arrangement of components is specified for a particular embodiment herein. Moreover, it should be appreciated that the term “database” as used herein may refer to a physical database machine, a cluster of machines acting as a single database system, or a logical database within an overall database management system. Unless a specific meaning is specified for a given use of the term “database”, it should be construed to mean any of these senses of the word, all of which are understood as a plain meaning of the term “database” by those having ordinary skill in the art.

Similarly, most embodiments of the invention may make use of one or more security systems 360 and configuration systems 350. Security and configuration management are common information technology (IT) and web functions, and some amount of each are generally associated with any IT or web systems. It should be understood by one having ordinary skill in the art that any configuration or security subsystems known in the art now or in the future may be used in conjunction with embodiments of the invention without limitation, unless a specific security 360 or configuration 350 system or approach is specifically required by the description of any specific embodiment.

FIG. 4 shows an exemplary overview of a computer system 400 as may be used in any of the various locations throughout the system. It is exemplary of any computer that may execute code to process data. Various modifications and changes may be made to computer system 400 without departing from the broader scope of the system and method disclosed herein. CPU 401 is connected to bus 402, to which bus is also connected memory 403, nonvolatile memory 404, display 407, I/O unit 408, and network interface card (NIC) 413. I/O unit 408 may, typically, be connected to keyboard 409, pointing device 410, hard disk 412, and real-time clock 411. NIC 413 connects to network 414, which may be the Internet or a local network, which local network may or may not have connections to the Internet. Also shown as part of system 400 is power supply unit 405 connected, in this example, to ac supply 406. Not shown are batteries that could be present, and many other devices and modifications that are well known but are not applicable to the specific novel functions of the current system and method disclosed herein. It should be appreciated that some or all components illustrated may be combined, such as in various integrated applications (for example, Qualcomm or Samsung SOC-based devices), or whenever it may be appropriate to combine multiple capabilities or functions into a single hardware device (for instance, in mobile devices such as smartphones, video game consoles, in-vehicle computer systems such as navigation or multimedia systems in automobiles, or other integrated hardware devices).

In various embodiments, functionality for implementing systems or methods of the present invention may be distributed among any number of client and/or server components. For example, various software modules may be implemented for performing various functions in connection with the present invention, and such modules may be variously implemented to run on server and/or client components.

Conceptual Architecture

FIG. 5 is a block diagram of an exemplary architecture for a system 500 for predictive analysis of very large data sets using a distributed computational graph. According to the embodiment, streaming input feeds 510 may be a variety of data sources which may include but are not limited to the internet 511, arrays of physical sensors 512, database servers 513, electronic monitoring equipment 514 and direct human interaction 515 ranging from a relatively few number of participants to a large crowd sourcing campaign. Streaming data from any combinations of listed sources and those not listed may also be expected to occur as part of the operation of the invention as the number of streaming input sources is not limited by the design. All incoming streaming data may be passed through a data filter software module 520 to remove information that has been damaged in transit, is misconfigured, or is malformed in some way that precludes use. Many of the filter parameters may be expected to be preset prior to operation, however, design of the invention makes provision for the behavior of the filter software module 520 to be changed as progression of analysis requires through the automation of the system sanity and retrain software module 563 which may serve to optimize system operation and analysis function. The data stream may also be split into two identical substreams at the data filter software module 520 with one substream being fed into a streaming analysis pathway that includes the transformation pipeline software module 561 of the distributed computational graph 560. The other substream may be fed to data formalization software module 530 as part of the batch analysis pathway. The data formalization module 530 formats the data stream entering the batch analysis pathway of the invention into data records to be stored by the input event data store 540. The input event data store 540 can be a database of any architectural type known to those knowledgeable in the art, but based upon the quantity of the data the data store module would be expected to store and retrieve, options using highly distributed storage and map reduce query protocols, of which Hadoop is one, but not the only example, may be generally preferable to relational database schema.

Analysis of data from the input event data store may be performed by the batch event analysis software module 550. This module may be used to analyze the data in the input event data store for temporal information such as trends, previous occurrences of the progression of a set of events, with outcome, the occurrence of a single specific event with all events recorded before and after whether deemed relevant at the time or not, and presence of a particular event with all documented possible causative and remedial elements, including best guess probability information. Those knowledgeable in the art will recognize that while examples here focus on having stores of information pertaining to time, the use of the invention is not limited to such contexts as there are other fields where having a store of existing data would be critical to predictive analysis of streaming data 561. The search parameters used by the batch event analysis software module 550 are preset by those conducting the analysis at the beginning of the process, however, as the search matures and results are gleaned from the streaming data during transformation pipeline software module 561 operation, providing the system more timely event progress details, the system sanity and retrain software module 563 may automatically update the batch analysis parameters 550. Alternately, findings outside the system may precipitate the authors of the analysis to tune the batch analysis parameters administratively from outside the system 570, 562, 563. The real-time data analysis core 560 of the invention should be considered made up of a transformation pipeline software module 561, messaging module 562 and system sanity and retrain software module 563. The messaging module 562 has connections from both the batch and the streaming data analysis pathways and serves as a conduit for operational as well as result information between those two parts of the invention. The message module also receives messages from those administering analyses 580. Messages aggregated by the messaging module 562 may then be sent to system sanity and retrain software module 563 as appropriate. Several of the functions of the system sanity and retrain software module have already been disclosed. Briefly, this is software that may be used to monitor the progress of streaming data analysis optimizing coordination between streaming and batch analysis pathways by modifying or “retraining” the operation of the data filter software module 520, data formalization software module 530 and batch event analysis software module 540 and the transformation pipeline module 550 of the streaming pathway when the specifics of the search may change due to results produced during streaming analysis. System sanity and retrain module 563 may also monitor for data searches or transformations that are processing slowly or may have hung and for results that are outside established data stability boundaries so that actions can be implemented to resolve the issue. While the system sanity and retrain software module 563 may be designed to act autonomously and employs computer learning algorithms, according to some arrangements status updates may be made by administrators or potentially direct changes to operational parameters by such, according to the embodiment.

Streaming data entering from the outside data feeds 510 through the data filter software module 520 may be analyzed in real time within the transformation pipeline software module 561. Within a transformation pipeline, a set of functions tailored to the analysis being run are applied to the input data stream. According to the embodiment, functions may be applied in a linear, directed path or in more complex configurations. Functions may be modified over time during an analysis by the system sanity and retrain software module 563 and the results of the transformation pipeline, impacted by the results of batch analysis are then output in the format stipulated by the authors of the analysis which may be human readable printout, an alarm, machine readable information destined for another system or any of a plurality of other forms known to those in the art.

FIG. 6 (Prior Art) is a block diagram of a preferred architecture for a transformation pipeline within a system for predictive analysis of very large data sets using distributed computational graph 600. According to the embodiment, streaming input from the data filter software module 520, 615 serves as input to the first transformation node 620 of the transformation pipeline. Transformation node's function is performed on input data stream and transformed output message 625 is sent to transformation node 2 630. The progression of transformation nodes 620, 630, 640, 650, 660 and associated output messages from each node 625, 635, 645, 655 is linear in configuration this is the simplest arrangement and, as previously noted, represents the current state of the art. While transformation nodes are described according to various embodiments as uniform shape (referring to FIGS. 6-9), such uniformity is used for presentation simplicity and clarity and does not reflect necessary operational similarity between transformations within the pipeline. It should be appreciated that one knowledgeable in the field will realize that certain transformations in a pipeline may be entirely self-contained; certain transformations may involve direct human interaction 630, such as selection via dial or dials, positioning of switch or switches, or parameters set on control display, all of which may change during analysis; other transformations may require external aggregation or correlation services or may rely on remote procedure calls to synchronous or asynchronous analysis engines as might occur in simulations among a plurality of other possibilities. Further according to the embodiment, individual transformation nodes in one pipeline may represent function of another transformation pipeline. It should be appreciated that the node length of transformation pipelines depicted in no way confines the transformation pipelines employed by the invention to an arbitrary maximum length 640, 650, 660 as, being distributed, the number of transformations would be limited by the resources made available to each implementation of the invention. It should be further appreciated that there need be no limits on transform pipeline length. Output of the last transformation node and by extension, the transform pipeline 660 may be sent back to messaging software module 562 for predetermined action.

FIG. 7 is a block diagram of another preferred architecture for a transformation pipeline within a system for predictive analysis of very large data sets using distributed computational graph 700. According to the embodiment, streaming input from a data filter software module 520, 705 serves as input to the first transformation node 710 of the transformation pipeline. Transformation node's function is performed on input data stream and transformed output message 715 is sent to transformation node 2 720. In this embodiment, transformation node 2 720 has a second input stream 760. The specific source of this input is inconsequential to the operation of the invention and could be another transformation pipeline software module, a data store, human interaction, physical sensors, monitoring equipment for other electronic systems or a stream from the internet as from a crowdsourcing campaign, just to name a few possibilities 760. Functional integration of a second input stream into one transformation node requires the two input stream events be serialized. The invention performs this serialization using a decomposable transformation software module (not shown), the function of which is described below, referring to FIG. 13. While transformation nodes are described according to various embodiments as uniform shape (referring to FIGS. 6-9), such uniformity is used for presentation simplicity and clarity and does not reflect necessary operational similarity between transformations within the pipeline. It should be appreciated that one knowledgeable in the field will realize that certain transformations in a pipeline may be entirely self-contained; certain transformations may involve direct human interaction 630, such as selection via dial or dials, positioning of switch or switches, or parameters set on control display, all of which may change during analysis; other transformations may require external aggregation or correlation services or may rely on remote procedure calls to synchronous or asynchronous analysis engines as might occur in simulations among a plurality of other possibilities. Further according to the embodiment, individual transformation nodes in one pipeline may represent function of another transformation pipeline. It should be appreciated that the node length of transformation pipelines depicted in no way confines the transformation pipelines employed by the invention to an arbitrary maximum length 710, 720, 730, 740, 750, as, being distributed, the number of transformations would be limited by the resources made available to each implementation of the invention. It should be further appreciated that there need be no limits on transform pipeline length. Output of the last transformation node and by extension, the transform pipeline, 750 may be sent back to messaging software module 562 for pre-decided action.

FIG. 8 is a block diagram of another preferred architecture for a transformation pipeline within a system for predictive analysis of very large data sets using distributed computational graph 700. According to the embodiment, streaming input from a data filter software module 520, 805 serves as input to the first transformation node 810 of the transformation pipeline. Transformation node's function is performed on input data stream and transformed output message 815 is sent to transformation node 2 820. In this embodiment, transformation node 2 820 sends its output stream to two transformation pipelines 830, 840, 850; 865, 875. This allows the same data stream to undergo two disparate, possibly completely unrelated, analyses without having to duplicate the infrastructure of the initial transform manipulations, greatly increasing the expressivity of the invention over current transform pipelines. Functional integration of a second output stream from one transformation node 820 requires that the two output stream events be serialized. The invention performs this serialization using a decomposable transformation software module (not shown), the function of which is described below, referring to FIG. 14. While transformation nodes are described according to various embodiments as uniform shape (referring to FIGS. 6-9), such uniformity is used for presentation simplicity and clarity and does not reflect necessary operational similarity between transformations within the pipeline. It should be appreciated that one knowledgeable in the field will realize that certain transformations in pipelines, which may be entirely self-contained; certain transformations may involve direct human interaction 630, such as selection via dial or dials, positioning of switch or switches, or parameters set on control display, all of which may change during analysis; other transformations may require external aggregation or correlation services or may rely on remote procedure calls to synchronous or asynchronous analysis engines as might occur in simulations, among a plurality of other possibilities. Further according to the embodiment, individual transformation nodes in one pipeline may represent function of another transformation pipeline. It should be appreciated that the node number of transformation pipelines depicted in no way confines the transformation pipelines employed by the invention to an arbitrary maximum length 810, 820, 830, 840, 850; 865, 875 as, being distributed, the number of transformations would be limited by the resources made available to each implementation of the invention. Further according to the embodiment, there need be no limits on transform pipeline length. Output of the last transformation node and by extension, the transform pipeline 850 may be sent back to messaging software module 562 for contemporary enabled action.

FIG. 9 is a block diagram of another preferred architecture for a transformation pipeline within a system for predictive analysis of very large data sets using distributed computational graph 700. According to the embodiment, streaming input from a data filter software module 520, 905 serves as input to the first transformation node 910 of the transformation pipeline. Transformation node's function may be performed on an input data stream and transformed output message 915 may then be sent to transformation node 2 920. Likewise, once the data stream is acted upon by transformation node 2 920, its output is sent to transformation node 3 930 using its output message 925 In this embodiment, transformation node 3 930 sends its output stream back to transform node 1 910 forming a cyclical relationship between transformation nodes 1 910, transformation node 2 920 and transformation node 3 930. Upon the achievement of some gateway result, the output of cyclical pipeline activity may be sent to downstream transformation nodes within the pipeline 940, 945. The presence of a generalized cyclical pathway construct allows the invention to be used to solve complex iterative problems with large data sets involved, expanding ability to rapidly retrieve conclusions for complicated issues. Functional creation of a cyclical transformation pipeline requires that each cycle be serialized. The invention performs this serialization using a decomposable transformation software module (not shown), the function of which is described below, referring to FIG. 15. While transformation nodes are described according to various embodiments as uniform shape (referring to FIGS. 6-9), such uniformity is used for presentation simplicity and clarity and does not reflect necessary operational similarity between transformations within the pipeline. It should be appreciated that one knowledgeable in the field will appreciate that certain transformations in pipelines, may be entirely self-contained; certain transformations may involve direct human interaction 630, such as selection via dial or dials, positioning of switch or switches, or parameters set on control display, all of which may change during analysis; still other transformations may require external aggregation or correlation services or may rely on remote procedure calls to synchronous or asynchronous analysis engines as might occur in simulations, among a plurality of other possibilities. Further according to the embodiment, individual transformation nodes in one pipeline may represent the cumulative function of another transformation pipeline. It should be appreciated that the node number of transformation pipelines depicted in no way confines the transformation pipelines employed by the invention to an arbitrary maximum length 910, 920, 930, 940, 950; 965, 975 as, being distributed, the number of transformations would be limited by the resources made available to each implementation of the invention. It should be further appreciated that there need be no limits on transform pipeline length. Output of the last transformation node and by extension, the transform pipeline 955 may be sent back to messaging software module 562 for concomitant enabled action.

DESCRIPTION OF METHOD EMBODIMENTS

FIG. 10 is a process flow diagram of a method 1000 for predictive analysis of very large data sets using the distributed computational graph. One or more streams of data from a plurality of sources, which includes, but is in no way not limited to, a number of physical sensors, web based questionnaires and surveys, monitoring of electronic infrastructure, crowd sourcing campaigns, and direct human interaction, may be received by system 1001. The received stream is filtered 1002 to exclude data that has been corrupted, data that is incomplete or misconfigured and therefore unusable, data that may be intact but nonsensical within the context of the analyses being run, as well as a plurality of predetermined analysis related and unrelated criteria set by the authors. Filtered data may be split into two identical streams at this point (second stream not depicted for simplicity), wherein one substream may be sent for batch processing 1600 while another substream may be formalized 1003 for transformation pipeline analysis 1004, 561, 600, 700, 800, 900. Data formalization for transformation pipeline analysis acts to reformat the stream data for optimal, reliable use during analysis. Reformatting might entail, but is not limited to: setting data field order, standardizing measurement units if choices are given, splitting complex information into multiple simpler fields, and stripping unwanted characters, again, just to name a few simple examples. The formalized data stream may be subjected to one or more transformations. Each transformation acts as a function on the data and may or may not change the data. Within the invention, transformations working on the same data stream where the output of one transformation acts as the input to the next are represented as transformation pipelines. While the great majority of transformations in transformation pipelines receive a single stream of input, modify the data within the stream in some way and then pass the modified data as output to the next transformation in the pipeline, the invention does not require these characteristics. According to the embodiment, individual transformations can receive input of expected form from more than one source 1300 or receive no input at all as would a transformation acting as a timestamp. According to the embodiment, individual transformations, may not modify the data as would be encountered with a data store acting as a queue for downstream transformations 1303, 1305, 1405, 1407,1505. According to the embodiment, individual transformations may provide output to more than one downstream transformations 1400. This ability lends itself to simulations where multiple possible choices might be made at a single step of a procedure all of which need to be analyzed. While only a single, simple use case has been offered for each example, in each case, that example was chosen for simplicity of description from a plurality of possibilities, the examples given should not be considered to limit the invention to only simplistic applications. Last, according to the invention, transformations in a transformation pipeline backbone may form a linear, a quasi-linear arrangement or may be cyclical 1500, where the output of one of the internal transformations serves as the input of one of its antecedents allowing recursive analysis to be run. The result of transformation pipeline analysis may then be modified by results from batch analysis of the data stream 1600 and output in format predesigned by the authors of the analysis with could be human readable summary printout, human readable instruction printout, human-readable raw printout, data store, or machine encoded information of any format known to the art to be used in further automated analysis or action schema.

FIG. 11 is a process flow diagram of a method 1100 for an embodiment of modeling the transformation pipeline module 561 of the invention as a directed graph using graph theory. According to the embodiment, the individual transformations 1102, 1104, 1106 of the transformation pipeline t₁. . . t_nsuch that each t_iT are represented as graph nodes. Transformations belonging to T are discrete transformations over individual datasets d_i, consistent with classical functions. As such, each individual transformation t_i, receives a set of inputs and produces a single output. The input of an individual transformation t_i, is defined with the function in: t_id₁. . . d_ksuch that in(t_i)={d₁. . . d_k} and describes a transformation with k inputs. Similarly, the output of an individual transformation is defined as the function out: t_i[d₁] to describe transformations that produce a single output (usable by other transformations). A dependency function can now be defined such that dep(t_a,t_b) out(t_a)in(t_b) The messages carrying the data stream through the transformation pipeline 1101,1103, 1105 make up the graph edges. Using the above definitions, then, a transformation pipeline within the invention can be defined as G=(V,E) where message(t₁,t₂. . . t(_n-1),t_n)V and all transformations t₁. . . t_nand all dependencies dep(t_i, t_j)E 1107.

FIG. 12 (Prior Art) is a process flow diagram of a method 1200 for one embodiment of a linear transformation pipeline 1201. This is the simplest of configurations as the input stream is acted upon by the first transformation node 1202 and the remainder of the transformations within the pipeline are then performed sequentially 1202, 1203, 1204, 1205 for the entire pipeline with no introduction of new data internal to the initial node or splitting output stream prior to last node of the pipeline 1205. This configuration is the current state of the art for transformation pipelines and is the most general form of these constructs. Linear transformation pipelines require no special manipulation to simplify the data pathway and are thus referred to as non-decomposable. The example depicted in this diagram was chosen to convey the configuration of a linear transformation pipeline and is the simplest form of the configuration felt to show the point. It in no way implies limitation of the invention.

FIG. 13 is a process flow diagram of a method 1300 for one embodiment of a transformation pipeline where one transformation node 1307 in a transformation pipeline receives data streams from two source transformation nodes 1301. The invention handles this transformation pipeline configuration by decomposing or serializing the input events 1302-1303, 1304-1305 heavily relying on post transformation function continuation. The results of individual transformation nodes 1302, 1304 just antecedent to the destination transformation node 1306 and placed into a single specialized data storage transformation node 1303, 1305 (shown twice as process occurs twice). The combined results then retrieved from the data store 1306 and serve as the input stream for the transformation node within the transformation pipeline backbone 1307, 1308. The example depicted in this diagram was chosen to convey the configuration of transformation pipelines with individual transformation nodes that receive input from two source nodes 1302, 1304 and is the simplest form of the configuration felt to show the point. It in no way implies limitation of the invention. One knowledgeable in the art will realize the great number of permutations and topologies possible, especially as the invention places no design restrictions on the number of transformation nodes receiving input from greater than one sources or the number sources providing input to a destination node.

FIG. 14 is a process flow diagram of a method 1400 for one embodiment of a transformation pipeline where one transformation node 1403 in a transformation pipeline sends output data stream to two destination transformation nodes 1401, 1406, 1408 in potentially two separate transformation pipelines. The invention handles this transformation pipeline configuration by decomposing or serializing the output events 1404,1405-1406, 1407-1408. The results of the source transformation node 1403 just antecedent to the destination transformation nodes 1406 and placed into a single specialized data storage transformation node 1404, 1405, 1407 (shown three times as storage occurs and retrieval occurs twice). The results of the antecedent transformation node may then be retrieved from a data store 1404 and serves as the input stream for the transformation nodes two downstream transformation pipeline 1406, 1408. The example depicted in this diagram was chosen to convey the configuration of transformation pipelines with individual transformation nodes that send output streams to two destination nodes 1406, 1408 and is the simplest form of the configuration felt to show the point. It in no way implies limitation of the invention. One knowledgeable in the art will realize the great number of permutations and topologies possible, especially as the invention places no design restrictions on the number of transformation nodes sending output to greater than one destination or the number destinations receiving input from a source node.

FIG. 15 is a process flow diagram of a method 1500 for one embodiment of a transformation pipeline where the topology of all or part of the pipeline is cyclical 1501. In this configuration the output stream of one transformation node 1504 acts as an input of an antecedent transformation node within the pipeline 1502 serialization or decomposition linearizes this cyclical configuration by completing the transformation of all of the nodes that make up a single cycle 1502, 1503, 1504 and then storing the result of that cycle in a data store 1505. That result of a cycle is then reintroduced to the transformation pipeline as input to the first transformation node of the cycle. As this configuration is by nature recursive, special programming to unfold the recursions was developed for the invention to accommodate it. The example depicted in this diagram was chosen to convey the configuration of transformation pipelines with individual transformation nodes that for a cyclical configuration 1501, 1502, 1503, 1504 and is the simplest form of the configuration felt to show the point. It in no way implies limitation of the invention. One knowledgeable in the art will realize the great number of permutations and topologies possible, especially as the invention places no design restrictions on the number of transformation nodes participating in a cycle nor the number of cycles in a transformation pipeline.

FIG. 16 is a process flow diagram of a method 1600 for one embodiment of the batch data stream analysis pathway which forms part of the invention and allows streaming data to be interpreted with historic context. One or more streams of data from a plurality of sources, which includes, but is in no way not limited to, a number of physical sensors, web based questionnaires and surveys, monitoring of electronic infrastructure, crowd sourcing campaigns, and direct human interaction, is received by the system 1601. The received stream may be filtered 1602 to exclude data that has been corrupted, data that is incomplete or misconfigured and therefore unusable, data that may be intact but nonsensical within the context of the analyses being run, as well as a plurality of predetermined analysis related and unrelated criteria set by the authors. Data formalization 1603 for batch analysis acts to reformat the stream data for optimal, reliable use during analysis. Reformatting might entail, but is not limited to: setting data field order, standardizing measurement units if choices are given, splitting complex information into multiple simpler fields, and stripping unwanted characters, again, just to name a few simple examples. The filtered and formalized stream is then added to a distributed data store 1604 due to the vast amount of information accrued over time. The invention has no dependency for specific data stores or data retrieval model. During transformation pipeline analysis of the streaming pipeline, data stored in the batch pathway store can be used to track changes in specifics of the data important to the ongoing analysis over time, repetitive data sets significant to the analysis or the occurrence of critical points of data 1605. The functions of individual transformation nodes 620 may be saved and can be edited also all nodes of a transformation pipeline 600 keep a summary or summarized view (analogous to a network routing table) of applicable parts of the overall route of the pipeline along with detailed information pertaining to adjacent two nodes. This framework information enables steps to be taken and notifications to be passed if individual transformation nodes 640 within a transformation pipeline 600 become unresponsive during analysis operations. Combinations of results from the batch pathway, partial and streaming output results from the transformation pipeline, administrative directives from the authors of the analysis as well as operational status messages from components of the distributed computational graph are used to perform system sanity checks and retraining of one or more of the modules of the system 1606. These corrections are designed to occur without administrative intervention under all but the most extreme of circumstances with deep learning capabilities present as part of the system manager and retrain module 563 responsible for this task.

The skilled person will be aware of a range of possible modifications of the various embodiments described above. Accordingly, the present invention is defined by the claims and their equivalents.

Claims

1. A system comprising: a distributed computing network comprising a first plurality of computer systems, a second plurality of computer systems, and a third plurality of computer systems, wherein a first computer system of the first plurality of computer systems is configured to execute first software instructions that: receive a first stream of data,process first portions of the first stream of data by applying a first transformation pipeline to the first portions of the first stream of data to generate first pipeline output messages, andtransmit the first pipeline output messages;wherein a second computer system of the first plurality of computer systems is configured to execute second software instructions that: process first portions of the first pipeline output messages by applying a second transformation pipeline to the first portions of the first pipeline output messages;wherein a third computer system of the second plurality of computer systems comprises a memory that stores a first data, wherein the first data represents a portion of a distributed computational graph,and wherein the portion of the distributed computational graph describes a flow of data from the first transformation pipeline to an input of the second transformation pipeline;wherein the third computer system is configured to execute third software instructions that: process the first data to determine information about at least one of the first transformation pipeline and the second transformation pipeline,monitor at least a portion of the execution of at least one of the first software instructions and the second software instructions in accordance with the determined information, andin response to the monitoring, cause a fourth computer system of the third plurality of computer systems to execute fourth software instructions that perform at least one of: processing second portions of the first stream of data by applying the first transformation pipeline to the second portions of the first stream of data, orprocessing second portions of the first pipeline output messages by applying a second transformation pipeline to the second portions of the first pipeline output messages,wherein the first computer system and the third computer system are distinct, andwherein the third computer system and the fourth computer system are distinct.
2. The system of claim 1, wherein the third software instructions monitor at least a portion of the execution of at least one of the first software instructions and the second software instructions to identify execution that has become unresponsive.
3. The system of claim 1, wherein the first computer system and the second computer system are distinct.
4. The system of claim 1, wherein the first computer system and the second computer system each further comprise one or more memories that each store a respective second data, wherein the respective second data represents at least a respective portion of the distributed computational graph,and wherein the first software instructions transmit the first pipeline output messages according to the flow of the distributed computational graph.
5. The system of claim 1, wherein the third software instructions are further configured to monitor at least a portion of the execution of at least one of the first software instructions and the second software instructions, to identify a transformation pipeline that causes at least one of the first computer system and the second computer system to transmit information that is outside established data stability boundaries.
6. The system of claim 5, wherein the third computer system of the second plurality of computer systems is further configured to execute fifth software instructions that, upon identifying transmitted information that is outside established data stability boundaries: determine changes to at least one of the first transformation pipeline and the second transformation pipeline in response to the identifying,and cause at least one of the first computer system and the second computer system to execute sixth software instructions that modify a transformation pipeline in response to the determined changes.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 18/581,375, filed Feb. 20, 2024; which is a continuation of U.S. patent application Ser. No. 17/189,161, filed Mar. 1, 2021; which is a continuation-in-part of U.S. patent application Ser. No. 17/061,195, filed Oct. 1, 2020, now issued as U.S. Pat. No. 11,570,214 on Jan. 31, 2023; which is a continuation-in-part of U.S. patent application Ser. No. 17/035,029, filed Sep. 28, 2020, now issued as U.S. Pat. No. 11,546,380 on Jan. 3, 2023; which is a continuation-in-part of U.S. patent application Ser. No. 17/008,276, filed Aug. 31, 2020, now issued as U.S. Pat. No. 11,323,484 on May 3, 2022; which is a continuation-in-part of U.S. patent application Ser. No. 17/000,504, filed Aug. 24, 2020, now issued as U.S. Pat. No. 11,477,245 on Oct. 18, 2022; which is a continuation-in-part of U.S. patent application Ser. No. 16/855,724, filed on Apr. 22, 2020, now issued as U.S. Pat. No. 11,218,510 on Jan. 4, 2022; which is a continuation-in-part of U.S. patent application Ser. No. 16/836,717, filed on Mar. 31, 2020, now issued as U.S. Pat. No. 10,917,428 on Feb. 9, 2021; which is a continuation-in-part of U.S. patent application Ser. No. 15/887,496, filed Feb. 2, 2018, now issued as U.S. Pat. No. 10,783,241 on Sep. 22, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/823,285, filed Nov. 27, 2017, now issued as U.S. Pat. No. 10,740,096 on Aug. 11, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/788,718, filed Oct. 19, 2017, now issued as U.S. Pat. No. 10,861,014 on Dec. 8, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/788,002, filed on Oct. 19, 2017; which is a continuation-in-part of U.S. patent application Ser. No. 15/787,601, filed on Oct. 18, 2017, now issued as U.S. Pat. No. 10,860,660 on Dec. 8, 2020; which claims the benefit of U.S. Provisional Pat. App. No. 62/568,312, filed on Oct. 4, 2017; said application Ser. No. 15/787,601 is a continuation-in-part of U.S. patent application Ser. No. 15/616,427, filed on Jun. 7, 2017; which is a continuation-in-part of U.S. patent application Ser. No. 14/925,974 (which is explicitly incorporated by reference in its entirety herein), filed Oct. 28, 2015; said application Ser. No. 15/788,002 claims the benefit of U.S. Provisional Pat. App. No. 62/568,305, filed Oct. 4, 2017; said application Ser. No. 15/788,718 claims the benefit of U.S. Provisional Pat. App. No. 62/568,307, filed Oct. 4, 2017; said application Ser. No. 15/887,496 is a continuation-in-part of U.S. patent application Ser. No. 15/818,733, filed Nov. 20, 2017, now issued as U.S. Pat. No. 10,673,887 on Jun. 2, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/725,274, filed Oct. 4, 2017, now issued as U.S. Pat. No. 10,609,079 on Mar. 31, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/655,113, filed Jul. 20, 2017, now issued as U.S. Pat. No. 10,735,456 on Aug. 4, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/616,427, filed Jun. 7, 2017; said application Ser. No. 15/655,113 is a continuation-in-part of U.S. patent application Ser. No. 15/237,625, filed Aug. 15, 2016, now issued as U.S. Pat. No. 10,248,910 on Apr. 2, 2019; which is a continuation-in-part of U.S. patent application Ser. No. 15/206,195, filed Jul. 8, 2016; which is a continuation-in-part of U.S. patent application Ser. No. 15/186,453, filed Jun. 18, 2016; which is a continuation-in-part of U.S. patent application Ser. No. 15/166,158, filed May 26, 2016; which is a continuation-in-part of U.S. patent application Ser. No. 15/141,752, filed Apr. 28, 2016, now issued as U.S. Pat. No. 10,860,962 on Dec. 8, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/091,563, filed Apr. 5, 2016, now issued as U.S. Pat. No. 10,204,147 on Feb. 12, 2019; said application Ser. No. 15/141,752 is a continuation-in-part of U.S. patent application Ser. No. 14/986,536, filed Dec. 31, 2015, now issued as U.S. Pat. No. 10,210,255 on Feb. 19, 2019; said application Ser. No. 15/141,752 is a continuation-in-part of U.S. patent application Ser. No. 14/925,974, filed Oct. 28, 2015; said application Ser. No. 16/855,724 is a continuation-in-part of U.S. patent application Ser. No. 16/777,270, filed Jan. 30, 2020, now issued as U.S. Pat. No. 11,025,674 on Jun. 1, 2021; which is a continuation-in-part of U.S. patent application Ser. No. 16/720,383, filed Dec. 19, 2019, now issued as U.S. Pat. No. 10,944,795 on Mar. 9, 2021; which is a continuation of U.S. patent application Ser. No. 15/823,363, filed Nov. 27, 2017, now issued as U.S. Pat. No. 10,560,483 on Feb. 11, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/725,274, filed Oct. 4, 2017, now issued as U.S. Pat. No. 10,609,079 on Mar. 31, 2020; said application Ser. No. 17/000,504 is a continuation-in-part of U.S. patent application Ser. No. 16/412,340, filed May 14, 2019, now issued as U.S. Pat. No. 11,539,663 on Dec. 27, 2022; which is a continuation-in-part of U.S. patent application Ser. No. 16/267,893, filed Feb. 5, 2019; which is a continuation-in-part of U.S. patent application Ser. No. 16/248,133, filed Jan. 15, 2019; which is a continuation-in-part of U.S. patent application Ser. No. 15/849,901, filed Dec. 21, 2017, now issued as U.S. Pat. No. 11,023,284 on Jun. 1, 2021; which is a continuation-in-part of U.S. patent application Ser. No. 15/835,436, filed Dec. 17, 2017, now issued as U.S. Pat. No. 10,572,828 on Feb. 5, 2020; which is a continuation-in-part of U.S. patent application Ser. No. 15/790,457, filed Oct. 23, 2017, now issued as U.S. Pat. No. 10,884,999 on Jan. 5, 2021; which is a continuation-in-part of U.S. patent application Ser. No. 15/790,327, filed on Oct. 23, 2017, now issued as U.S. Pat. No. 10,860,951 on Dec. 8, 2020; which claims the benefit of U.S. Provisional Pat. App. No. 62/568,291, filed Oct. 4, 2017; said application Ser. No. 15/790,327 is a continuation-in-part of U.S. patent application Ser. No. 15/616,427, filed Jun. 7, 2017; said application Ser. No. 15/790,327 is a continuation-in-part of U.S. patent application Ser. No. 15/141,752, filed Apr. 28, 2016, now issued as U.S. Pat. No. 10,860,962 on Dec. 8, 2020; said application Ser. No. 15/790,457 claims the benefit of U.S. Provisional Pat. App. No. 62/568,298, filed Oct. 4, 2017; said application Ser. No. 15/849,901 is a continuation-in-part of U.S. patent application Ser. No. 15/835,312, filed Dec. 7, 2017, now issued as U.S. Pat. No. 11,055,451 on Jul. 6, 2021; which is a continuation-in-part of U.S. patent application Ser. No. 15/186,453, filed Jun. 18, 2016; said application Ser. No. 16/248,133 is a continuation-in-part of U.S. patent application Ser. No. 15/813,097, filed Nov. 14, 2017; which is a continuation-in-part of Ser. No. 15/616,427, filed Jun. 7, 2017; said application Ser. No. 16/248,133 is a continuation-in-part of U.S. patent application Ser. No. 15/806,697, filed Nov. 8, 2017; which is a continuation-in-part of U.S. patent application Ser. No. 15/376,657, filed Dec. 13, 2016, now issued as U.S. Pat. No. 10,402,906 on Sep. 3, 2019; which is a continuation-in-part of U.S. patent application Ser. No. 15/237,625, filed Aug. 15, 2016, now issued as U.S. Pat. No. 10,248,910 on Apr. 2, 2019; said application Ser. No. 15/806,697 is a continuation-in-part of U.S. patent application Ser. No. 15/343,209, filed Nov. 4, 2016, now issued as U.S. Pat. No. 11,087,403 on Aug. 10, 2021; which is a continuation-in-part of U.S. patent application Ser. No. 15/237,625, filed Aug. 15, 2016, now issued as U.S. Pat. No. 10,248,910 on Apr. 2, 2019; said application Ser. No. 15/343,209 is a continuation-in-part of U.S. patent application Ser. No. 15/229,476, filed Aug. 5, 2016, now issued as U.S. Pat. No. 10,454,791 on Oct. 22, 2019; which is a continuation-in-part of U.S. patent application Ser. No. 15/206,195, filed Jul. 8, 2016; said application Ser. No. 16/248,133 is a continuation-in-part of U.S. patent application Ser. No. 15/673,368, filed Aug. 9, 2017; which is a continuation-in-part of U.S. patent application Ser. No. 15/376,657, filed Dec. 13, 2016, now issued as U.S. Pat. No. 10,402,906 on Sep. 3, 2019; said application Ser. No. 17/061,195 is a continuation-in-part of U.S. patent application Ser. No. 15/879,801, filed Jan. 25, 2018; which is a continuation-in-part of U.S. patent application Ser. No. 15/379,899, filed Dec. 15, 2016; which is a continuation-in-part of U.S. patent application Ser. No. 15/376,657, filed Dec. 13, 2016, now issued as U.S. Pat. No. 10,402,906 on Sep. 3, 2019; said application Ser. No. 17/189,161 is a continuation-in-part of U.S. patent application Ser. No. 16/709,598, filed Dec. 10, 2019, now issued as U.S. Pat. No. 11,507,858 on Nov. 22, 2022; which is a continuation-in-part of U.S. patent application Ser. No. 14/925,974, filed Oct. 28, 2015.

US Referenced Citations (410)

Number	Name	Date	Kind
3370192	Schwartz et al.	Feb 1968	A
5669000	Jessen et al.	Sep 1997	A
5953011	Matsuoka	Sep 1999	A
6256544	Weissinger	Jul 2001	B1
6477572	Elderton et al.	Nov 2002	B1
6629167	Undy	Sep 2003	B1
6857073	French et al.	Feb 2005	B2
6906709	Larkin et al.	Jun 2005	B1
7072863	Phillips et al.	Jul 2006	B1
7139747	Najork	Nov 2006	B1
7171515	Ohta et al.	Jan 2007	B2
7222366	Bruton, III et al.	May 2007	B2
7227948	Ohkuma et al.	Jun 2007	B2
7266821	Polizzi et al.	Sep 2007	B2
7281125	Challener et al.	Oct 2007	B2
7310632	Meek et al.	Dec 2007	B2
7373524	Motsinger et al.	May 2008	B2
7437718	Fournet et al.	Oct 2008	B2
7448046	Navani et al.	Nov 2008	B2
7480940	Agbabian et al.	Jan 2009	B1
7493593	Koehler	Feb 2009	B2
7530105	Gilbert et al.	May 2009	B2
7546207	Nix et al.	Jun 2009	B2
7546333	Alon et al.	Jun 2009	B2
7546637	Agbabian et al.	Jun 2009	B1
7603709	Lewis et al.	Oct 2009	B2
7603714	Johnson et al.	Oct 2009	B2
7653188	Kloberdans et al.	Jan 2010	B2
7657406	Tolone et al.	Feb 2010	B2
7660815	Scofield et al.	Feb 2010	B1
7685296	Brill et al.	Mar 2010	B2
7698213	Lancaster	Apr 2010	B2
7702821	Feinberg et al.	Apr 2010	B2
7739653	Venolia	Jun 2010	B2
7743421	Cosquer et al.	Jun 2010	B2
7774335	Scofield et al.	Aug 2010	B1
7818224	Boerner	Oct 2010	B2
7818417	Ginis et al.	Oct 2010	B2
7840677	Li et al.	Nov 2010	B2
7925561	Xu	Apr 2011	B2
7933926	Ebert	Apr 2011	B2
8006303	Dennerline et al.	Aug 2011	B1
8055712	Kagawa et al.	Nov 2011	B2
8065257	Kuecuekyan	Nov 2011	B2
8069190	McColl et al.	Nov 2011	B2
8116450	Agrawal et al.	Feb 2012	B2
8132260	Mayer et al.	Mar 2012	B1
8156029	Szydlo	Apr 2012	B2
8205259	Stute	Jun 2012	B2
8209274	Lin et al.	Jun 2012	B1
8245302	Evans et al.	Aug 2012	B2
8346753	Hayes	Jan 2013	B2
8352347	Howard et al.	Jan 2013	B2
8352412	Alba et al.	Jan 2013	B2
8370192	Deo et al.	Feb 2013	B2
8380843	Loizeaux et al.	Feb 2013	B2
8386519	Kenedy et al.	Feb 2013	B2
8407800	Schlegel et al.	Mar 2013	B2
8417656	Beg et al.	Apr 2013	B2
8457996	Winkler et al.	Jun 2013	B2
8495521	Fried	Jul 2013	B2
8516594	Bennett et al.	Aug 2013	B2
8516596	Sandoval et al.	Aug 2013	B2
8548777	Sturrock et al.	Oct 2013	B2
8566945	Sima	Oct 2013	B2
8583639	Chitnis et al.	Nov 2013	B2
8595240	Otey et al.	Nov 2013	B1
8601554	Gordon et al.	Dec 2013	B2
8601587	Powell et al.	Dec 2013	B1
8607197	Barcia et al.	Dec 2013	B2
8615800	Baddour et al.	Dec 2013	B2
8654127	Kenttala et al.	Feb 2014	B2
8677473	Dennerline et al.	Mar 2014	B2
8707275	Mascaro et al.	Apr 2014	B2
8712596	Scott	Apr 2014	B2
8725597	Mauseth et al.	May 2014	B2
8726393	Macy et al.	May 2014	B2
8751867	Marvasti et al.	Jun 2014	B2
8752178	Coates et al.	Jun 2014	B2
8781990	de Alfaro et al.	Jul 2014	B1
8782080	Lee et al.	Jul 2014	B2
8788306	Delurgio et al.	Jul 2014	B2
8793758	Raleigh et al.	Jul 2014	B2
8806361	Noel et al.	Aug 2014	B1
8813234	Bowers et al.	Aug 2014	B1
8819772	Bettini et al.	Aug 2014	B2
8826426	Dubey	Sep 2014	B1
8839440	Yun et al.	Sep 2014	B2
8897900	Smith et al.	Nov 2014	B2
8898442	Stoitsev	Nov 2014	B2
8914878	Burns et al.	Dec 2014	B2
8949960	Berkman et al.	Feb 2015	B2
8959494	Howard	Feb 2015	B2
8990392	Stamos	Mar 2015	B1
8997233	Green et al.	Mar 2015	B2
9009837	Nunez Di Croce	Apr 2015	B2
9015708	Choudhury et al.	Apr 2015	B2
9021477	Choudhury et al.	Apr 2015	B2
9031870	Kenedy et al.	May 2015	B2
9043332	Noel et al.	May 2015	B2
9049207	Hugard, IV et al.	Jun 2015	B2
9069725	Jones	Jun 2015	B2
9092616	Kumar et al.	Jul 2015	B2
9100430	Seiver et al.	Aug 2015	B1
9110706	Yu et al.	Aug 2015	B2
9129108	Drissi et al.	Sep 2015	B2
9134966	Brock et al.	Sep 2015	B2
9137024	Swingler et al.	Sep 2015	B2
9152727	Balducci et al.	Oct 2015	B1
9166990	Eswaran et al.	Oct 2015	B2
9171079	Banka et al.	Oct 2015	B2
9185124	Chakraborty	Nov 2015	B2
9202040	Rosenblatt et al.	Dec 2015	B2
9203827	Srinivasan et al.	Dec 2015	B2
9210185	Pinney Wood et al.	Dec 2015	B1
9231962	Yen et al.	Jan 2016	B1
9235732	Eynon et al.	Jan 2016	B2
9253643	Pattar et al.	Feb 2016	B2
9256735	Stute	Feb 2016	B2
9262787	Binion et al.	Feb 2016	B2
9264395	Stamos	Feb 2016	B1
9276951	Choi et al.	Mar 2016	B2
9286103	Acharya et al.	Mar 2016	B2
9292692	Wallrabenstein	Mar 2016	B2
9292699	Stuntebeck et al.	Mar 2016	B1
9294498	Yampolskiy et al.	Mar 2016	B1
9300682	Burnham et al.	Mar 2016	B2
9319430	Bell, Jr. et al.	Apr 2016	B2
9336481	Ionson	May 2016	B1
9338061	Chen et al.	May 2016	B2
9344444	Lippmann et al.	May 2016	B2
9348602	Alapati	May 2016	B1
9349103	Eberhardt, III et al.	May 2016	B2
9369482	Borohovski et al.	Jun 2016	B2
9384345	Dixon et al.	Jul 2016	B2
9390376	Harrison et al.	Jul 2016	B2
9400962	Prasad	Jul 2016	B2
9438616	Singla et al.	Sep 2016	B2
9461876	Van Dusen et al.	Oct 2016	B2
9466041	Simitsis et al.	Oct 2016	B2
9467461	Balderas	Oct 2016	B2
9479720	Hegar	Oct 2016	B1
9495188	Ettema et al.	Nov 2016	B1
9501647	Yampolskiy et al.	Nov 2016	B2
9503467	Lefebvre et al.	Nov 2016	B2
9503472	Laidlaw et al.	Nov 2016	B2
9509716	Shabtai et al.	Nov 2016	B2
9515826	Whelan et al.	Dec 2016	B2
9516053	Muddu et al.	Dec 2016	B1
9521166	Wilson	Dec 2016	B2
9541982	Lipasti et al.	Jan 2017	B2
9558220	Nixon et al.	Jan 2017	B2
9560065	Neil et al.	Jan 2017	B2
9565204	Chesla	Feb 2017	B2
9571517	Vallone et al.	Feb 2017	B2
9578046	Baker	Feb 2017	B2
9596141	McDowall	Mar 2017	B2
9600792	Foehr et al.	Mar 2017	B2
9602513	Gamage et al.	Mar 2017	B2
9602529	Jones et al.	Mar 2017	B2
9602530	Ellis et al.	Mar 2017	B2
9609009	Muddu et al.	Mar 2017	B2
9609015	Natarajan et al.	Mar 2017	B2
9619291	Pueyo et al.	Apr 2017	B2
9639575	Leida et al.	May 2017	B2
9652538	Shivaswamy et al.	May 2017	B2
9652604	Johansson et al.	May 2017	B1
9654495	Hubbard et al.	May 2017	B2
9661019	Liu	May 2017	B2
9667600	Piqueras Jover et al.	May 2017	B2
9667641	Muddu et al.	May 2017	B2
9672283	Pappas et al.	Jun 2017	B2
9672355	Titonis et al.	Jun 2017	B2
9674211	Curcic et al.	Jun 2017	B2
9674249	Kekre et al.	Jun 2017	B1
9679125	Bailor et al.	Jun 2017	B2
9680867	Hughes et al.	Jun 2017	B2
9686293	Golshan et al.	Jun 2017	B2
9690645	Samuni et al.	Jun 2017	B2
9699205	Muddu et al.	Jul 2017	B2
9712553	Nguyen et al.	Jul 2017	B2
9721086	Shear et al.	Aug 2017	B2
9729421	Brech et al.	Aug 2017	B2
9729538	Plotnik et al.	Aug 2017	B2
9734169	Redlich et al.	Aug 2017	B2
9734220	Karpištšenko et al.	Aug 2017	B2
9736173	Li et al.	Aug 2017	B2
9749343	Watters et al.	Aug 2017	B2
9749344	Watters et al.	Aug 2017	B2
9753796	Mahaffey et al.	Sep 2017	B2
9756067	Boyadjiev et al.	Sep 2017	B2
9762443	Dickey	Sep 2017	B2
9771225	Stone et al.	Sep 2017	B2
9772934	Maag et al.	Sep 2017	B2
9774407	Hudson et al.	Sep 2017	B2
9774522	Vasseur et al.	Sep 2017	B2
9774616	Flores et al.	Sep 2017	B2
9781144	Otvagin et al.	Oct 2017	B1
9807104	Sarra	Oct 2017	B1
9832213	Underwood et al.	Nov 2017	B2
9842000	Bishop et al.	Dec 2017	B2
9858322	Theimer et al.	Jan 2018	B2
9860208	Ettema et al.	Jan 2018	B1
9875360	Grossman et al.	Jan 2018	B1
9882929	Ettema et al.	Jan 2018	B1
9886273	Eldar	Feb 2018	B1
9887933	Lawrence, III	Feb 2018	B2
9910993	Grossman et al.	Mar 2018	B2
9911088	Nath et al.	Mar 2018	B2
9917860	Senanayake et al.	Mar 2018	B2
9928366	Ladnai et al.	Mar 2018	B2
9930058	Carpenter et al.	Mar 2018	B2
9942295	Rider et al.	Apr 2018	B2
9946517	Talby et al.	Apr 2018	B2
9952899	Novaes	Apr 2018	B2
9954879	Sadaghiani et al.	Apr 2018	B1
9954884	Hassell et al.	Apr 2018	B2
9965627	Ray et al.	May 2018	B2
9967264	Harris et al.	May 2018	B2
9967265	Peer et al.	May 2018	B1
9967282	Thomas et al.	May 2018	B2
9967283	Ray et al.	May 2018	B2
9967625	Korst et al.	May 2018	B2
9984129	Patel et al.	May 2018	B2
9992228	Ray et al.	Jun 2018	B2
10009378	Chiviendacz et al.	Jun 2018	B2
10027711	Gill et al.	Jul 2018	B2
10038559	Burrows et al.	Jul 2018	B2
10044675	Ettema et al.	Aug 2018	B1
10050985	Mhatre et al.	Aug 2018	B2
10055473	Allen et al.	Aug 2018	B2
10061635	Ellwein	Aug 2018	B2
10074052	Banerjee et al.	Sep 2018	B2
10078664	Gustafson et al.	Sep 2018	B2
10083236	Crosby	Sep 2018	B2
10102480	Dirac et al.	Oct 2018	B2
10108907	Bugay et al.	Oct 2018	B2
10109014	Bischoff et al.	Oct 2018	B1
10110415	Radivojevic et al.	Oct 2018	B2
10120907	de Castro Alves et al.	Nov 2018	B2
10122687	Thomas et al.	Nov 2018	B2
10122764	Obaidi	Nov 2018	B1
10146592	Bishop et al.	Dec 2018	B2
10152676	Strom	Dec 2018	B1
10154049	Sancheti et al.	Dec 2018	B2
10162969	Knapp	Dec 2018	B2
10168691	Zornio et al.	Jan 2019	B2
10180780	Ainalem	Jan 2019	B2
10185832	Cam	Jan 2019	B2
10191768	Bishop et al.	Jan 2019	B2
10205735	Apostolopoulos	Feb 2019	B2
10210246	Stojanovic et al.	Feb 2019	B2
10210470	Partha Ray	Feb 2019	B2
10212176	Wang	Feb 2019	B2
10212184	Sweeney et al.	Feb 2019	B2
10216485	Misra et al.	Feb 2019	B2
10217348	Poder et al.	Feb 2019	B2
10261763	Fink et al.	Apr 2019	B2
10275545	Yeager et al.	Apr 2019	B2
10277629	Guntur	Apr 2019	B1
10284570	Schmidtler et al.	May 2019	B2
10289841	Tang et al.	May 2019	B2
10290141	Kennedy et al.	May 2019	B2
10298607	Tang et al.	May 2019	B2
10305902	Kim	May 2019	B2
10318739	Brucker et al.	Jun 2019	B2
10318882	Brueckner et al.	Jun 2019	B2
10320828	Derbeko et al.	Jun 2019	B1
10321278	Proctor	Jun 2019	B2
10324773	Wing et al.	Jun 2019	B2
10338913	Franchitti	Jul 2019	B2
10367829	Huang et al.	Jul 2019	B2
10380140	Sherman	Aug 2019	B2
10387124	Chaudhuri et al.	Aug 2019	B2
10387631	Duggal et al.	Aug 2019	B2
10410113	Clayton et al.	Sep 2019	B2
10410214	Doyle	Sep 2019	B2
10438001	Hariprasad	Oct 2019	B1
10440054	Robertson	Oct 2019	B2
10445482	Ren	Oct 2019	B2
10452664	Le Mouel et al.	Oct 2019	B2
10462112	Makmel et al.	Oct 2019	B1
10505954	Stokes, III et al.	Dec 2019	B2
10511498	Narayan et al.	Dec 2019	B1
10515062	Tidwell et al.	Dec 2019	B2
10515366	Gorelik et al.	Dec 2019	B1
10530796	Patterson et al.	Jan 2020	B2
10540624	Hui et al.	Jan 2020	B2
10579691	Levine et al.	Mar 2020	B2
10601854	Lokamathe et al.	Mar 2020	B2
10606454	Pani	Mar 2020	B2
10609059	Apostolopoulos	Mar 2020	B2
10628578	Eksten et al.	Apr 2020	B2
10643144	Bowers et al.	May 2020	B2
10645086	Hadler	May 2020	B1
10645100	Wang et al.	May 2020	B1
10673880	Pratt et al.	Jun 2020	B1
10715534	Sander et al.	Jul 2020	B2
10740358	Chan et al.	Aug 2020	B2
10764321	Bower, III et al.	Sep 2020	B2
10776847	Comar et al.	Sep 2020	B1
10789367	Joseph Durairaj et al.	Sep 2020	B2
10791131	Nor et al.	Sep 2020	B2
10817530	Siebel et al.	Oct 2020	B2
10861028	Silberman et al.	Dec 2020	B2
10862916	Hittel et al.	Dec 2020	B2
10871951	Ding et al.	Dec 2020	B2
10911470	Muddu et al.	Feb 2021	B2
10944772	Mulchandani et al.	Mar 2021	B2
10958667	Maida et al.	Mar 2021	B1
10965711	Schiappa et al.	Mar 2021	B2
10977551	Van Seijen et al.	Apr 2021	B2
10985997	Duggal et al.	Apr 2021	B2
10992698	Patel et al.	Apr 2021	B2
11030520	Mankovskii et al.	Jun 2021	B2
11032307	Tsironis	Jun 2021	B2
11113667	Jiang et al.	Sep 2021	B1
11138514	Hu et al.	Oct 2021	B2
11194900	Loman et al.	Dec 2021	B2
11256791	Douglas et al.	Feb 2022	B2
11334831	Abu El Ata et al.	May 2022	B2
11392875	Carstens et al.	Jul 2022	B2
11477641	Damlaj et al.	Oct 2022	B2
11539663	Chasman et al.	Dec 2022	B2
11574206	Butler, Jr. et al.	Feb 2023	B2
11736299	Cerna, Jr.	Aug 2023	B2
20040255167	Knight	Dec 2004	A1
20050071223	Jain et al.	Mar 2005	A1
20050165822	Yeung et al.	Jul 2005	A1
20050198099	Motsinger et al.	Sep 2005	A1
20050289072	Sabharwal	Dec 2005	A1
20060149575	Varadarajan et al.	Jul 2006	A1
20070055558	Shanahan et al.	Mar 2007	A1
20070136821	Hershaft et al.	Jun 2007	A1
20070150744	Cheng et al.	Jun 2007	A1
20070168370	Hardy	Jul 2007	A1
20070276714	Beringer	Nov 2007	A1
20080021866	Hinton et al.	Jan 2008	A1
20080270203	Holmes et al.	Oct 2008	A1
20080288621	Snell	Nov 2008	A1
20090012760	Schunemann	Jan 2009	A1
20090094372	Nyang et al.	Apr 2009	A1
20090199002	Erickson	Aug 2009	A1
20090319247	Ratcliffe, III et al.	Dec 2009	A1
20090327668	Sudzilouski	Dec 2009	A1
20100083240	Siman	Apr 2010	A1
20100115276	Betouin et al.	May 2010	A1
20100275183	Panicker et al.	Oct 2010	A1
20100299651	Fainekos et al.	Nov 2010	A1
20100325685	Sanbower	Dec 2010	A1
20110087888	Rennie	Apr 2011	A1
20110225287	Dalal et al.	Sep 2011	A1
20110307467	Severance	Dec 2011	A1
20120215575	Deb et al.	Aug 2012	A1
20120296845	Andrews et al.	Nov 2012	A1
20130046751	Tsiatsis et al.	Feb 2013	A1
20130067558	Markham	Mar 2013	A1
20130073573	Huang	Mar 2013	A1
20130117831	Hook et al.	May 2013	A1
20130132149	Wei et al.	May 2013	A1
20130159219	Pantel et al.	Jun 2013	A1
20140082729	Shim et al.	Mar 2014	A1
20140149186	Flaxer et al.	May 2014	A1
20140244612	Bhasin et al.	Aug 2014	A1
20140279762	Xaypanya et al.	Sep 2014	A1
20140324521	Mun	Oct 2014	A1
20140351827	Llamas	Nov 2014	A1
20150081363	Taylor et al.	Mar 2015	A1
20150128258	Novozhenets	May 2015	A1
20150149979	Talby et al.	May 2015	A1
20150161738	Stempora	Jun 2015	A1
20150170053	Miao	Jun 2015	A1
20150172311	Freedman et al.	Jun 2015	A1
20150242509	Pall et al.	Aug 2015	A1
20150261580	Shau	Sep 2015	A1
20150281225	Schoen et al.	Oct 2015	A1
20150295775	Dickey	Oct 2015	A1
20150317745	Collins et al.	Nov 2015	A1
20150347414	Xiao et al.	Dec 2015	A1
20150379111	Hwang	Dec 2015	A1
20160004858	Chen et al.	Jan 2016	A1
20160006629	Tanakiev et al.	Jan 2016	A1
20160012235	Lee et al.	Jan 2016	A1
20160057159	Yin et al.	Feb 2016	A1
20160088000	Siva Kumar et al.	Mar 2016	A1
20160099960	Gerritz et al.	Apr 2016	A1
20160119365	Barel	Apr 2016	A1
20160140519	Trepca et al.	May 2016	A1
20160180240	Majumdar et al.	Jun 2016	A1
20160219066	Vasseur et al.	Jul 2016	A1
20160275123	Lin	Sep 2016	A1
20160323216	LeVasseur	Nov 2016	A1
20160330233	Hart	Nov 2016	A1
20160364307	Garg et al.	Dec 2016	A1
20160371363	Muro et al.	Dec 2016	A1
20170010589	de Anda Fast	Jan 2017	A1
20170023509	Kim et al.	Jan 2017	A1
20170090893	Aditya et al.	Mar 2017	A1
20170207926	Gil et al.	Jul 2017	A1
20170241791	Madigan et al.	Aug 2017	A1
20180268264	Marwah et al.	Sep 2018	A1
20180336250	Llaves et al.	Nov 2018	A1
20190188797	Przechocki et al.	Jun 2019	A1
20200004752	Majumdar et al.	Jan 2020	A1
20200177618	Hassanzadeh et al.	Jun 2020	A1
20200304534	Rakesh et al.	Sep 2020	A1
20200356664	Maor	Nov 2020	A1
20200364346	Gourisetti et al.	Nov 2020	A1
20200396246	Zoldi et al.	Dec 2020	A1
20210075822	Chung et al.	Mar 2021	A1

Foreign Referenced Citations (4)

Number	Date	Country
2930026	May 2015	CA
2014159150	Oct 2014	WO
2015089463	Jun 2015	WO
2020079685	Apr 2020	WO

Non-Patent Literature Citations (31)

Entry
Chambers et al.“FlumeJava: easy, efficient data-parallel pipelines.” ACM Sigplan Notices 45.6 (2010): 363-375 (Year: 2010).
Excerpts of raw documentation source located in the Apache Logging Flume GitHub “apache/logging-flume” repository tagged as Apache Flume Release 1.6.0, dated May 5, 2015, full release available at https://github.com/apache/logging-flume/tree/release-1.6.0, 200 pages.
Excerpts of raw documentation source located in the Apache Airflow GitHub “apache/airflow” repository tagged as Apache Airflow Release v1.5.1, dated Sep. 4, 2015, full release available at https://github.com/apache/airflow/tree/1.5.1, 75 pages.
Excerpts of raw documentation source located in the Apache Apex core GitHub “apache/apex-core” repository tagged as Apache Apex Core Release v3.1.1, dated Oct. 8, 2015, full release available at https://github.com/apache/apex-core/tree/v3.1.1, 158 pages.
Excerpts of raw documentation source located in the Apache Beam GitHub “apache/beam” repository tagged as Apache Beam Release v1.2.0, dated Oct. 5, 2015, full release available at https://github.com/apache/beam/tree/v1.2.0, 31 pages.
Excerpts of raw documentation source located in the Apache Flink GitHub “apache/flink” repository tagged as Apache Flink Release 0.9.7, dated Aug. 27, 2015, full release available at https://github.com/apache/flink/tree/release-0.9.1, 712 pages.
Excerpts of raw documentation source located in the Apache Hadoop GiHub “apache/hadoop” repository tagged as Apache Hadoop Release 2.6.1, dated Sep. 23, 2015, full release available at https://github.com/apache/hadoop/tree/release-2.6.1, 1640 pages.
Excerpts of raw documentation source located in the Apache Ignite GitHub “apache/ignite” repository tagged as Apache Ignite Release 1.4.1, dated Sep. 25, 2015, full release available at https://github.com/apache/ignite/tree/1.4.1, 103 pages.
Excerpts of raw documentation source located in the Apache Kafka GitHub “apache/kafka” repository tagged as Apache Kafka Release 0.8.2.2, dated Sep. 2, 2015, full release available at https://github.com/apache/kafka/tree/0.8.2.2, 13 pages.
Excerpts of raw documentation source located in the Apache NiFi GitHub “apache/nifi” repository tagged as Apache NiFi Release nifi-0.3.0-RC1, dated Sep. 14, 2015, full release available at https://github.com/apache/nifi/tree/nifi-0.3.0-RC1, 286 pages.
Excerpts of raw documentation source located in the Apache Samza GitHub “apache/samza” repository tagged as Apache Samza Release 0.9.1-rc1, date Jun. 23, 2015, full release available at https://github.com/apache/samza/tree/release-0.9.1-rc1, 221 pages.
Excerpts of raw documentation source located in the Apache Spark GitHub “apache/spark” repository tagged as Apache Spark Release v.15.1-rc1, dated Sep. 23, 2015, full release available at https://github.com/apache/spark/tree/v1.5.1, 2122 pages.
Excerpts of raw documentation source located in the Apache Storm GitHub “apache/storm” repository tagged as Apache Storm Release v0.10.0-beta1, dated Jun. 19, 2015, full release available at https://github.com/apache/storm/tree/v0.10.0-beta1, 589 pages.
Boukhtouta, et al, “Graph-theoretic characterization of cyber-threat infrastructures”, Digital Investigation, 2015, vol. 14, p. S3-S15, USA.
Cui, et al, “Non-intrusive process-based monitoring system to mitigate and prevent VM vulnerability explorations”, Collaboratecom, 2013, Austin, USA.
Ekelhart, et al, “Integrating attacker behavior in IT security analysis: a discrete-event simulation approach”, ResearchGate, 2015.
Fisk, Varghese, “Agile and Scalable Analysis of Network Events”.
Gedik et al, “Elastic Scaling for Data Stream Processing”, IEEE Transactions on Parallel and Distributed Systems, Jun. 2014, vol. 25, No. 6, p. 1447-1463.
Jajodia, et al, “Advanced Cyber Attack Modeling, Analysis, and Visualization”, AFRL Final Technical Report, Mar. 2010, USA.
JPCERT-CC, “Detecting Lateral Movement through Tracking Event Logs (Version 2)”, 2017, p. 1-16, Japan.
Jungles et al, “Mitigating Pass-the-Hash (PtH) Attacks and Other Credential Theft Techniques”, TwC Next, 2012.
Kbar, “Wireless Network Token-Based Fast Authentication”, 17th International Conference on Telecommunications, 2010, p. 227-233.
Kiesling et al, “Selecting security control portfolios: a multi-objective simulation-optimization approach”, EURO Journal on Decision Processes, Apr. 2016.
Kotenko, “A Cyber Attack Modeling and Impact Assessment framework”, Conference Paper, Jan. 2013.
Kumar, et al, “DFuse: A Framework for Distributed Data Fusion”, Georgia Institute of Technology.
Lu, et al, “Sybil Attack Detection through Global Topology Pattern Visualization”, 2011.
Pasqualetti et al, “Attack Detection and Identification in Cyber-Physical Systems”, IEEE Transactions on Automatic Control, vol. 58, No. 11, p. 2715-2729.
Patapanchala, “Exploring Security Metrics for Electric Grid Infrastructure Leveraging Attack Graphs”, Oregon State Thesis, 2016.
Shandilya et al, “Use of Attack Graphs in Security Systems”, Journal of Computer Networks and Communications, vol. 2014.
Yang et al, “Attack Projection”, Advances in Information Security 62, 2014, p. 239-261.
Zargar et al, “XABA: A Zero-Knowledge Anomaly-Based Behavioral Analysis Method to Detect Insider Threats”, 2016.

Provisional Applications (5)

Number	Date	Country
62568298	Oct 2017	US
62568312	Oct 2017	US
62568305	Oct 2017	US
62568291	Oct 2017	US
62568307	Oct 2017	US

Continuations (3)

	Number	Date	Country
Parent	18581375	Feb 2024	US
Child	18779035		US
Parent	17189161	Mar 2021	US
Child	18581375		US
Parent	15823363	Nov 2017	US
Child	16720383		US

Continuation in Parts (55)

	Number	Date	Country
Parent	17061195	Oct 2020	US
Child	17189161		US
Parent	17035029	Sep 2020	US
Child	17061195		US
Parent	17008276	Aug 2020	US
Child	17035029		US
Parent	17000504	Aug 2020	US
Child	17008276		US
Parent	16855724	Apr 2020	US
Child	17000504		US
Parent	16836717	Mar 2020	US
Child	16855724		US
Parent	16777270	Jan 2020	US
Child	16855724		US
Parent	16720383	Dec 2019	US
Child	16836717		US
Parent	16709598	Dec 2019	US
Child	17189161		US
Parent	16412340	May 2019	US
Child	17000504		US
Parent	16267893	Feb 2019	US
Child	16412340		US
Parent	16248133	Jan 2019	US
Child	16267893		US
Parent	15887496	Feb 2018	US
Child	16248133		US
Parent	15879801	Jan 2018	US
Child	17061195		US
Parent	15849901	Dec 2017	US
Child	16248133		US
Parent	15835436	Dec 2017	US
Child	15849901		US
Parent	15835312	Dec 2017	US
Child	15849901		US
Parent	15823285	Nov 2017	US
Child	15887496		US
Parent	15818733	Nov 2017	US
Child	15887496		US
Parent	15813097	Nov 2017	US
Child	16248133		US
Parent	15806697	Nov 2017	US
Child	16248133		US
Parent	15790457	Oct 2017	US
Child	15835436		US
Parent	15790327	Oct 2017	US
Child	15790457		US
Parent	15788718	Oct 2017	US
Child	15823285		US
Parent	15788002	Oct 2017	US
Child	15788718		US
Parent	15787601	Oct 2017	US
Child	15788002		US
Parent	15725274	Oct 2017	US
Child	15818733		US
Parent	15725274	Oct 2017	US
Child	15823363		US
Parent	15673368	Aug 2017	US
Child	16248133		US
Parent	15655113	Jul 2017	US
Child	15725274		US
Parent	15616427	Jun 2017	US
Child	15813097		US
Parent	15616427	Jun 2017	US
Child	15655113		US
Parent	15616427	Jun 2017	US
Child	15790327		US
Parent	15616427	Jun 2017	US
Child	15787601		US
Parent	15379899	Dec 2016	US
Child	15879801		US
Parent	15376657	Dec 2016	US
Child	15673368		US
Parent	15376657	Dec 2016	US
Child	15806697		US
Parent	15376657	Dec 2016	US
Child	15379899		US
Parent	15343209	Nov 2016	US
Child	15806697		US
Parent	15237625	Aug 2016	US
Child	15376657		US
Parent	15237625	Aug 2016	US
Child	15655113		US
Parent	15237625	Aug 2016	US
Child	15343209		US
Parent	15229476	Aug 2016	US
Child	15343209		US
Parent	15206195	Jul 2016	US
Child	15237625		US
Parent	15206195	Jul 2016	US
Child	15229476		US
Parent	15186453	Jun 2016	US
Child	15206195		US
Parent	15186453	Jun 2016	US
Child	15835312		US
Parent	15166158	May 2016	US
Child	15186453		US
Parent	15141752	Apr 2016	US
Child	15790327		US
Parent	15141752	Apr 2016	US
Child	15166158		US
Parent	15091563	Apr 2016	US
Child	15141752		US
Parent	14986536	Dec 2015	US
Child	15141752		US
Parent	14952974	Oct 2015	US
Child	16709598		US
Parent	14925974	Oct 2015	US
Child	15616427		US
Parent	14925974	Oct 2015	US
Child	15141752		US

Rapid predictive analysis of very large data sets using the distributed computational graph

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Term Extension

Abstract