Data revision control in large-scale data analytic systems

Description

TECHNICAL FIELD

The disclosed implementations relate generally to large-scale data analytic systems. In particular, the disclosed implementations relate to data revision control in large-scale data analytic systems.

BACKGROUND

Many large-scale data analytic systems are designed to efficiently run large-scale data processing jobs. For example, a traditional large-scale data analytic system is configured to execute large-scale data processing jobs on a cluster of commodity computing hardware. Such systems can typically execute job tasks in parallel at cluster nodes at or near where the data is stored, and aggregate and store intermediate and final results of task execution in a way that minimizes data movement between nodes, which would be expensive operationally given the large amount of data that is processed. Such systems also typically store data and job results in distributed file system locations specified by users but do not provide extensive revision control management of data and job results.

Accordingly, the functionality of traditional large-scale data analytic systems is limited at least with respect to revision control of the data that is processed. Thus, there is a need for systems and methods that provide more or better revision control for data processed in large-scale data analytic systems. Such systems and methods may compliment or replace existing systems and methods for data revision control in large-scale data analytic systems.

SUMMARY

The claims section at the end of this document provides a useful summary of some embodiments of the present invention.

BRIEF DESCRIPTION OF THE DRAWINGS

For a better understanding of the various described implementations, reference should be made to the Description of Implementations below, in conjunction with the following drawings in which like reference numerals refer to corresponding parts throughout the figures.

FIG. 1 is a data revision control model for large-scale data analytic systems.

FIG. 2 illustrates a data revision control example according to the data revision control model.

FIG. 3 is a block diagram of a data distribution network for data revision control in large-scale data analytic systems.

FIG. 4 is a block diagram of an example large-scale data analytic system.

FIG. 5 is a block diagram of a data revision control system.

FIG. 6 is a very general block diagram of a computing device in which the example embodiment(s) of the present invention may be embodied.

FIG. 7 is a block diagram of a basic software system for controlling the operation of the computing device.

FIG. 8 is a flowchart of a process for determining column provenance.

FIG. 9 illustrates a simple example of a build dependency graph, according to an embodiment of the present invention.

FIG. 10 is a block diagram of a build catalog entry according to an embodiment of the present invention.

DESCRIPTION OF IMPLEMENTATIONS

Reference will now be made in detail to implementations, examples of which are illustrated in the accompanying drawings. In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the various described implementations. However, it will be apparent to one of ordinary skill in the art that the various described implementations may be practiced without these specific details. In other instances, well-known methods, procedures, components, circuits, and networks have not been described in detail so as not to unnecessarily obscure aspects of the implementations.

It will also be understood that, although the terms first, second, etc. are, in some instances, used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first user interface could be termed a second user interface, and, similarly, a second user interface could be termed a first user interface, without departing from the scope of the various described implementations. The first user interface and the second user interface are both types of user interfaces, but they are not the same user interface.

The terminology used in the description of the various described implementations herein is for the purpose of describing particular implementations only and is not intended to be limiting. As used in the description of the various described implementations and the appended claims, the singular forms “a”, “an”, and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term “and/or” as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. It will be further understood that the terms “includes,” “including,” “comprises,” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

As used herein, the term “if” is, optionally, construed to mean “when” or “upon” or “in response to determining” or “in response to detecting” or “in accordance with a determination that,” depending on the context. Similarly, the phrase “if it is determined” or “if [a stated condition or event] is detected” is, optionally, construed to mean “upon determining” or “in response to determining” or “upon detecting [the stated condition or event]” or “in response to detecting [the stated condition or event]” or “in accordance with a determination that [a stated condition or event] is detected,” depending on the context.

Data Revision Control Model

FIG. 1 is a block diagram of a data revision control model 100 for large-scale data analytic systems. The model 100 generally includes dataset versions 102, transactions 104, data files 106, and driver programs 108. Datasets are versioned in the context of transactions 104. Specifically, each version 102 of a dataset corresponds to a different successfully committed transaction 104. In the context of a transaction 104 that creates a new dataset version 102, data may be added to a dataset if creating or revising the dataset and/or data may be removed from a dataset if revising the dataset. Data files 106 contain the data in datasets across dataset versions 102 including historical versions. Driver programs 108 are executed by large-scale data analytic systems (e.g., Apache Spark) in the context of transactions 104. When executed, driver programs 108 apply parallel operations to one or more input dataset versions 102 and produce as a result one or more output dataset versions 102.

A simple example may be helpful to better understand the data revision control model 100. FIG. 2 illustrates an example of data revision control according to data revision control model 100.

On Day One, an initial version of dataset A is created in the context of transaction TX1 resulting in data file F1. For example, data file F1 may contain web access log entries for the past six months. Also on Day One, an initial version of dataset B is created in the context of transaction TX2 resulting in data file F2. For example, data file F2 may contain rows corresponding to users of an online web service and associating user name identifiers with network addresses from which the users access the web service. Also on Day One, a driver program P1 is executed in the context of transaction TX3 that performs a join based on network address between dataset A, consisting of the initial version of databset A, and dataset B, consisting of the initial version of dataset B. This execution results in an initial version of dataset C and data file F3 containing the results of the join operation executed in the context of transaction TX3.

On Day Two, the previous day's (i.e., Day One's) web access log entries are added to dataset A in the context of transaction TX4 thereby producing data file F4. In this example, data file F4 contains only the previous day's (i.e., Day One's) web access log entries. Also on Day Two, the driver program P1 is executed again in the context of transaction TX5. In this example, the join performed in the context of transaction TX5 is between the web access log entries in data file F4 and the entries in data file F2. This execution results in a second version of dataset C and data file F5 containing the results of the join operation executed in the context of transaction TX5.

Similarly, on Day Three, the previous day's (i.e., Day Two's) web access log entries are added to dataset A in the context of transaction TX6 and resulting in data file F6. In this example, data file F6 contains only the previous day's (i.e., Day Two's) web access log entries. Also on Day Two, the driver program P1 is executed again in the context of transaction TX7. In this example, the join performed in the context of transaction TX7 is between the web access log entries in data file F6 and the entries in data file F2. This execution results in a third version of dataset C and data file F7 containing the results of the join operation executed in the context of transaction TX7. As a result, there are three versions of dataset A corresponding to transactions TX1, TX4, and TX6 and data files F1, F4, and F6. There is one version of dataset B corresponding to transaction TX2 and data file F2. And there are three versions of dataset C corresponding to transactions TX3, TX5, and TX7 and data files F3, F5, and F7.

While in this example and other examples presented herein there is a single data file 106 created for a dataset version 102 in the context of a transaction 104, it is also possible for multiple data files 106 to be created for a dataset version 102. Thus, a transaction 104 in which a dataset version 102 is created or revised may be associated with the more than one data file 106.

Data Processing System

In order to explain the operation of data revision control in large-scale data analytic systems, it is helpful to consider an exemplary distributed data processing system in which the data revision control is performed. In general, the implementations described here can be performed by a set of interconnected processors that are interconnected by one or more communication networks.

FIG. 3 is a block diagram of an exemplary distributed data processing system 300. It should be appreciated that the layout of the system 300 is merely exemplary and the system 300 may take on any other suitable layout or configuration. The system 300 is used to store data, perform computational tasks, and possibly to transmit data between datacenters. The system may include any number of data centers DCx, and thus the number of data centers shown in FIG. 3 is only exemplary. The system 300 may include dedicated optical links or other dedicated communication channels, as well as supporting hardware such as modems, bridges, routers, switches, wireless antennas and towers, and the like. In some implementations, the network 300 includes one or more wide area networks (WANs) as well as multiple local area networks (LANs). In some implementations, the system 300 utilizes a private network, e.g., the system and its interconnections are designed and operated exclusively for a particular company or customer. Alternatively, a public network may be used.

Some of the datacenters may be located geographically close to each other, and others may be located far from the other datacenters. In some implementations, each datacenter includes multiple racks. For example, datacenter 302 includes multiple racks 308a, . . . , 308n. The racks 308 can include frames or cabinets into which components are mounted. Each rack can include one or more processors (CPUs) 310. For example, the rack 308a includes CPUs 310a, . . . , 310n (slaves 1-16) and the nth rack 306n includes multiple CPUs 310 (CPUs 17-31). The processors 310 can include data processors, network attached storage devices, and other computer controlled devices. In some implementations, at least one of processors 310 operates as a master processor, and controls the scheduling and data distribution tasks performed throughout the network 300. In some implementations, one or more processors 310 may take on one or more roles, such as a master and/or slave. A rack can include storage (e.g., one or more network attached disks) that is shared by the one or more processors 310.

In some implementations, the processors 310 within each rack 308 are interconnected to one another through a rack switch 306. Furthermore, all racks 308 within each datacenter 302 are also interconnected via a datacenter switch 304. As noted above, the present invention can be implemented using other arrangements of multiple interconnected processors.

In another implementation, the processors shown in FIG. 3 are replaced by a single large-scale multiprocessor. In this implementation, data analytic operations are automatically assigned to processes running on the processors of the large-scale multiprocessor.

Example Large-Scale Data Analytic System

In order to explain the operation of data revision control in large-scale analytic systems, it is also helpful to consider an exemplary large-scale data analytic system with which data revision control is performed. In general, the implementations described here can be performed by a cluster computing framework for large-scale data processing.

FIG. 4 is a block diagram of an example large-scale data analytic system 400. The system 400 provides data analysts with a cluster computing framework for writing parallel computations using a set of high-level operators with little or no concern about work distribution and fault tolerance. The system 400 is typically a distributed system having multiple processors, possibly including network attached storage nodes, that are interconnected by one or more communication networks. 4 provides a logical view of a system 400, with which some implementations may be implemented on a system having the physical structure shown in FIG. 3. In one implementation, the system 400 operates within a single data center of the system 300 shown in FIG. 3, while in another implementation, the system 300 operates over two or more data centers of the system 300.

As shown in FIG. 4, a client 402 of a data analytic system 410 includes a driver program 404. The driver program 404 is authored by a data analyst in a programing language (e.g., Java, Python, Scala, etc.) compatible with the data analytic system 410. The driver program 404 implements a high-level control flow of an analytic application (e.g., text search, logistic regression, alternating least squares, interactive analytics, etc.) and launches various operations in parallel at a set of worker machines 414. The parallel operations operate on a set or sets of data distributed across the set of workers 414.

Generally, a set of distributed data operated on by the parallel operations is a collection of objects partitioned across the set of workers 414. A set of distributed data may be constructed (instantiated) at the workers 414 from data in a data file 422 stored in a distributed file system cluster 420. Alternatively, a set of distributed data can be constructed (instantiated) at the workers 414 by transforming an existing set of distributed data using a parallel transformation operation (map, filter, flatMap, groupByKey, join, etc.). A set of distributed data may also be persisted as a data file 422 to the distributed file system cluster 420 by a parallel save operation. Other parallel operations that may be performed at the workers 414 on a set of distributed data include, but are not limited to, reduce, collect, and for each. The reduce operation combines elements in a set of distributed data using associative function to produce a result at the driver program 404. The collect operation sends all elements of a set of distributed data to the driver program 404. The for each operation passes each element of a set of distributed data through a user provided function. Overall, executing the driver program 404 can involve constructing (instantiated) sets of distributed data at the set of workers 414 based on data read from data files 422, constructing additional sets of distributed data at the set of workers 414 by applying transformation operations at the workers 414 to existing sets of distributed data, and persisting sets of distributed data at the workers 414 to data files 422 in the distributed file system cluster 420.

Cluster manager 412 provides a cluster operating system that lets the driver program 404 share the data analytic system cluster 410 in a fine-grained manner with other driver programs, possibly running at other clients. Cluster manager 412 also provides an application programming interface (API) invoke-able over a network by the driver program 404 via a network-based remote procedure call (RPC) protocol. In some implementations, the RPC protocol is based on the Hyper Text Transfer Protocol (HTTP) or the Secure-Hyper Text Transfer Protocol (HTTPS). The cluster manager 412 API allows the driver program 404 to request task execution resources at the workers 414. Generally, a task is a unit of work sent by the driver program 404 to an executor at a worker 414 for execution by the executor at the worker 414. Generally, an executor is a process launched for the driver program 404 at a worker 414 that executes tasks 416 sent to it by the driver program 404. The executor process runs tasks 416 and keeps data in memory or disk storage across tasks 416. In some implementations, the driver program 404 is allocated dedicated executor processes at the workers 414 so that tasks 416 performed by the executor processes on behalf of the driver program 404 are process-isolated from tasks performed at the workers 414 on behalf of other driver programs.

When an action (e.g., save, collect) is requested in the driver program 404, the driver program 404 may spawn a parallel computation job. After spawning the job, the driver program 404 may then divide the job into smaller sets of tasks 416 called stages that depend on each other. The tasks 416 may then be scheduled according to their stages and sent to the executors allocated to the driver program 404 by the cluster manager 412 for execution at the workers 414. Results of executing the tasks 416 at the workers 414 may be returned to the driver program 404 for aggregation and/or persisted to data files 422 in the distributed file system cluster 420.

The distributed data file system cluster 420 provides distributed data storage for data files 422 on a cluster of machines. The distributed data file system cluster 420 may present via an API a logical hierarchical file system to clients. With the cluster, data files 422 may be stored as data blocks distributed across machines of the cluster 420. In some implementations, copies of data blocks are stored at different machines of the cluster 420 for fault tolerance and redundancy.

The file system API for accessing, reading from, and writing to data files 422 may be invoke-able over a network from the client 402 including from the driver program 404 and from the workers 414 via a network-based remote procedure call (RPC) protocol. In some implementations, the RPC protocol is based on the HTTP or the HTTPS protocol. In some implementations, data files 422 are identified via the API by Uniform Resource Identifiers (URIs). The URI for a data file 422 may comprise a scheme and a path to the data file 422 in the logical file system. In some implementations, the scheme is optional. Where a scheme is specified, it may vary depending on the type of cluster 420. For example, if the cluster 420 is a Hadoop Distributed File System (RDFS) cluster, then the scheme of URIs for data files 422 may be “hdfs.” More generally, the API offered by the cluster 420 may supported accessing, reading from, and writing to data files 422 using any Hadoop API compatible URI.

Data Revision Control System

FIG. 5 is a block diagram of a data revision control system 500. The system 500 provides users of a large-scale data analytic system (e.g., system 400) with a system to record data and to capture information about transformations that transform one piece of data into another piece of data.

The system 500 includes a catalog service 512 that provides read and write access to a catalog 542 stored in a database 540. Access to the catalog 542 by the catalog service 512 may be conducted in the context of transactions 104 supported by a database management system 530.

When access to a dataset version 102 is requested of the catalog service 512 by a user, the catalog service 512 may ask a permission service 514 if the user has permission to access the dataset version 102 according to dataset permissions 544 stored in the database 540 and accessible via the database management system 530. If the user does not have access, then information in the catalog 542 such as transaction identifiers and file identifiers associated with the dataset 102 is not returned to the user.

The user may interface with the catalog service 512 via the client 402. The client 402 may be a command line-based or web-based. Via the client 402, the user may request the catalog service 512 for a particular dataset version 102, a particular transaction 104 of a dataset version 102, or a particular file 106 of a dataset version 102. If a particular dataset version 102, then the catalog service 512, assuming the user has permission to access the dataset version 102, returns a set of paths to all data files 106 for all transactions 104 of the dataset version 102 recorded in the catalog 542. If the request is for a particular transaction 104 of a dataset version 102, then the catalog service 512, again assuming the user has permission to access the dataset version 102, returns a set of paths to all data files 106 for the transaction 104 recorded in the catalog 542. If a particular data file 106 of a dataset version 102 is requested, then the catalog service 512, once again assuming the user has permission to access the dataset version 102, returns a path to the file 106 recorded in the catalog 542.

While in some implementations the user interfaces with the catalog service 512 and other services of the data revision control system 500 via a client specially configured to interface with services of the system 500, the user interfaces with a service or services of the data revision control system 500 via a generic client (e.g., a standard web browser) in other implementations. Thus, there is no requirement that client 402 be specially configured to interface with network services of the data revision control system 500.

The client 402 may be coupled to a distributed file system 420 where the files 106 are actually stored. The client 402 may use file paths returned from the catalog service 512 to retrieve the bytes of the files 106 from the distributed file system 420. The distributed file system 420 may be implemented the Hadoop Distributed File System (HFDS), Amazon S3 bucket, or the like.

The catalog service 512 or the client 402 may request schema information 546 for a particular dataset version 102 or a particular file 106 of a dataset version 102 from the schema service 516. The schema service 516 may verify that the requesting user has permission to the access the dataset version 102 first before providing the requested schema information to the catalog service 512 or the client 102. The schema service 516 may retrieve the schema information from the database 540 via the database management system 530.

The catalog service 512 may manage encryptions keys for supporting file-level encryption of files 106 stored in the distributed file system 420. Specifically, the catalog 542 may store user-provided symmetric encryption keys in association with file identifiers of files 106 that are encrypted using the encryption keys. Provided the user has permission to access a requested dataset version 102, the user-provided encryption keys may be returned to the client 402 along with the file paths in the catalog 542 to requested files 106 of the dataset 402. The client 402 can decrypt the encrypted bytes retrieved from the distributed file system 420 using the user-provided encryption key for the file 106. The user-provided encryption keys may be stored in the catalog 542 when the file 106 is initially created in the distributed file system 420.

The client 402 may be configured with an interface layer for processing user commands input via the command line or the web client and interacting with the catalog service 512, the permission service 514, the schema service 516, and the distributed file system 420 to carry out those commands. For example, via the command line interface, the user may input a “change dataset” command to set the current dataset version 102 of the command line session (shell). Then the user may input a list command to obtain a list of transactions 104 or files 106 of the current dataset version 102. The user may input a put command to add a specified file 106 to the dataset version 102. Behind the scenes, the interface layer negotiates with the catalog service 512, the permission service 514, the schema service 516, and the distributed file system 420 to carry out the commands.

The interface layer may also exist on worker nodes 141 of the data analytic system cluster 410. For example, the interface layer may also exist on Spark worker nodes such that when the worker nodes perform transformations 108 on dataset versions 102, the interface layer negotiates with the services 512, 514, 516, and/or 518 to facilitate the transformations 108.

Catalog

The data revision control system 500 may encompass maintaining an immutable history of data recording and transformation actions such as uploading a new dataset version 102 to the system 500 and transforming one dataset version 102 version to another dataset version 102. The immutable history is referred to herein as the catalog 542. The catalog 542 may be stored in a database 540. Preferably, reads and writes from and to the catalog 542 are performed in the context of ACID-compliant transactions supported by a database management system 530. For example, the catalog 542 may be stored in a relational database managed by a relational database management system that supports atomic, consistent, isolated, and durable (ACID) transactions. In one embodiment, the database management system 530 supporting ACID transactions is as described in related U.S. patent application Ser. No. 13/224,550, entitled “Multi-Row Transactions,” filed Sep. 2, 2011, the entire contents of which is hereby incorporated by referenced as if fully set forth herein.

Versioned Immutable Datasets

The catalog 542 encompasses the notion of versioned immutable dataset versions 102. More specifically, a dataset may encompass an ordered set of conceptual dataset items. The dataset items may be ordered according to their version identifiers recorded in the catalog 542. Thus, a dataset item may correspond to a particular dataset version 102. Or as another perspective, a dataset item may represent a snapshot of the dataset at a particular dataset version 102.

As a simple example, a version identifier of ‘1’ may be recorded in the catalog 542 for an initial dataset version 102. If data is later added to the dataset, a version identifier of ‘2’ may be recorded in the catalog 542 for a second dataset version 102 that conceptually includes the data of the initial dataset version 102 and the added data. In this example, dataset version ‘2’ may represent the current dataset version 102 version and is ordered after dataset version ‘1’.

As well as being versioned, a dataset version 102 may be immutable. That is, when a new dataset version 102 is created in the system 500, pre-existing dataset versions 102 are not overwritten by the new dataset version 102. In this way, pre-existing dataset versions 102 are preserved when a new dataset version 102 is added to a dataset. Note that supporting immutable dataset versions 102 is not exclusive of pruning or deleting dataset versions 102 corresponding to old or unwanted dataset versions 102. For example, old or unwanted dataset versions 102 may be deleted from the system 500 to conserve data storage space or in accordance with a data retention policy or regulatory compliance.

Dataset Transactions

A dataset version 102 may correspond to a successfully committed transaction 104. In these embodiments, a sequence of successfully committed transactions 104 may correspond to a sequence of dataset versions 102.

A transaction 104 against a dataset may add data to the dataset, edit existing data in the dataset, remove existing data from the dataset, or a combination of adding, editing, or removing data. A transaction 104 against a dataset may create a new dataset version 102 without deleting, removing, or modifying pre-existing dataset versions.

A successfully committed transaction 104 may correspond to a set of one or more files 106 that contain the data of a dataset version 102 created by the successful transaction 104. The set of files 106 may be stored in a file system 420. In a preferred embodiment, the file system 420 is the Hadoop Distributed File System (HDFS) or other distributed file system 420. However, a distributed file system 420 is not required and a standalone file system may be used.

In the catalog 542, a dataset version 102 may be identified by the name or identifier of the dataset version 102. In a preferred embodiment, the dataset version 102 corresponds to an identifier assigned to the transaction 104 that created the dataset version 102. The dataset version 102 may be associated in the catalog with the set of files 106 that contain the data of the dataset version 102. In a preferred embodiment, the catalog 542 treats the set of files 106 as opaque. That is, the catalog 542 itself may store paths or other identifiers of the set of files 106 but may not otherwise open, read, or write to the files 106.

In sum, the catalog 542 may store information about dataset versions 102. The information may include information identifying different dataset versions 102. In association with information identifying a particular dataset version 102, there may be information identifying one or more files 106 that contain the data of the particular dataset version 102.

Dataset Branching

The catalog 542 may store information representing a non-linear history of a dataset. Specifically, the history of a dataset may have different dataset branches. Branching may be used to allow one set of changes to a dataset to be made independent and concurrently of another set of changes to the dataset. The catalog 542 may store branch names in association with identifies of dataset versions 102 for identifying dataset versions 102 that belong to a particular dataset branch.

Dataset Provenance

The catalog 542 may provide dataset provenance at the transaction level of granularity. As an example, suppose a driver program 108 is executed in the data analytic system 400 multiple times that reads data from a version of dataset A, reads data from a version of dataset B, transforms the data from the version of dataset A and the data from the version of dataset B in some way to produce a version of dataset C. As mentioned, this transformation may be performed multiple times. Each transformation may be performed in the context of a transaction 104. For example, the transformation may be performed daily after datasets A and B are updated daily in the context of transactions. The result being multiple versions of dataset A, multiple versions of dataset B, and multiple versions of dataset C as a result of multiple executions of the driver program 108. The catalog 542 may contain sufficient information to trace the provenance of a particular version of dataset C to the versions of datasets A and B from which the particular version of dataset C is derived. In addition, the catalog may contain sufficient information the trace the provenance of those versions of datasets A and B to the earlier versions of datasets A and B from which those versions of datasets A and B were derived.

The provenance tracking ability is the result of recording in the catalog 542 for a transaction 104 that creates a new dataset version 102, the transaction 104 or transactions 104 that the given transaction 104 depends on (e.g., is derived from). The information recorded in the catalog 542 may include an identifier of each dependent transaction 104 and a branch name of the dataset version 102 that the dependent transaction 104 was committed against.

According to some embodiments, provenance tracking extends beyond transaction level granularity to column level granularity. For example, suppose a dataset version A1 is structured as a table of two columns and a dataset version B1 is structured as a table of five columns. Further assume, column three of dataset version B1 is computed from column one of dataset version A1. In this case, the catalog may store information reflecting the dependency of column three of dataset version B1 on column one of dataset version A1.

Permission Transitivity

The catalog 542 may also support the notion of permission transitivity. For example, suppose the catalog 542 records information for two transactions 1042 referred to in this example as “Transaction 1” and Transaction 2.” Further suppose a third transaction 104, referred to in this example as “Transaction 3,” is performed against a dataset version 102. Transaction 3 may use data created by Transaction 1 and data created by Transaction 2 to create a new dataset version 102. After Transaction 3 is executed, it may be decided according to organizational policy that a particular user should not be allowed to access the data created by Transaction 2. In this case, as a result of the provenance tracking ability, and in particular because the catalog 542 records the dependency of Transaction 3 on Transaction 2, if permission to access the data of Transaction 2 is revoked from the particular user, permission to access the data of Transaction 3 may be transitively revoked from the particular user.

The transitive effect of permission revocation (or permission grant) can apply to an arbitrary number of levels in the provenance tracking. For example, returning to the above example, permission may be transitively revoked for any transaction that depends directly or indirectly on the Transaction 3.

According to some embodiments, where provenance tracking in the catalog 542 has column level granularity. Then permission transitivity may apply at the more fine-grained column-level. In this case, permission may be revoked (or granted) on a particular column of a dataset version 102 and based on the column-level provenance tracking in the catalog 542, permission may be transitively revoked on all direct or indirect descendent columns of that column.

Build Service

The system 500 may encompass a build service 518 that manages driver programs 108 which are executed in the analytic system 400 to transform data. The build service 518 may leverage a directed acyclic graph data structure to ensure that driver programs 108 are executed in proper dependency order. The graph may encompass a node representing an output dataset to be computed based on one or more input datasets each represented by a node in the graph with a directed edge between node(s) representing the input dataset(s) and the node representing the output dataset. The build service 518 traverses the DAG in dataset dependency order so that the most upstream dependent datasets are computed first. The build service traverses the DAG from the most upstream dependent datasets toward the node representing the output dataset rebuilding datasets as necessary so that they are up-to-date. Finally, the target output dataset is built once all of the dependent datasets are up-to-date.

The build service 518 may maintain build dependency data 548 representing one or more directed acyclic graphs (also referred to herein as a “build dependency graph”). There may be multiple such graphs if, for example, none of the datasets represented by a graph has a build dependency on a dataset represented by another graph. Each graph comprises nodes and one or more directed edges connecting the nodes. A leaf node of a graph corresponds to a dataset that does not have any build dependencies on another dataset. A non-leaf node of a graph corresponds to a dataset that has a build dependency on at least one other dataset. A root node of a graph is a non-leaf node but where there are no build dependencies on the dataset represented by the root node. A graph may have only one root node or may have multiple root nodes. A directed edge connecting two nodes in a graph represents a build dependency between two datasets. A graph may be represented in a computer memory as an N-ary tree data structure or other suitable data structure.

To illustrate a build dependency graph by a simple example, consider graph 900 of FIG. 9. Each circle of graph 900 represents a node of the build dependency graph and each arrow connecting two circles of graph 900 represents a directed edge of the build dependency graph. The letter in each circle of graph 900 represents the name of the dataset represented by the corresponding node. As shown, datasets F and A are represented by root nodes of the build dependency graph, datasets C, D, and E are represented by leaf nodes of the build dependency graph, and dataset B is represented by a non-leaf node of the build dependency graph. Also shown, dataset F has a build dependency on dataset C, dataset B has build dependencies on datasets C and D, and dataset A has build dependencies on datasets B, C, D, and E. Dataset A′s build dependency on dataset C is transitive by way of dataset B. Datasets F and B may be considered the “parent” datasets of dataset C (and dataset C the “child” of datasets F and B), datasets B and A the parent datasets of dataset D (and dataset D the child of datasets B and A), and dataset A the parent dataset of datasets B, D, and E (and datasets B, D, and E the children of dataset A). However, dataset A is not considered a parent of dataset C and dataset C is not considered a child of dataset A.

To determine whether a given dataset is out-of-date with respect to its build dependencies, the build service 518 traverses the build dependency graph starting at the node corresponding to the given dataset and visits at least every non-leaf node in the graph sub-tree that is rooted at the node corresponding to the given dataset. During the traversal, nodes are visited in post-order according to a depth-first traversal algorithm. For example, referring briefly to FIG. 9, if the given dataset is A, then a post-order depth-first recursive traversal of graph 900 would visit the node for dataset C and the node for dataset D before visiting the node for dataset B and would visit the node for dataset D and the node for dataset E before visiting the node for dataset A.

For each non-leaf node visited during the traversal, a determination is made whether the current version of the dataset corresponding to the visited non-leaf node is out-of-date with respect to any of its child datasets. To determine whether the current version of a dataset is out-of-date with respect to a child dataset, the build service 518 may consult the catalog 542 by way of the catalog service 512. If the current version of the dataset is out-of-date with respect to any of its child datasets, then the build service 518 executes the current version of the driver program for the dataset to generate a new version of the dataset. After the new version of the dataset has been generated, the build service 518 adds a new entry to the catalog 542 reflecting the new version of the dataset. In an embodiment, datasets are recursively rebuilt if dependencies of the dataset to be rebuilt are also out-of-date.

Build Service Branches

Build service branches allow the same driver program 108 to be executed on multiple branches. For example, a driver program 108 on the master branch can be executed to produce a dataset version 102 on the master branch or on another branch (e.g., the develop branch). Build server branches also allow a driver program 108 on a branch to be executed to produce dataset versions 102 on that branch. For example, a driver program 108 on the develop branch can be executed to produce a dataset version 102 that is available only on the develop branch. Build server branches provide isolation of re-computation of graph data across different users and across different execution schedules of a data pipeline. To support branching, the catalog 542 may store information represents a graph of dependencies as opposed to a linear dependency sequence.

Build Fallbacks

The build service may support build fallbacks between branches. For example, suppose the system stores two “raw” datasets A and B that are both updated daily (e.g., with daily web log data for two web services). Each update creates a new version 102 of the dataset and corresponds to a different transaction 104. The datasets are deemed raw in the sense that a driver program 108 is not executed by the analytic system 400 to produce versions 102 of the datasets versions of the datasets.

Further suppose there is a driver program 108 that computes a join between datasets A and B. The join may be performed in a data transformation system such a SQL database system or Apache Spark, for example. More generally, the techniques described herein are agnostic to the particular analytic system that is used. The data to be transformed and the driver program 108 to transform the data can be provided to the analytic system 400 based on information stored in the catalog 542 including where to store the output data.

If the driver program P1 is executed on the master branch, it may produce an output dataset version 102 also on the master branch. Here, the dataset version 102 may be considered a “derived” dataset version 102 because it is derived from one or more other dataset versions 102. Further suppose there is another driver program P2 on the master branch that filters the data in a dataset version 102 and produces a filtered dataset version 102, also on the master branch. Now suppose a new branch called “develop” is created that includes a modification of driver program P2. The modification is stored in the system 500 as a new version of the driver program P2 on the develop branch. For example, the new version of the driver program P2 may apply the filter operation of the prior version of the driver program P2 in a different way.

When requested to build a target branch that is branched from another parent branch, the build service 518 may fall back to the parent branch when a necessary input dataset version 102 is not present on the target branch. For example, if requested to bring the develop branch up to date in the example above, the build service 518 may fallback to providing a dataset version 102 on the master branch as input to a version of a driver program 108 on the develop branch to produce a filtered dataset version 102 on the develop branch.

The catalog 542 may store parent-child and fallback relationships between branches. For example, the develop branch in the example above is a child of the master branch. Another branch, for example an “experimental” branch, may be a further child of the develop branch and so on. As in the above example, when the build service 518 is requested to build a branch that is a child of another branch, the build service 518 may identify a parent dataset version 102 or a parent version of a driver program 108 from a parent branch if no parent version of a dataset or no parent version of the driver program 108 exists on the target child branch. This identification may be recursive if the identification cannot be made on the parent branch and the parent branch is a child branch of another branch and so on.

Thus, the build service 518 supports GIT-style branching for both data and code.

Builds

In a command to the build service 518 to build a branch, the build service may accept as a parameter to the command, a target driver program 108. For example, in an example pipeline on the master branch involving datasets A, B, C, and D and driver programs P1 and P2 where driver program P1 builds the current versions of dataset C from the current versions of datasets A and B and driver program P2 builds the current version of dataset D from the current version of dataset C, the driver programs P1 or P2 may be specified as the target. For example, if driver program P2 is specified as the target, then the build service may read and process data in the catalog 542 to determine whether a transaction 104 updating any of dataset A, dataset B, and driver program P1 has committed since the transaction 104 produced the current version of dataset C was committed. If not, then dataset C is up-to-date, otherwise dataset C is out-of-date. If dataset C is out-of-date, then the build service rebuilds dataset C to create a new current version of dataset C based on the current versions of datasets A and B and the current version of driver program P1. If dataset C is already up-to-date or after dataset C is brought up-to-date, the build service generates a new version of dataset D based on the now current version of dataset C and driver program P2.

Push Build

According to some embodiments, the build service 518 supports a push build. In a push build, rebuilds of all datasets that depend on an upstream dataset or an upstream driver program 108 that has been updated are automatically determined based on information in the catalog 542 and rebuilt. In this case, the build service 518 may accept a target dataset or a target driver program 108 as an input parameter to a push build command. The build service 518 than determines all downstream datasets that need to be rebuilt, if any.

As an example, if the build service 518 receives a push build command with dataset A as the target, then the build service would determine all downstream datasets that are not up-to-date with respect to dataset A and rebuild them. For example, if dataset C is out-of-date with respect to dataset A, then dataset C is rebuilt based on the current versions of datasets A and B and the current version of driver program P1. If dataset C is rebuilt because it is out-of-date, then dataset D will be rebuilt based on the up-to-date version of dataset C and the current version of driver program P2 and so on until all downstream datasets of the target dataset are rebuilt. The build service 518 may perform similar rebuilding if the target of the push build command is a driver program 108.

Triggers

The build service 518 may also support triggers. In this case, a push build may be considered a special case of a trigger. A trigger, generally, is an action (e.g., a rebuild) that is performed by the build service 518 that is triggered by the creation of a new version 102 of a dataset or a new version of a driver program 108 in the system 500.

Build Catalog

According to some embodiments of the present invention, builds data 548 may encompass a build catalog for tracking builds orchestrated by the build service 514. In an embodiment, as exemplified in FIG. 10 an entry in the build catalog corresponding to a non-leaf node in a build dependency graph may comprise a dataset name 1002, a dataset version 1004, and build dependency information 1006. An entry may also comprise a build branch name if the target of a build is a particular branch. Build service 518 adds a new build catalog entry to the build catalog each time a new version of a dataset is built and committed in the context of a transaction 104 facilitated by the build service 518. Thus, the build catalog may store a build catalog entry for each version of a dataset, including the current version of the dataset and any historical (prior) versions of the dataset.

The dataset name 1002 may be a unique identifier of a dataset. The dataset name 1002 may be used to identify the dataset across all versions of the dataset. In other words, the dataset name 1002 may be the same in all build catalog entries for all versions of the dataset.

The dataset version 1004 is a unique identifier of a version of the dataset. Typically, the dataset version 1004 is an ordinal or other information that can be used to determine whether the version of the dataset represented by the dataset version 1004 happened before or happened after other versions of the dataset represented by other build catalog entries in the build catalog with the same dataset name 1002.

In an embodiment, the dataset version 1004 is an identifier (e.g., a transaction commit identifier) assigned by the DBMS 530 to a commit of a transaction that stored the version 1004 of the dataset.

The build dependencies 1006 may comprises a list of one or more dataset build dependencies 1008 and a driver program build dependency 1010. The list of dataset build dependencies 1008 correspond to any child datasets input to the version of the derivation program used to build the version 1004 of the derived dataset. If no such datasets were input, then the list of dataset build dependencies 1008 may be an empty list.

In an embodiment, each dataset build dependency (e.g., 1008A) specifies the name and the version of a dataset that the version 1004 of the derived dataset was built (generated) from. For example, the name and the version of a dataset build dependency (e.g., 1008B) may correspond to a dataset name 1002 and a dataset version 1004 of a build catalog entry for a version of a dataset that the version 1004 of the derived dataset was generated (built) from.

In an embodiment, the derivation program build dependency 1010 specifies the name and the version of a driver program 108 that the build service 518 executed to generate (build) the version 1004 of the derived dataset. For example, the name and the version of the derivation program dependency 1010 may correspond to a derivation program entry for the version of the derivation program that was executed by the build service 518 to generate (build) the version 1004 of the derived dataset.

In an embodiment, the build service 518 identifies the current version of a derived dataset by querying build catalog entries for the build catalog entry comprising the latest (most recent) dataset version 1004 and having a dataset name 1002 matching a name for the derived dataset specified as a query parameter.

In an embodiment, the build service 518 determines whether the current version of a given dataset is out-of-date based on the build catalog entry for the current version of the given dataset. The current version of the given dataset may be considered out-of-date for any one of a number of reasons including because: 1) there is a version of the driver program 108 that is newer than the version used to build the current version of the given dataset, 2) there is a version of a child dataset that is newer the version of the child dataset from which the current version of the given dataset was built, or 3) a dependency of the given dataset on another dataset was added or removed.

Schema Metadata Service

The system 500 encompass a schema metadata service 516 that stores schema information about files 106 that correspond to transactions 104 reflected in the catalog 542. The schema information may encompass metadata related to a dataset, dataset version, a transaction, or a branch. An identifier of a given file 106 identified in the catalog 542 may be passed to the schema metadata service 516 and the schema metadata service 516 may return schema information for the file 106. The schema information may encompass data schema related information such as whether the data in the file 106 is structured as a table, the names of the columns of the table, the data types of the columns, user descriptions of the columns, etc.

The schema information accessible via the schema metadata service 516 may versioned separately from the data itself in the catalog 542. This is allows the schemas to be updated separately from datasets 102 and those updates to be tracked separately. For example, suppose a comma separated file is uploaded to the system 500 as particular dataset version. The catalog 542 may store in association with the particular dataset version identifiers of one or more files 106 in which the CSV data is stored. The catalog 542 may also store in association with each of those one or more file identifiers, schema information describing the format and type of data stored in the corresponding file 106. The schema information for a file 106 may be retrievable via the schema metadata service 516 given an identifier of the file 106 as input. Note that this versioning scheme in the catalog 542 allows new schema information for a file 106 to be associated with the file 106 and accessible via the schema metadata service 516. For example, suppose after storing initial schema information for a file 106 in which the CSV data is stored, updated the schema information is stored that reflects a new or better understanding of the CSV data stored in the file 106. The updated schema information may be retrieved from the schema metadata service for the file 106 without having create a new version of the CSV data or the file 106 in which the CSV data is stored.

When a transformation 108 is executed, the build service 516 may encapsulate the complexities of the separate versioning of datasets and schema information. For example, suppose driver program P1 accepts dataset A and dataset B as input is the target of a build command issued to the build service 518. In response to this build command, the build service 518 may determine from the catalog 542 the file 106 or files 106 in which the data of the current versions of datasets A and B is stored. The build service 518 may then access the schema metadata service 516 to obtain the current versions of the schema information for the file 106 or files 106. The build service 518 may then provide all of identifiers or paths to the file 106 or files 106 and the obtained schema information to the analytic system 400 (e.g., Apache Spark) to execute the driver program P1. The underlying data transformation engine interprets the schema information and applies it to the data in the file 106 or files 106 when executing the transformation A.

Column Provenance

According to some embodiments, the system 500 supports column provenance. FIG. 8 is a flowchart of a process 800 for determining column provenance according to some embodiments of the present invention.

At step 802, a driver program is obtained. Specifically, the instructions of the driver program are parsed.

At step 804, based on the parsing of the driver program, one or more input datasets and the output dataset are identified. The input dataset(s) are the datasets that the driver program will consume data from and apply transformations to in producing the output dataset.

At step 806, the schema(s) for the input dataset(s) and the output dataset are obtained. For example, the schema for an input dataset or the output dataset may be retrieved from the schema service based on an identifier of the dataset.

At step 808, based on the parsing of the driver program, one or more transaction operations are identified in the driver program.

At step 810, for each transformation operation identifier, it is determined, based on the obtained schemas, whether the transformation operation adds a column, removes a column, or updates a column in the output dataset.

At step 812, for each “target” column added to, removed from, or updated in the output dataset, column provenance information for the target column is determined and recorded in a database. The column provenance information for the target column may include the name or identifier of the target column that is added, removed, or updated. In addition, if the target column is added or updated and the values in the added or updated column are based on applying a transformation to values in one or more “dependent” columns (e.g., a join), then the column provenance information for the target column includes a link between the target column and the one or more dependent columns.

At step 814, a column provenance graph is generated and displayed in a user interface based on the recorded column provenance information. The graph may include nodes and edges. The nodes may represent columns that have been added or updated. The edge may represent dependencies between target columns and dependent columns. The presented graph is useful to user for debugging how a transformation changed a dataset including erroneous changes to a dataset. For example, the presented graph may be useful for easily tracking down a column of dataset that incorrectly has all NULL values. This is because the graph can show by nodes and edges the column provenance of the incorrect column. The graph also allows multiple users working on different driver programs to see how their work affects one another and possibly identify dependencies between different users' driver programs.

Column Provenance Graph

According to some embodiments, a column provenance graph is generated and displayed in graphical user interface to a user of the system 500. As mentioned, the graph comprises nodes and edges connected the nodes. The edges may be directed and may represent a transformation of the values in a “source” column to produce values for a “target” column. The edge may be directed from the source column node to the target column node to represent that the values in the source column were transformed to produce the values in the target column. Alternatively, the edge may be directed from the target column node to the source column node to represent that the values in the target column were derived from a transformation applied to values in the source column.

According to some embodiments, a directed edge corresponds to one or more transformation operations in a driver program. According to some embodiments, a user can interact with a directed edge (e.g., click on or touch the directed edge) via the graphical user interface to reveal (e.g., in a pop-up box or other graphical user interface) the transformation operations that are represented by the directed edge.

According to some embodiments, each node of a column provenance graph corresponds to either a starting column from an input dataset to a driver program, an intermediate column that is not a final output column but that is produced by applying a transformation to a starting column or another intermediate column, or a target column of the target output dataset that is produced by applying a transformation to a starting column or an intermediate column.

Dataset Provenance Graph

According to some embodiments, a dataset provenance graph is generated and displayed in graphical user interface to a user of the system 500, in addition to or instead of generation and display of a column provenance graph. The dataset provenance graph comprises nodes and directed edges. Each of the nodes represents a dataset and edges represent derivation dependencies between dataset. For example, a directed edge from dataset A to dataset B represents that data in dataset B is derived from data in dataset A.

According to some embodiments, the nodes representing datasets are color coded in the dataset graph to indicate that they are out-of-date with respect to a direct parent dataset in the graph. For example, if data is added to dataset A after the most recent time dataset B was derived from dataset A, then the node representing dataset B may be color-coded (e.g., in red) to indicate that dataset B is out-of-date with respect dataset A.

According to some embodiments, a directed edge between two nodes representing two datasets in the dataset provenance graph represents a dependency between columns of the two datasets. For example, suppose data in column C1 in dataset A is derived from data in column C2 in dataset B and data in column C3 in dataset C. In this case, a first directed edge may be drawn in the dataset provenance graph from the node representing dataset A to the node representing dataset B and a second directed edge may be drawn in the graph from the node representing dataset A to the node representing dataset C based on determining the derivation dependencies of column C1 of dataset A on columns C2 and C3 of datasets B and C, respectively.

According to some embodiments, the dataset provenance graph allows users to add annotations to nodes and edges of the graph. The annotations can be in the form of textual metadata that is associated with a selected node or edge. The annotations may be visible by other users of the system 500, for example, by clicking on or hovering over or otherwise selecting a node or edge in the graph that is associate with an annotation. The annotations provide a way for users to document the graph for other users with useful information.

According to some embodiments, the user can select one or more nodes in the dataset provenance graph corresponding to one or more datasets that that user wants to refresh. In this context, a refresh of a “target” dataset refers to executing a driver program to rebuild the target dataset based on the latest data available in the “source” datasets on which the target dataset depends according to the graph.

According to some embodiments, if a dataset the user selects as a target is not out-of-date with respect to an ancestor dataset, then the user is prompted to confirm that the target dataset should be rebuilt. The dataset is rebuilt if the user confirms the refresh.

According to some embodiments, if a dataset that is an ancestor to a target dataset the user selects to refresh is out-of-date but the ancestor dataset is not included in the dataset(s) the user selects to refresh, then the user is prompted to add the ancestor dataset to the set of datasets to refresh.

According to some embodiments, the user may enter a parameter that specifies the maximum number of driver programs to execute concurrently on the data analytic cluster 400 so as to avoid overloading the cluster with computation jobs.

According to some embodiments, before any driver programs are scheduled for execution on the analytic cluster 400, the driver programs for the target refresh datasets are compiled for compilation errors (e.g., syntax errors). If any of the driver programs fail compilation, then none of the driver programs are executed so to provide data integrity and to catch potential refresh errors before a time consuming rebuild is initiated.

Basic Computing Device

Referring now to FIG. 6, it is a block diagram that illustrates a basic computing device 600 in which the example embodiment(s) of the present invention may be embodied. Computing device 600 and its components, including their connections, relationships, and functions, is meant to be exemplary only, and not meant to limit implementations of the example embodiment(s). Other computing devices suitable for implementing the example embodiment(s) may have different components, including components with different connections, relationships, and functions.

Computing device 600 may include a bus 602 or other communication mechanism for addressing main memory 606 and for transferring data between and among the various components of device 600.

Computing device 600 may also include one or more hardware processors 604 coupled with bus 602 for processing information. A hardware processor 604 may be a general purpose microprocessor, a system on a chip (SoC), or other processor.

Main memory 606, such as a random access memory (RAM) or other dynamic storage device, also may be coupled to bus 602 for storing information and software instructions to be executed by processor(s) 604. Main memory 606 also may be used for storing temporary variables or other intermediate information during execution of software instructions to be executed by processor(s) 604.

Software instructions, when stored in storage media accessible to processor(s) 604, render computing device 600 into a special-purpose computing device that is customized to perform the operations specified in the software instructions. The terms “software”, “software instructions”, “computer program”, “computer-executable instructions”, and “processor-executable instructions” are to be broadly construed to cover any machine-readable information, whether or not human-readable, for instructing a computing device to perform specific operations, and including, but not limited to, application software, desktop applications, scripts, binaries, operating systems, device drivers, boot loaders, shells, utilities, system software, JAVASCRIPT, web pages, web applications, plugins, embedded software, microcode, compilers, debuggers, interpreters, virtual machines, linkers, and text editors.

Computing device 600 also may include read only memory (ROM) 608 or other static storage device coupled to bus 602 for storing static information and software instructions for processor(s) 604.

One or more mass storage devices 610 may be coupled to bus 602 for persistently storing information and software instructions on fixed or removable media, such as magnetic, optical, solid-state, magnetic-optical, flash memory, or any other available mass storage technology. The mass storage may be shared on a network, or it may be dedicated mass storage. Typically, at least one of the mass storage devices 610 (e.g., the main hard disk for the device) stores a body of program and data for directing operation of the computing device, including an operating system, user application programs, driver and other support files, as well as other data files of all sorts.

Computing device 600 may be coupled via bus 602 to display 612, such as a liquid crystal display (LCD) or other electronic visual display, for displaying information to a computer user. In some configurations, a touch sensitive surface incorporating touch detection technology (e.g., resistive, capacitive, etc.) may be overlaid on display 612 to form a touch sensitive display for communicating touch gesture (e.g., finger or stylus) input to processor(s) 604.

An input device 614, including alphanumeric and other keys, may be coupled to bus 602 for communicating information and command selections to processor 604. In addition to or instead of alphanumeric and other keys, input device 614 may include one or more physical buttons or switches such as, for example, a power (on/off) button, a “home” button, volume control buttons, or the like.

Another type of user input device may be a cursor control 616, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 604 and for controlling cursor movement on display 612. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.

While in some configurations, such as the configuration depicted in FIG. 6, one or more of display 612, input device 614, and cursor control 616 are external components (i.e., peripheral devices) of computing device 600, some or all of display 612, input device 614, and cursor control 616 are integrated as part of the form factor of computing device 600 in other configurations.

Functions of the disclosed systems, methods, and modules may be performed by computing device 600 in response to processor(s) 604 executing one or more programs of software instructions contained in main memory 606. Such software instructions may be read into main memory 606 from another storage medium, such as storage device(s) 610. Execution of the software instructions contained in main memory 606 cause processor(s) 604 to perform the functions of the example embodiment(s).

While functions and operations of the example embodiment(s) may be implemented entirely with software instructions, hard-wired or programmable circuitry of computing device 600 (e.g., an ASIC, a FPGA, or the like) may be used in other embodiments in place of or in combination with software instructions to perform the functions, according to the requirements of the particular implementation at hand.

The term “storage media” as used herein refers to any non-transitory media that store data and/or software instructions that cause a computing device to operate in a specific fashion. Such storage media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, non-volatile random access memory (NVRAM), flash memory, optical disks, magnetic disks, or solid-state drives, such as storage device 610. Volatile media includes dynamic memory, such as main memory 606. Common forms of storage media include, for example, a floppy disk, a flexible disk, hard disk, solid-state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, flash memory, any other memory chip or cartridge.

Storage media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between storage media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 602. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.

Various forms of media may be involved in carrying one or more sequences of one or more software instructions to processor(s) 604 for execution. For example, the software instructions may initially be carried on a magnetic disk or solid-state drive of a remote computer. The remote computer can load the software instructions into its dynamic memory and send the software instructions over a telephone line using a modem. A modem local to computing device 600 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 602. Bus 602 carries the data to main memory 606, from which processor(s) 604 retrieves and executes the software instructions. The software instructions received by main memory 606 may optionally be stored on storage device(s) 610 either before or after execution by processor(s) 604.

Computing device 600 also may include one or more communication interface(s) 618 coupled to bus 602. A communication interface 618 provides a two-way data communication coupling to a wired or wireless network link 620 that is connected to a local network 622 (e.g., Ethernet network, Wireless Local Area Network, cellular phone network, Bluetooth wireless network, or the like). Communication interface 618 sends and receives electrical, electromagnetic, or optical signals that carry digital data streams representing various types of information. For example, communication interface 618 may be a wired network interface card, a wireless network interface card with an integrated radio antenna, or a modem (e.g., ISDN, DSL, or cable modem).

Network link(s) 620 typically provide data communication through one or more networks to other data devices. For example, a network link 620 may provide a connection through a local network 622 to a host computer 624 or to data equipment operated by an Internet Service Provider (ISP) 626. ISP 626 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 628. Local network(s) 622 and Internet 628 use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link(s) 620 and through communication interface(s) 618, which carry the digital data to and from computing device 600, are example forms of transmission media.

Computing device 600 can send messages and receive data, including program code, through the network(s), network link(s) 620 and communication interface(s) 618. In the Internet example, a server 630 might transmit a requested code for an application program through Internet 628, ISP 626, local network(s) 622 and communication interface(s) 618.

The received code may be executed by processor 604 as it is received, and/or stored in storage device 610, or other non-volatile storage for later execution.

Basic Software System

FIG. 7 is a block diagram of a basic software system 700 that may be employed for controlling the operation of computing device 600. Software system 700 and its components, including their connections, relationships, and functions, is meant to be exemplary only, and not meant to limit implementations of the example embodiment(s). Other software systems suitable for implementing the example embodiment(s) may have different components, including components with different connections, relationships, and functions.

Software system 700 is provided for directing the operation of computing device 600. Software system 700, which may be stored in system memory (RAM) 606 and on fixed storage (e.g., hard disk or flash memory) 610, includes a kernel or operating system (OS) 710.

The OS 710 manages low-level aspects of computer operation, including managing execution of processes, memory allocation, file input and output (I/O), and device I/O. One or more application programs, represented as 702A, 702B, 702C . . . 702N, may be “loaded” (e.g., transferred from fixed storage 610 into memory 606) for execution by the system 700. The applications or other software intended for use on device 700 may also be stored as a set of downloadable computer-executable instructions, for example, for downloading and installation from an Internet location (e.g., a Web server, an app store, or other online service).

Software system 700 includes a graphical user interface (GUI) 715, for receiving user commands and data in a graphical (e.g., “point-and-click” or “touch gesture”) fashion. These inputs, in turn, may be acted upon by the system 700 in accordance with instructions from operating system 710 and/or application(s) 702. The GUI 715 also serves to display the results of operation from the OS 710 and application(s) 702, whereupon the user may supply additional inputs or terminate the session (e.g., log off).

OS 710 can execute directly on the bare hardware 720 (e.g., processor(s) 604) of device 600. Alternatively, a hypervisor or virtual machine monitor (VMM) 730 may be interposed between the bare hardware 720 and the OS 710. In this configuration, VMM 730 acts as a software “cushion” or virtualization layer between the OS 710 and the bare hardware 720 of the device 600.

VMM 730 instantiates and runs one or more virtual machine instances (“guest machines”). Each guest machine comprises a “guest” operating system, such as OS 710, and one or more applications, such as application(s) 702, designed to execute on the guest operating system. The VMM 730 presents the guest operating systems with a virtual operating platform and manages the execution of the guest operating systems.

In some instances, the VMM 730 may allow a guest operating system to run as if it is running on the bare hardware 720 of device 600 directly. In these instances, the same Revision of the guest operating system configured to execute on the bare hardware 720 directly may also execute on VMM 730 without modification or reconfiguration. In other words, VMM 730 may provide full hardware and CPU virtualization to a guest operating system in some instances.

In other instances, a guest operating system may be specially designed or configured to execute on VMM 730 for efficiency. In these instances, the guest operating system is “aware” that it executes on a virtual machine monitor. In other words, VMM 730 may provide para-virtualization to a guest operating system in some instances.

The above-described basic computer hardware and software is presented for purpose of illustrating the basic underlying computer components that may be employed for implementing the example embodiment(s). The example embodiment(s), however, are not necessarily limited to any particular computing environment or computing device configuration. Instead, the example embodiment(s) may be implemented in any type of system architecture or processing environment that one skilled in the art, in light of this disclosure, would understand as capable of supporting the features and functions of the example embodiment(s) presented herein.

Extensions And Alternatives

In the foregoing specification, the example embodiment(s) of the present invention have been described with reference to numerous specific details. However, the details may vary from implementation to implementation according to the requirements of the particular implement at hand. The example embodiment(s) are, accordingly, to be regarded in an illustrative rather than a restrictive sense.

Claims

1. A method for data revision control in a large-scale data analytic system: storing a first version of a first dataset that is derived from a first version of a second dataset based on a first execution of a first version of a driver program;storing, in a build catalog, a first build catalog entry comprising an identifier of the first version of the first dataset, an identifier of the first version of the second dataset, a first branch name, and an identifier of the first version of the driver program;storing a second version of the first dataset that is derived from a second version of the second dataset based on a second execution of the first version of the driver program;storing, in the build catalog, a second build catalog entry comprising an identifier of the second version of the first dataset, an identifier of the second version of the second dataset, a second branch name that is different from the first branch name, and an identifier of the first version of the driver program, the build catalog including the first build catalog entry and the second build catalog entry; andcausing display of a provenance graph in a graphical user interface based on the first build catalog entry and the second build catalog entry, the provenance graph display comprising: a first node representing the first version of the first dataset, a second node representing the first version of the second dataset, a third node representing the second version of the first dataset, a fourth node, representing the second version of the second dataset, a first directed edge from the first node to the second node, and a second directed edge from the third node to the fourth node.
2. The method of claim 1, further comprising: storing a first transaction entry in a database, the first transaction entry comprising a first transaction commit identifier of the first version of the first dataset;wherein the first build catalog entry comprises the first transaction commit identifier;storing a second transaction entry in the database, the second transaction entry comprising a second transaction commit identifier of the first version of the second dataset;wherein the identifier of the first version of the second dataset in the first build catalog entry is the second transaction commit identifier;storing a third transaction entry in the database, the third transaction entry comprising a third transaction commit identifier of the second version of the second dataset;wherein the identifier of the second version of the second dataset in the second build catalog entry is the third transaction commit identifier.
3. The method of claim 1, further comprising storing the first version of the first dataset in a distributed file system.
4. The method of claim 1, wherein the identifier of the first version of the first dataset is an identifier assigned to a commit of a transaction in context of which the first version of the first dataset is stored.
5. The method of claim 1, wherein the first version of the driver program, when executed to produce the first version of the first dataset, transforms data of the first version of the second dataset to produce data of the first version of the first dataset.
6. The method of claim 1, wherein the provenance graph comprises nodes and directed edges there between, each node representing a dataset and each directed edge between two nodes representing a derivation dependency between datasets.
7. The method of claim 1, wherein a node is color-coded to indicate that the first dataset is out-of-date with respect to the second dataset.
8. One or more non-transitory computer-readable media storing instructions for execution by one or more processors, the instructions configured for performing operations comprising: storing a first version of a first dataset that is derived from a first version of a second dataset based on a first execution of a first version of a driver program;storing, in a build catalog, a first build catalog entry comprising an identifier of the first version of the first dataset, an identifier of the first version of the second dataset, a first branch name, and an identifier of the first version of the driver program;storing a second version of the first dataset that is derived from a second version of the second dataset based on a second execution of the first version of the driver program;storing, in the build catalog, a second build catalog entry comprising an identifier of the second version of the first dataset, an identifier of the second version of the second dataset, a second branch name that is different from the first branch name, and an identifier of the first version of the driver program, the build catalog including the first build catalog entry and the second build catalog entry; andcausing display of a provenance graph in a graphical user interface based on the first build catalog entry and the second build catalog entry, the provenance graph display comprising: a first node representing the first version of the first dataset, a second node representing the first version of the second dataset, a third node representing the second version of the first dataset, a fourth node, representing the second version of the second dataset, a first directed edge from the first node to the second node, and a second directed edge from the third node to the fourth node.
9. The one or more non-transitory computer-readable media of claim 8, wherein the operations further comprise: storing a first transaction entry in a database, the first transaction entry comprising a first transaction commit identifier of the first version of the first dataset;wherein the first build catalog entry comprises the first transaction commit identifier;storing a second transaction entry in the database, the second transaction entry comprising a second transaction commit identifier of the first version of the second dataset;wherein the identifier of the first version of the second dataset in the first build catalog entry is the second transaction commit identifier;storing a third transaction entry in the database, the third transaction entry comprising a third transaction commit identifier of the second version of the second dataset;wherein the identifier of the second version of the second dataset in the second build catalog entry is the third transaction commit identifier.
10. The one or more non-transitory computer-readable media of claim 8, wherein the operations further comprise: storing the first version of the first dataset in a distributed file system.
11. The one or more non-transitory computer-readable media of claim 8, wherein the identifier of the first version of the first dataset is an identifier assigned to a commit of a transaction in context of which the first version of the first dataset is stored.
12. The one or more non-transitory computer-readable media of claim 8, wherein the first version of the driver program, when executed to produce the first version of the first dataset, transforms data of the first version of the second dataset to produce data of the first version of the first dataset.
13. The one or more non-transitory computer-readable media of claim 8, wherein the provenance graph comprises nodes and directed edges there between, each node representing a dataset and each directed edge between two nodes representing a derivation dependency between datasets.
14. The one or more non-transitory computer-readable media of claim 8, wherein a node is color-coded to indicate that the first dataset is out-of-date with respect to the second dataset.
15. A system, comprising: one or more processors;one or more storage media storing one or more programs which, when executed by the one or more processors, cause:storing a first version of a first dataset that is derived from a first version of a second dataset based on a first execution of a first version of a driver program;storing, in a build catalog, a first build catalog entry comprising an identifier of the first version of the first dataset, an identifier of the first version of the second dataset, a first branch name, and an identifier of the first version of the driver program;storing a second version of the first dataset that is derived from a second version of the second dataset based on a second execution of the first version of the driver program;storing, in the build catalog, a second build catalog entry comprising an identifier of the second version of the first dataset, an identifier of the second version of the second dataset, a second branch name that is different from the first branch name, and an identifier of the first version of the driver program, the build catalog including the first build catalog entry and the second build catalog entry; andcausing display of a provenance graph in a graphical user interface based on the first build catalog entry and the second build catalog entry, the provenance graph display comprising: a first node representing the first version of the first dataset, a second node representing the first version of the second dataset, a third node representing the second version of the first dataset, a fourth node, representing the second version of the second dataset, a first directed edge from the first node to the second node, and a second directed edge from the third node to the fourth node.
16. The system of claim 15 further comprising: storing a first transaction entry in a database, the first transaction entry comprising a first transaction commit identifier of the first version of the first dataset;wherein the first build catalog entry comprises the first transaction commit identifier;storing a second transaction entry in the database, the second transaction entry comprising a second transaction commit identifier of the first version of the second dataset;wherein the identifier of the first version of the second dataset in the first build catalog entry is the second transaction commit identifier;storing a third transaction entry in the database, the third transaction entry comprising a third transaction commit identifier of the second version of the second dataset;wherein the identifier of the second version of the second dataset in the second build catalog entry is the third transaction commit identifier.
17. The system of claim 15, wherein the first version of the driver program, when executed to produce the first version of the first dataset, transforms data of the first version of the second dataset to produce data of the first version of the first dataset.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit as a Continuation of application Ser. No. 15/262,207 filed Sep. 12, 2016, which claims the benefit of U.S. Provisional Application 62/349,548, filed Jun. 13, 2016, the entire contents of all of which are hereby incorporated by reference as if fully set forth herein. The applicant hereby rescinds any disclaimer of scope in the parent applications or the prosecution history thereof and advises the USPTO that the claims in this application may be broader than any claim in the parent applications. This application is related to U.S. application Ser. No. 14/533,433, filed Nov. 5, 2014, issued on Jan. 5, 2016 as U.S. Pat. No. 9,229,952; and U.S. application Ser. No. 14/879,916, filed Oct. 9, 2015, the entire contents of both of which are hereby incorporated by reference as if fully set forth herein.

US Referenced Citations (434)

Number	Name	Date	Kind
5632009	Rao et al.	May 1997	A
5818737	Orr et al.	Oct 1998	A
6057757	Arrowsmith et al.	May 2000	A
6094653	Li et al.	Jul 2000	A
6167405	Rosensteel, Jr. et al.	Dec 2000	A
6289338	Stoffel et al.	Sep 2001	B1
6430305	Decker	Aug 2002	B1
6456997	Shukla	Sep 2002	B1
6463404	Appleby	Oct 2002	B1
6523172	Martinez-Guerra et al.	Feb 2003	B1
6539538	Brewster et al.	Mar 2003	B1
6549752	Tsukamoto	Apr 2003	B2
6594672	Lampson et al.	Jul 2003	B1
6640231	Andersen et al.	Oct 2003	B1
6643613	McGee et al.	Nov 2003	B2
6748481	Parry et al.	Jun 2004	B1
6820135	Dingman	Nov 2004	B1
6877137	Rivette et al.	Apr 2005	B1
6978419	Kantrowitz	Dec 2005	B1
6980984	Huffman et al.	Dec 2005	B1
7027974	Busch et al.	Apr 2006	B1
7028223	Kolawa et al.	Apr 2006	B1
7089541	Ungar	Aug 2006	B2
7117430	Maguire et al.	Oct 2006	B2
7168039	Bertram	Jan 2007	B2
7194680	Roy et al.	Mar 2007	B1
7237192	Stephenson et al.	Jun 2007	B1
7240330	Fairweather	Jul 2007	B2
7451397	Weber et al.	Nov 2008	B2
7533069	Fairweather	May 2009	B2
7617232	Gabbert et al.	Nov 2009	B2
7685083	Fairweather	Mar 2010	B2
7739246	Mooney et al.	Jun 2010	B2
7756843	Palmer	Jul 2010	B1
7761407	Stern	Jul 2010	B1
7800796	Saito	Sep 2010	B2
7814084	Hallett et al.	Oct 2010	B2
7877421	Berger et al.	Jan 2011	B2
7917376	Bellin et al.	Mar 2011	B2
7941321	Greenstein et al.	May 2011	B2
7962495	Jain et al.	Jun 2011	B2
7971150	Raskutti et al.	Jun 2011	B2
7984374	Caro et al.	Jul 2011	B2
8036971	Aymeloglu et al.	Oct 2011	B2
8046283	Burns	Oct 2011	B2
8054756	Chand et al.	Nov 2011	B2
8117022	Linker	Feb 2012	B2
8132149	Shenfield et al.	Mar 2012	B2
8196184	Amirov et al.	Jun 2012	B2
8214490	Vos et al.	Jul 2012	B1
8229902	Vishniac et al.	Jul 2012	B2
8271948	Talozi et al.	Sep 2012	B2
8290838	Thakur et al.	Oct 2012	B1
8290926	Ozzie et al.	Oct 2012	B2
8302855	Ma et al.	Nov 2012	B2
8332354	Chatterjee et al.	Dec 2012	B1
8418085	Snook et al.	Apr 2013	B2
8473454	Evanitsky et al.	Jun 2013	B2
8484115	Aymeloglu et al.	Jul 2013	B2
8489623	Jain et al.	Jul 2013	B2
8510304	Briggs	Aug 2013	B1
8554709	Goodson et al.	Oct 2013	B2
8560494	Downing	Oct 2013	B1
8589273	Creeden et al.	Nov 2013	B2
8595234	Siripuapu et al.	Nov 2013	B2
8601326	Kirn	Dec 2013	B1
8639757	Zang et al.	Jan 2014	B1
8676857	Adams et al.	Mar 2014	B1
8688573	Ruknoic et al.	Apr 2014	B1
8689182	Leithead et al.	Apr 2014	B2
8744890	Bernier	Jun 2014	B1
8787939	Papakipos et al.	Jul 2014	B2
8799867	Peri-Glass et al.	Aug 2014	B1
8812960	Sun et al.	Aug 2014	B1
8838556	Reiner et al.	Sep 2014	B1
8855999	Elliot	Oct 2014	B1
8903717	Elliot	Dec 2014	B2
8924388	Elliot et al.	Dec 2014	B2
8924389	Elliot et al.	Dec 2014	B2
8930897	Nassar	Jan 2015	B2
8938434	Jain et al.	Jan 2015	B2
8938686	Erenrich et al.	Jan 2015	B1
8949164	Mohler	Feb 2015	B1
8954410	Chang et al.	Feb 2015	B2
9009827	Albertson et al.	Apr 2015	B1
9069842	Melby	Jun 2015	B2
9092482	Harris et al.	Jul 2015	B2
9100428	Visbal	Aug 2015	B1
9116975	Shankar et al.	Aug 2015	B2
9129219	Robertson et al.	Sep 2015	B1
9146954	Boe et al.	Sep 2015	B1
9201920	Jain et al.	Dec 2015	B2
9208159	Stowe et al.	Dec 2015	B2
9223773	Isaacson	Dec 2015	B2
9229952	Meacham et al.	Jan 2016	B1
9230060	Friedlander et al.	Jan 2016	B2
9230280	Maag et al.	Jan 2016	B1
9280532	Cicerone	Mar 2016	B2
9576015	Tolnay et al.	Feb 2017	B1
20010056522	Satyanarayana	Dec 2001	A1
20020065708	Senay et al.	May 2002	A1
20020095360	Joao	Jul 2002	A1
20020095658	Shulman	Jul 2002	A1
20020103705	Brady	Aug 2002	A1
20020147805	Leshem et al.	Oct 2002	A1
20020194058	Eldering	Dec 2002	A1
20030036848	Sheha et al.	Feb 2003	A1
20030074187	Ait-Mokhtar et al.	Apr 2003	A1
20030088438	Maughan et al.	May 2003	A1
20030126102	Borthwick	Jul 2003	A1
20030130993	Mendelevitch et al.	Jul 2003	A1
20030171942	Gaito	Sep 2003	A1
20030172053	Fairweather	Sep 2003	A1
20030177112	Gardner	Sep 2003	A1
20030229848	Arend et al.	Dec 2003	A1
20040032432	Baynger	Feb 2004	A1
20040034570	Davis	Feb 2004	A1
20040044992	Muller et al.	Mar 2004	A1
20040083466	Dapp et al.	Apr 2004	A1
20040111410	Burgoon et al.	Jun 2004	A1
20040111480	Yue	Jun 2004	A1
20040117387	Civetta et al.	Jun 2004	A1
20040153418	Hanweck	Aug 2004	A1
20040153837	Preston et al.	Aug 2004	A1
20040163039	Gorman	Aug 2004	A1
20040193600	Kaasten et al.	Sep 2004	A1
20040205524	Richter et al.	Oct 2004	A1
20040221223	Yu et al.	Nov 2004	A1
20040236688	Bozeman	Nov 2004	A1
20040260702	Cragun et al.	Dec 2004	A1
20050010472	Quatse et al.	Jan 2005	A1
20050039119	Parks et al.	Feb 2005	A1
20050065811	Chu et al.	Mar 2005	A1
20050078858	Yao et al.	Apr 2005	A1
20050086207	Heuer et al.	Apr 2005	A1
20050091420	Snover et al.	Apr 2005	A1
20050102328	Ring et al.	May 2005	A1
20050154628	Eckart et al.	Jul 2005	A1
20050154769	Eckart et al.	Jul 2005	A1
20050183005	Denoue et al.	Aug 2005	A1
20060026120	Carolan et al.	Feb 2006	A1
20060074881	Vembu et al.	Apr 2006	A1
20060095521	Patinkin	May 2006	A1
20060106847	Eckardt et al.	May 2006	A1
20060129992	Oberholtzer et al.	Jun 2006	A1
20060143034	Rothermel	Jun 2006	A1
20060143075	Carr et al.	Jun 2006	A1
20060143079	Basak et al.	Jun 2006	A1
20060161558	Tamma et al.	Jul 2006	A1
20060184889	Molander	Aug 2006	A1
20060209085	Wong et al.	Sep 2006	A1
20060218405	Ama et al.	Sep 2006	A1
20060242040	Rader	Oct 2006	A1
20060271838	Carro	Nov 2006	A1
20070000999	Kubo et al.	Jan 2007	A1
20070011304	Error	Jan 2007	A1
20070038646	Thota	Feb 2007	A1
20070074169	Chess et al.	Mar 2007	A1
20070078872	Cohen	Apr 2007	A1
20070112714	Fairweather	May 2007	A1
20070150369	Zivin	Jun 2007	A1
20070150801	Chidlovskii et al.	Jun 2007	A1
20070156673	Maga	Jul 2007	A1
20070185850	Walters et al.	Aug 2007	A1
20070185867	Maga	Aug 2007	A1
20070192265	Chopin et al.	Aug 2007	A1
20070208736	Tanigawa et al.	Sep 2007	A1
20070233709	Abnous	Oct 2007	A1
20070284433	Domenica et al.	Dec 2007	A1
20080034327	Cisler et al.	Feb 2008	A1
20080040275	Paulsen et al.	Feb 2008	A1
20080069081	Chand et al.	Mar 2008	A1
20080103996	Forman et al.	May 2008	A1
20080104060	Abhyankar et al.	May 2008	A1
20080104407	Horne et al.	May 2008	A1
20080140387	Linker	Jun 2008	A1
20080148398	Mezack et al.	Jun 2008	A1
20080162616	Worley et al.	Jul 2008	A1
20080201339	McGrew	Aug 2008	A1
20080215546	Baum et al.	Sep 2008	A1
20080222295	Robinson et al.	Sep 2008	A1
20080228467	Womack et al.	Sep 2008	A1
20080243711	Aymeloglu et al.	Oct 2008	A1
20080249983	Meisels et al.	Oct 2008	A1
20080255973	El Wade et al.	Oct 2008	A1
20080271838	Dierickx	Nov 2008	A1
20080281580	Zabokritski	Nov 2008	A1
20080313132	Hao et al.	Dec 2008	A1
20090037417	Shankar et al.	Feb 2009	A1
20090055251	Shah et al.	Feb 2009	A1
20090076845	Bellin et al.	Mar 2009	A1
20090094166	Aymeloglu et al.	Apr 2009	A1
20090106178	Chu	Apr 2009	A1
20090112745	Stefanescu	Apr 2009	A1
20090125359	Knapic	May 2009	A1
20090125459	Norton et al.	May 2009	A1
20090150854	Elaasar et al.	Jun 2009	A1
20090172669	Bobak et al.	Jul 2009	A1
20090172821	Daira et al.	Jul 2009	A1
20090177962	Gusmorino et al.	Jul 2009	A1
20090187546	Whyte et al.	Jul 2009	A1
20090187548	Ji et al.	Jul 2009	A1
20090199047	Vaitheeswaran et al.	Aug 2009	A1
20090228507	Jain et al.	Sep 2009	A1
20090240664	Dinker et al.	Sep 2009	A1
20090249244	Robinson et al.	Oct 2009	A1
20090254970	Agarwal et al.	Oct 2009	A1
20090254971	Herz	Oct 2009	A1
20090271343	Vaiciulis et al.	Oct 2009	A1
20090282097	Alberti et al.	Nov 2009	A1
20090307049	Elliott et al.	Dec 2009	A1
20090310816	Freire	Dec 2009	A1
20090313463	Pang et al.	Dec 2009	A1
20090319418	Herz	Dec 2009	A1
20090319891	MacKinlay	Dec 2009	A1
20090327208	Bittner et al.	Dec 2009	A1
20100011282	Dollard et al.	Jan 2010	A1
20100030722	Goodson et al.	Feb 2010	A1
20100031141	Summers et al.	Feb 2010	A1
20100042922	Bradateanu et al.	Feb 2010	A1
20100057622	Faith et al.	Mar 2010	A1
20100070489	Aymeloglu et al.	Mar 2010	A1
20100070842	Aymeloglu et al.	Mar 2010	A1
20100082532	Shaik et al.	Apr 2010	A1
20100098318	Anderson	Apr 2010	A1
20100114629	Adler	May 2010	A1
20100114887	Conway et al.	May 2010	A1
20100125470	Chisholm	May 2010	A1
20100131502	Fordham	May 2010	A1
20100161735	Sharma	Jun 2010	A1
20100191563	Schlaifer et al.	Jul 2010	A1
20100204983	Chung et al.	Aug 2010	A1
20100211550	Daniello et al.	Aug 2010	A1
20100228786	Torok	Sep 2010	A1
20100228812	Uomini	Sep 2010	A1
20100235915	Memon et al.	Sep 2010	A1
20100257015	Molander	Oct 2010	A1
20100257515	Bates et al.	Oct 2010	A1
20100262688	Hussain et al.	Oct 2010	A1
20100306285	Shah et al.	Dec 2010	A1
20100312837	Bodapati et al.	Dec 2010	A1
20100313119	Baldwin et al.	Dec 2010	A1
20100318838	Katano et al.	Dec 2010	A1
20100325526	Ellis et al.	Dec 2010	A1
20110004498	Readshaw	Jan 2011	A1
20110029526	Knight et al.	Feb 2011	A1
20110047540	Williams et al.	Feb 2011	A1
20110061013	Bilicki et al.	Mar 2011	A1
20110078055	Faribault et al.	Mar 2011	A1
20110078173	Seligmann et al.	Mar 2011	A1
20110093327	Fordyce et al.	Apr 2011	A1
20110099133	Chang et al.	Apr 2011	A1
20110131547	Elaasar	Jun 2011	A1
20110153384	Horne et al.	Jun 2011	A1
20110153592	DeMarcken	Jun 2011	A1
20110161132	Goel et al.	Jun 2011	A1
20110173032	Payne et al.	Jul 2011	A1
20110173093	Psota et al.	Jul 2011	A1
20110181598	O'Neall et al.	Jul 2011	A1
20110208565	Ross et al.	Aug 2011	A1
20110213655	Henkin	Sep 2011	A1
20110213791	Jain et al.	Sep 2011	A1
20110218955	Tang	Sep 2011	A1
20110219321	Gonzalez et al.	Sep 2011	A1
20110258158	Resende et al.	Oct 2011	A1
20110258216	Supakkul et al.	Oct 2011	A1
20110270604	Qi et al.	Nov 2011	A1
20110270834	Sokolan et al.	Nov 2011	A1
20110289397	Eastmond et al.	Nov 2011	A1
20110289407	Naik et al.	Nov 2011	A1
20110289420	Morioka et al.	Nov 2011	A1
20110295649	Fine	Dec 2011	A1
20110295795	Venkatasubramanian et al.	Dec 2011	A1
20110314007	Dassa et al.	Dec 2011	A1
20110314024	Chang et al.	Dec 2011	A1
20120004904	Shin et al.	Jan 2012	A1
20120011238	Rathod	Jan 2012	A1
20120011245	Gillette et al.	Jan 2012	A1
20120022945	Falkenborg et al.	Jan 2012	A1
20120036013	Neuhaus et al.	Feb 2012	A1
20120054284	Rakshit	Mar 2012	A1
20120059853	Jagota	Mar 2012	A1
20120066166	Curbera et al.	Mar 2012	A1
20120075324	Cardno et al.	Mar 2012	A1
20120079363	Folting et al.	Mar 2012	A1
20120084117	Tavares et al.	Apr 2012	A1
20120084287	Lakshminarayan et al.	Apr 2012	A1
20120117082	Koperda et al.	May 2012	A1
20120123989	Yu et al.	May 2012	A1
20120124179	Cappio et al.	May 2012	A1
20120131512	Takeuchi et al.	May 2012	A1
20120137235	Ts et al.	May 2012	A1
20120159362	Brown et al.	Jun 2012	A1
20120170847	Tsukidate	Jul 2012	A1
20120173381	Smith	Jul 2012	A1
20120191446	Binsztok et al.	Jul 2012	A1
20120197651	Robinson et al.	Aug 2012	A1
20120203708	Psota et al.	Aug 2012	A1
20120215784	King et al.	Aug 2012	A1
20120221553	Wittmer et al.	Aug 2012	A1
20120226523	Weiss	Sep 2012	A1
20120245976	Kumar et al.	Sep 2012	A1
20120290527	Yalamanchilli	Nov 2012	A1
20120290879	Shibuya et al.	Nov 2012	A1
20120296907	Long et al.	Nov 2012	A1
20120304150	Leithead et al.	Nov 2012	A1
20120323888	Osann, Jr.	Dec 2012	A1
20130006916	McBride et al.	Jan 2013	A1
20130006947	Olumuyiwa et al.	Jan 2013	A1
20130016106	Yip et al.	Jan 2013	A1
20130024268	Manickavelu	Jan 2013	A1
20130024731	Shochat et al.	Jan 2013	A1
20130046635	Grigg et al.	Feb 2013	A1
20130050217	Armitage	Feb 2013	A1
20130054306	Bhalla	Feb 2013	A1
20130057551	Ebert et al.	Mar 2013	A1
20130060742	Chang et al.	Mar 2013	A1
20130073454	Busch	Mar 2013	A1
20130086482	Parsons	Apr 2013	A1
20130091084	Lee	Apr 2013	A1
20130096988	Grossman et al.	Apr 2013	A1
20130097130	Bingol et al.	Apr 2013	A1
20130110746	Ahn	May 2013	A1
20130110822	Ikeda et al.	May 2013	A1
20130117011	Ahmed et al.	May 2013	A1
20130124193	Holmberg	May 2013	A1
20130151148	Parundekar et al.	Jun 2013	A1
20130151388	Falkenborg et al.	Jun 2013	A1
20130151453	Bhanot et al.	Jun 2013	A1
20130157234	Gulli et al.	Jun 2013	A1
20130166348	Scotto	Jun 2013	A1
20130166480	Popescu et al.	Jun 2013	A1
20130185245	Anderson	Jul 2013	A1
20130185307	El-Yaniv et al.	Jul 2013	A1
20130198565	Mancoridis et al.	Aug 2013	A1
20130225212	Khan	Aug 2013	A1
20130226318	Procyk	Aug 2013	A1
20130226879	Talukder et al.	Aug 2013	A1
20130238616	Rose et al.	Sep 2013	A1
20130246170	Gross et al.	Sep 2013	A1
20130246316	Zhao et al.	Sep 2013	A1
20130246537	Gaddala	Sep 2013	A1
20130246560	Feng et al.	Sep 2013	A1
20130246597	Iizawa et al.	Sep 2013	A1
20130251233	Yang et al.	Sep 2013	A1
20130263019	Castellanos et al.	Oct 2013	A1
20130267207	Hao et al.	Oct 2013	A1
20130275446	Jain et al.	Oct 2013	A1
20130282696	John et al.	Oct 2013	A1
20130290825	Arndt et al.	Oct 2013	A1
20130297619	Chandrasekaran et al.	Nov 2013	A1
20130304770	Boero et al.	Nov 2013	A1
20130311375	Priebatsch	Nov 2013	A1
20140012796	Petersen et al.	Jan 2014	A1
20140019423	Leinsberger et al.	Jan 2014	A1
20140040371	Gurevich et al.	Feb 2014	A1
20140047319	Eberlein	Feb 2014	A1
20140058914	Song et al.	Feb 2014	A1
20140067611	Adachi et al.	Mar 2014	A1
20140068487	Steiger et al.	Mar 2014	A1
20140095273	Tang et al.	Apr 2014	A1
20140095509	Patton	Apr 2014	A1
20140108068	Williams	Apr 2014	A1
20140108380	Gotz et al.	Apr 2014	A1
20140108985	Scott et al.	Apr 2014	A1
20140123279	Bishop et al.	May 2014	A1
20140129261	Bothwell et al.	May 2014	A1
20140136285	Carvalho	May 2014	A1
20140143009	Brice et al.	May 2014	A1
20140156527	Grigg et al.	Jun 2014	A1
20140156617	Tomkins	Jun 2014	A1
20140157172	Peery et al.	Jun 2014	A1
20140164502	Khodorenko et al.	Jun 2014	A1
20140181833	Bird et al.	Jun 2014	A1
20140189536	Lange et al.	Jul 2014	A1
20140195515	Baker et al.	Jul 2014	A1
20140222521	Chait	Aug 2014	A1
20140222793	Sadkin et al.	Aug 2014	A1
20140229554	Grunin et al.	Aug 2014	A1
20140244388	Manouchehri et al.	Aug 2014	A1
20140258246	Lo Faro et al.	Sep 2014	A1
20140279979	Yost et al.	Sep 2014	A1
20140297592	Ohtake	Oct 2014	A1
20140310266	Greenfield	Oct 2014	A1
20140316911	Gross	Oct 2014	A1
20140324876	Konik et al.	Oct 2014	A1
20140344230	Krause et al.	Nov 2014	A1
20140351070	Christner et al.	Nov 2014	A1
20140358829	Hurwitz	Dec 2014	A1
20140366132	Stiansen et al.	Dec 2014	A1
20150012509	Kirn	Jan 2015	A1
20150019394	Unser et al.	Jan 2015	A1
20150039886	Kahol et al.	Feb 2015	A1
20150046481	Elliot	Feb 2015	A1
20150073929	Psota et al.	Mar 2015	A1
20150073954	Braff	Mar 2015	A1
20150089353	Folkening	Mar 2015	A1
20150095773	Gonsalves et al.	Apr 2015	A1
20150100559	Nassar	Apr 2015	A1
20150100897	Sun et al.	Apr 2015	A1
20150106379	Elliot et al.	Apr 2015	A1
20150112641	Faraj	Apr 2015	A1
20150134666	Gattiker et al.	May 2015	A1
20150135256	Hoy et al.	May 2015	A1
20150142766	Jain et al.	May 2015	A1
20150169709	Kara et al.	Jun 2015	A1
20150169726	Kara et al.	Jun 2015	A1
20150170077	Kara et al.	Jun 2015	A1
20150188715	Castelluci et al.	Jul 2015	A1
20150188872	White	Jul 2015	A1
20150212663	Papale et al.	Jul 2015	A1
20150213043	Ishii et al.	Jul 2015	A1
20150213134	Nie et al.	Jul 2015	A1
20150242397	Zhuang	Aug 2015	A1
20150261817	Harris et al.	Sep 2015	A1
20150261847	Ducott et al.	Sep 2015	A1
20150324868	Kaftan et al.	Nov 2015	A1
20150338233	Cervelli et al.	Nov 2015	A1
20150341467	Lim et al.	Nov 2015	A1
20150347903	Saxena et al.	Dec 2015	A1
20150378996	Kesin et al.	Dec 2015	A1
20150379413	Robertson et al.	Dec 2015	A1
20160004667	Chakerian et al.	Jan 2016	A1
20160004764	Chakerian et al.	Jan 2016	A1
20160034545	Shankar et al.	Feb 2016	A1
20160062555	Ward et al.	Mar 2016	A1
20160098173	Slawinski et al.	Apr 2016	A1
20160125000	Meacham et al.	May 2016	A1
20160147730	Cicerone	May 2016	A1
20170039253	Bond	Feb 2017	A1
20170068698	Tolnay et al.	Mar 2017	A1
20170083595	Tolnay et al.	Mar 2017	A1
20170097950	Meacham et al.	Apr 2017	A1
20170220663	Zhao	Aug 2017	A1

Foreign Referenced Citations (52)

Number	Date	Country
2014206155	Dec 2015	AU
2014250678	Feb 2016	AU
2666364	Jan 2015	CA
102546446	Jul 2012	CN
103167093	Jun 2013	CN
102054015	May 2014	CN
102014204827	Sep 2014	DE
102014204830	Sep 2014	DE
102014204834	Sep 2014	DE
102014204840	Sep 2014	DE
102014213036	Jan 2015	DE
102014215621	Feb 2015	DE
1566758	Aug 2005	EP
1 672 527	Jun 2006	EP
1962222	Aug 2008	EP
2221725	Aug 2010	EP
2487610	Aug 2012	EP
2551799	Jan 2013	EP
2778913	Sep 2014	EP
2778914	Sep 2014	EP
2778986	Sep 2014	EP
2858018	Apr 2015	EP
2863326	Apr 2015	EP
2869211	May 2015	EP
2884439	Jun 2015	EP
2884440	Jun 2015	EP
2889814	Jul 2015	EP
2892197	Jul 2015	EP
2897051	Jul 2015	EP
2911078	Aug 2015	EP
2963595	Jan 2016	EP
3018553	May 2016	EP
3258393	Dec 2017	EP
2366498	Mar 2002	GB
2513007	Oct 2014	GB
2517582	Feb 2015	GB
2518745	Apr 2015	GB
2013134	Jan 2015	NL
2013306	Feb 2015	NL
2011642	Aug 2015	NL
WO 2002035376	May 2002	WO
WO 2002065353	Aug 2002	WO
WO 2003060751	Jul 2003	WO
WO 2005010685	Feb 2005	WO
WO 2005116851	Dec 2005	WO
WO 2008064207	May 2008	WO
WO 20100098958	Sep 2010	WO
WO 2011017289	May 2011	WO
WO 2011071833	Jun 2011	WO
WO2012025915	Mar 2012	WO
WO 2012079836	Jun 2012	WO
WO 2013067077	May 2013	WO

Non-Patent Literature Citations (253)

Entry
U.S. Appl. No. 14/134,558, filed Dec. 19, 2013, Office Action, dated Oct. 7, 2015.
U.S. Appl. No. 14/025,653, filed Sep. 12, 2013, Interview Summary, dated Mar. 3, 2016.
U.S. Appl. No. 14/025,653, filed Sep. 12, 2013, Office Action Interview, dated Oct. 6, 2015.
U.S. Appl. No. 14/508,696, filed Oct. 7, 2014, Office Action, dated Mar. 2, 2015.
U.S. Appl. No. 14/533,433, filed Nov. 5, 2014, Notice of Allowance, dated Sep. 1, 2015.
U.S. Appl. No. 14/044,800, filed Oct. 2, 2013, Notice of Allowance, dated Sep. 2, 2014.
U.S. Appl. No. 14/508,696, filed Oct. 7, 2014, Notice of Allowance, dated Jul. 27, 2015.
U.S. Appl. No. 14/148,568, filed Jan. 6, 2014, Final Office Action, dated Oct. 22, 2014.
U.S. Appl. No. 14/552,336, filed Nov. 24, 2014, First Office Action Interview, dated Jul. 20, 2015.
U.S. Appl. No. 14/483,527, filed Sep. 11, 2004, Office Action, dated Oct. 28, 2015.
U.S. Appl. No. 14/479,863, filed Jun. 8, 2014, First Office Action Interview, dated Dec. 26, 2014.
U.S. Appl. No. 14/326,738, filed Jul. 9, 2014, Final Office Action, dated Jul. 31, 2016.
U.S. Appl. No. 14/813,749, filed Jul. 30, 2015, Office Action, dated Sep. 28, 2015.
U.S. Appl. No. 14/306,154, filed Jun. 16, 2014, Advisory, dated May 15, 2015.
U.S. Appl. No. 14/306,138, filed Jun. 16, 2014, Interview Summary, dated Dec. 24, 2015.
U.S. Appl. No. 14/306,147, filed Jun. 16, 2014, Final Office Action, dated Dec. 24, 2015.
U.S. Appl. No. 14/223,918, filed Mar. 24, 2014, Notice of Allowance, dated Jan. 6, 2016.
U.S. Appl. No. 14/948,009, filed Nov. 20, 2015, Notice of Allowance, dated May 6, 2016.
U.S. Appl. No. 14/645,304, filed Mar. 11, 2015, Office Action, dated Jan. 25, 2016.
U.S. Appl. No. 14/948,009, filed Nov. 20, 2015, First Action Interview, dated Feb. 25, 2016.
U.S. Appl. No. 14/746,671, filed Jun. 22, 2015, First Office Action Interview, dated Nov. 12, 2015.
U.S. Appl. No. 14/849,545, filed Sep. 9, 2015, Office Action, dated Jan. 29, 2016.
U.S. Appl. No. 14/800,447, filed Jul. 15, 2012, First Office Action Interview, dated Dec. 10, 2010.
U.S. Appl. No. 14/746,671, filed Jun. 22, 2015, Notice of Allowance, dated Jan. 21, 2016.
U.S. Appl. No. 14/306,138, filed Jun. 16, 2014, Interview Summary, dated Dec. 3, 2015.
U.S. Appl. No. 14/225,006, filed Mar. 25, 2014, Advisory Action, dated Dec. 21, 2015.
U.S. Appl. No. 14/877,229, filed Oct. 7, 2015, Office Action, dated Mar. 22, 2016.
U.S. Appl. No. 14/306,138, filed Jun. 16, 2014, First Office Action Interview, dated Sep. 23, 2015.
U.S. Appl. No. 14/225,006, filed Mar. 25, 2014, Final Office Action, dated Sep. 2, 2015.
U.S. Appl. No. 14/463,615, filed Aug. 19, 2014, Final Office Action, dated May 21, 2015.
U.S. Appl. No. 14/225,006, filed Mar. 25, 2014, First Office Action Interview, dated Feb. 27, 2015.
U.S. Appl. No. 14/323,935, filed Jul. 3, 2014, Office Action, dated Jun. 22, 2015.
U.S. Appl. No. 14/319,765, filed Jun. 30, 2014, First Office Action Interview, dated Feb. 4, 2015.
U.S. Appl. No. 14/323,935, filed Jul. 3, 2014, First Office Action Interview, dated Mar. 31, 2015.
U.S. Appl. No. 14/323,935, filed Jul. 3, 2014, First Office Action Interview, dated Nov. 28, 2014.
U.S. Appl. No. 14/306,154, filed Jun. 16, 2014, Final Office Action, dated Mar. 11, 2015.
U.S. Appl. No. 14/225,160, filed Mar. 25, 2014, Office Action, dated Aug. 12, 2015.
U.S. Appl. No. 14/326,738, filed Jul. 9, 2014, First Office Action Interview, dated Mar. 31, 2015.
U.S. Appl. No. 14/225,084, filed Mar. 25, 2014, First Office Action Interview, dated Sep. 2, 2014.
U.S. Appl. No. 14/306,147, filed Jun. 16, 2014, First Office Action Interview, dated Sep. 9, 2014.
U.S. Appl. No. 14/319,765, filed Jun. 30, 2014, Final Office Action, dated Jun. 16, 2015.
U.S. Appl. No. 14/319,161, filed Jun. 30, 2014, Notice of Allowance, dated May 4, 2015.
U.S. Appl. No. 14/306,154, filed Jun. 16, 2014, First Office Action Interview, dated Sep. 9, 2014.
U.S. Appl. No. 14/504,103, filed Oct. 1, 2014, First Office Action Interview, dated Feb. 5, 2015.
U.S. Appl. No. 14/504,103, filed Oct. 1, 2014, Notice of Allowance, dated May 18, 2015.
U.S. Appl. No. 14/225,084, filed Mar. 25, 2014, Notice of Allowance, dated May 4, 2015.
U.S. Appl. No. 14/319,161, filed Jun. 30, 2014, Final Office Action, dated Jan. 23, 2015.
U.S. Appl. No. 14/533,433, filed Nov. 5, 2014, Office Action, dated Feb. 26, 2015.
U.S. Appl. No. 14/571,098, filed Dec. 15, 2014, First Office Action Interview, dated Aug. 5, 2015.
U.S. Appl. No. 14/571,098, filed Dec. 15, 2014, First Office Action Interview, dated Nov. 10, 2015.
U.S. Appl. No. 13/827,491, filed Mar. 14, 2013, Office Action, dated Oct. 9, 2015.
U.S. Appl. No. 14/571,098, filed Dec. 15, 2014, First Office Action Interview, dated Aug. 24, 2015.
U.S. Appl. No. 14/827,491, filed Mar. 14, 2013, Final Office Action, dated Jun. 22, 2015.
U.S. Appl. No. 14/552,336, filed Nov. 24, 2014, Notice of Allowance, dated Nov. 3, 2015.
U.S. Appl. No. 14/571,098, filed Dec. 15, 2014, First Office Action Interview, dated Mar. 11, 2015.
U.S. Appl. No. 14/874,690, filed Oct. 5, 2015, First Action Interview, dated Dec. 21, 2015.
U.S. Appl. No. 14/306,138, filed Jun. 16, 2014, Office Action, dated Mar. 17, 2016.
U.S. Appl. No. 14/094,418, filed Dec. 2, 2013, Notice of Allowance, dated Jan. 25, 2016.
U.S. Appl. No. 13/247,987, filed Sep. 28, 2011, Notice of Allowance, dated Mar. 17, 2016.
U.S. Appl. No. 14/306,154, filed Jun. 16, 2014, Office Action, dated Mar. 17, 2016.
U.S. Appl. No. 14/849,545, filed Sep. 9, 2015, Interview Summary, dated Feb. 24, 2016.
U.S. Appl. No. 14/504,103, filed Oct. 1, 2014, First Office Action Interview, dated Mar. 31, 2015.
U.S. Appl. No. 14/451,221, filed Aug. 4, 2014, Office Action, dated Oct. 21, 2014.
U.S. Appl. No. 14/879,916, filed Oct. 9, 2015, Notice of Allowance, dated Jun. 22, 2016.
U.S. Appl. No. 14/326,738, filed Jul. 9, 2014, Notice of Allowance, dated Nov. 18, 2015.
U.S. Appl. No. 14/319,765, filed Jun. 30, 2014, Advisory Action, dated Sep. 10, 2015.
U.S. Appl. No. 14/463,615, filed Aug. 19, 2014, First Office Action Interview, dated Nov. 13, 2014.
U.S. Appl. No. 14/319,765, filed Jun. 30, 2014, Notice of Allowance, dated Nov. 25, 2014.
U.S. Appl. No. 13/827,491, filed Mar. 14, 2013, Office Action, dated Dec. 1, 2014.
U.S. Appl. No. 14/225,160, filed Mar. 25, 2014, First Office Action Interview, dated Oct. 22, 2014.
U.S. Appl. No. 14/306,147, filed Jun. 16, 2014, Final Office Action, dated Feb. 19, 2015.
U.S. Appl. No. 14/225,084, filed Mar. 25, 2014, Office Action, dated Sep. 11, 2015.
U.S. Appl. No. 14/483,527, filed Sep. 11, 2004, First Office Action Interview, dated Jan. 28, 2015.
U.S. Appl. No. 14/225,084, filed Mar. 25, 2014, Interview Summary, dated Jan. 4, 2016.
U.S. Appl. No. 14/306,147, filed Jun. 16, 2014, Office Action, dated Aug. 7, 2015.
U.S. Appl. No. 14/483,527, filed Sep. 11, 2004, Final Office Action, dated Jun. 22, 2015.
U.S. Appl. No. 13/557,100, filed Jul. 24, 2012, Final Office Action, dated Apr. 7, 2016.
U.S. Appl. No. 14/225,160, filed Mar. 25, 2014, Final Office Action, dated Feb. 11, 2016.
U.S. Appl. No. 14/631,633, filed Feb. 25, 2015, First Office Action Interview, dated Feb. 3, 2016.
U.S. Appl. No. 14/631,633, filed Feb. 25, 2015, First Office Action Interview, dated Sep. 10, 2015.
U.S. Appl. No. 14/306,154, filed Jun. 16, 2014, Final Office Action, dated Nov. 16, 2015.
U.S. Appl. No. 14/479,863, filed Sep. 8, 2014, Notice of Allowance, dated Mar. 31, 2015.
U.S. Appl. No. 14/463,615, filed Aug. 19, 2014, First Office Action Interview, dated Jan. 28, 2015.
U.S. Appl. No. 14/562,524, filed Dec. 5, 2014, First Office Action, dated Sep. 14, 2015.
U.S. Appl. No. 14/306,138, filed Jun. 16, 2014, Office Action, dated May 26, 2015.
U.S. Appl. No. 14/676,621, filed Apr. 1, 2015, Final Office Action, dated Oct. 29, 2015.
U.S. Appl. No. 14/842,734, filed Sep. 1, 2015, First Office Action Interview, dated Nov. 19, 2015.
U.S. Appl. No. 14/306,138, filed Jun. 16, 2014, Final Office Action, dated Sep. 14, 2015.
U.S. Appl. No. 14/141,252, filed Dec. 26, 2014, Office Action, dated Oct. 8, 2015.
U.S. Appl. No. 14/562,524, filed Dec. 5, 2014, First Office Action Interview, dated Nov. 10, 2015.
U.S. Appl. No. 14/526,066, filed Mar. 25, 2014, Final Office Action, dated May 6, 2016.
U.S. Appl. No. 14/879,916, filed Oct. 9, 2015, First Office Action Interview, dated Apr. 15, 2016.
U.S. Appl. No. 14/326,738, filed Jul. 9, 2014, First Office Action Interview, dated Dec. 2, 2014.
U.S. Appl. No. 14/323,935, filed Jul. 3, 2014, Notice of Allowance, dated Oct. 1, 2015.
U.S. Appl. No. 14/225,160, filed Mar. 25, 2014, First Office Action Interview, dated Jul. 29, 2014.
U.S. Appl. No. 14/225,084, filed Mar. 25, 2014, First Office Action Interview, dated Feb. 20, 2015.
U.S. Appl. No. 14/306,154, filed Jun. 16, 2014, Office Action, dated Jul. 6, 2015.
U.S. Appl. No. 14/874,690, filed Oct. 5, 2015, Office Action, dated Jun. 1, 2016.
U.S. Appl. No. 14/319,765, filed Jun. 30, 2014, Office Action, dated Feb. 1, 2016.
U.S. Appl. No. 14/954,680, filed Nov. 30, 2015, Office Action, dated May 12, 2016.
U.S. Appl. No. 14/225,160, filed Mar. 25, 2014, Advisory Action, dated May 20, 2015.
U.S. Appl. No. 14/463,615, filed Aug. 19, 2014, Advisory Action, dated Sep. 10, 2015.
U.S. Appl. No. 14/676,621, filed Apr. 1, 2015, First Office Action Interview, dated Jul. 30, 2015.
U.S. Appl. No. 14/816,264, filed Aug. 3, 2015, Pre Office Action Interview, dated Oct. 19, 2017.
U.S. Appl. No. 15/287,715, filed Oct. 6, 2016, Office Action, dated Aug. 17, 2017.
U.S. Appl. No. 15/287,715, filed Oct. 6, 2016, Notice of Allowance, dated Dec. 13, 2017.
U.S. Appl. No. 15/262,207, filed Sep. 12, 2016, Final Office Action, dated Jun. 8, 2017.
U.S. Appl. No. 10/007,674, filed Jun. 26, 2018, Fink et al.
Official Communication for New Zealand Patent Application No. 622414 dated Mar. 24, 2014.
Official Communication for European Patent Application No. 14159629.6 dated Jul. 31, 2014.
“A Tour of Pinboard,” <http://pinboard.in/tour> as printed May 15, 2014 in 6 pages.
Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608.
Official Communication Communication for New Zealand Patent Application No. 622484 dated Apr. 2, 2014.
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Sep. 29, 2014.
Klemmer et al., “Where Do Web Sites Come From? Capturing and Interacting with Design History,” Association for Computing Machinery, CHI 2002, Apr. 20-25, 2002, Minneapolis, MN, pp. 8.
Official Communication for Australian Patent Application No. 2014201507 dated Feb. 27, 2015.
Official Communication for Great Britain Patent Application No. 1411984.6 dated Jan. 8, 2016.
Official Communication for European Patent Application No. 14197879.1 dated Apr. 28, 2015.
Official Communication for Netherlands Patent Application No. 2013306 dated Apr. 24, 2015.
Palantir, “Kite Data-Integration Process Overview,” Palantir Technologies, Inc., Copyright 2010, pp. 48.
Official Communication for European Patent Application No. 14158958.0 dated Apr. 16, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.
Johnson, Steve, “Access 2013 on demand,” Access 2013 on Demand, May 9, 2013, Que Publishing.
Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8.
Official Communication for Australian Patent Application No. 2014203669 dated May 29, 2015.
Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014.
Official Communication for Australian Patent Application No. 2014201506 dated Feb. 27, 2015.
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.
Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.
Palantir, “The Repository Element,” https://docs.palantir.com/gotham/3.11.1.0/dataguide/kite_config_file.04 printed Aug. 30, 2013 in 2 pages.
Palantir, “Extracting and Transforming Data with Kite,” Palantir Technologies, Inc., Copyright 2010, pp. 38.
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.
Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.
Official Communication for Netherlands Patent Application No. 2012438 dated Sep. 21, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014.
Official Communication for European Patent Application No. 14199180.2 dated Jun. 22, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015.
Official Communication for European Patent Application No. 14189344.6 dated Feb. 20, 2015.
Palantir, “Kite Operations,” Palantir Technologies, Inc., Copyright 2010, p. 1.
Palermo, Christopher J., “Memorandum,” [Disclosure relating to U.S. Appl. No. 13/916,447, filed Jun. 12, 2013, and related applications], Jan. 31, 2014 in 3 pages.
Official Communication for European Patent Application No. 14199180.2 dated Aug. 31, 2015.
Official Communication for New Zealand Patent Application No. 622497 dated Jun. 19, 2014.
Official Communication for European Patent Application No. 15155845.9 dated Oct. 6, 2015.
Palantir, https://docs.palantir.com/gotham/3.11.1.0/dataguide/baggage/KiteSchema printed Aug. 30, 2013 in 1 page.
Official Communication for European Patent Application No. 15181419.1 dated Sep. 29, 2015.
“HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages.
Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64.
Delicious, <http://delicious.com/> as printed May 15, 2014 in 1 page.
“Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015.
Official Communication for Great Britain Patent Application No. 1413935.6 dated Dec. 21, 2015.
Official Communication for European Patent Application No. 14158977.0 dated Apr. 16, 2015.
Official Communication for Great Britain Patent Application No. 1404479.6 dated Aug. 12, 2014.
StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, <http://statcounter.com/> Printed Jul. 19, 2013 in 17 pages.
Official Communication for European Patent Application No. 14158958.0 dated Jun. 3, 2014.
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.
Geiger, Jonathan G., “Data Quality Management, The Most Critical Initiative You Can Implement”, Data Warehousing, Management and Quality, Paper 098-29, SUGI 29, Intelligent Solutions, Inc., Bounder, CO, pp. 14, accessed Oct. 3, 2013.
Official Communication for New Zealand Patent Application No. 622404 dated Mar. 20, 2014.
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].
Piwik—Free Web Analytics Software. <http://piwik.org/> Printed Jul. 19, 2013 in18 pages.
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014.
Official Communication for European Patent Application No. 15166137.8 dated Sep. 14, 2015.
Notice of Acceptance for Australian Patent Application No. 2014203669 dated Jan. 21, 2016.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014.
trak.io, <http://trak.io/> printed Jul. 18, 2013 in 3 pages.
Johnson, Maggie, “Introduction to YACC and Bison”.
Official Communication for Netherlands Patent Application No. 2012434 dated Jan. 8, 2016.
Kokossi et al., “D7-Dynamic Ontoloty Management System (Design),” Information Societies Technology Programme, Jan. 10, 2002, pp. 1-27.
Wright et al., “Palantir Technologies VAST 2010 Challenge Text Records—Investigations into Arms Dealing,” Oct. 29, 2010, pp. 1-10, retrieved from the internet http://hcil2.cs.umd.edu/newvarepository/VAST%20Challenge%202010/challenges/MC1%20-%20Investigations%20into%20Arms%20Dealing/entries/Palantir%20Technologies/ retrieved on Aug. 20, 2015.
Official Communication for European Patent Application No. 15165244.3 dated Aug. 27, 2015.
Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.
UserMetrix, <http://usermetrix.com/android-analytics> printed Jul. 18, 2013 in 3 pages.
Mixpanel—Mobile Analytics, <https://mixpanel.com/> Printed Jul. 18, 2013 in 13 pages.
Official Communication for European Patent Application No. 14158977.0 dated Mar. 11, 2016.
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages.
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015.
Wikipedia, “Federated Database System,” Sep. 7, 2013, retrieved from the internet on Jan. 27, 2015 http://en.wikipedia.org/w/index.php?title=Federated_database_system&oldid=571954221.
Official Communication for European Patent Application No. 15192965.0 dated Mar. 17, 2016.
Open Web Analytics (OWA), <http://www.openwebanalytics.com/> Printed Jul. 19, 2013 in 5 pages.
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014.
Palantir, “Kite,” https://docs.palantir.com/gotham/3.11.1.0/adminreference/datasources.11 printed Aug. 30, 2013 in 2 pages.
Niepert et al., “A Dynamic Ontology for a Dynamic Reference Work”, Joint Conference on Digital Libraries, Jun. 17_22, 2007, Vancouver, British Columbia, Canada, pp. 1-10.
Official Communication for Netherlands Patent Application No. 2013134 dated Apr. 20, 2015.
Apsalar, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots <http://apsalar.com> Printed Jul. 18, 2013 in 8 pages.
Official Communication for Great Britain Patent Application No. 1413935.6 dated Jan. 27, 2015.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Oct. 6, 2014.
Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages.
Official Communication for New Zealand Patent Application No. 627061 dated Jul. 14, 2014.
Official Communication for European Patent Application No. 14200246.8 dated May 29, 2015.
Flurry Analytics, <http://www.flurry.com/> Printed Jul. 18, 2013 in 14 pages.
Jelen, Bill, “Excel 2013 in Depth, Video Enhanced Edition,” Jan. 25, 2013.
Palantir, https://docs.palantir.com/gotham/3.11.1.0/dataguide/baggage/KiteSchema.xsd printed Apr. 4, 2014 in 4 pages.
Hardesty, “Privacy Challenges: Analysis: It's Surprisingly Easy to Identify Individuals from Credit-Card Metadata,” MIT News on Campus and Around the World, MIT News Office, Jan. 29, 2015, 3 pages.
Palantir Technolgies, “Palantir Labs—Timeline,” Oct. 1, 2010, retrieved from the internet https://www.youtube.com/watch?v=JCgDW5bru9M retrieved on Aug. 19, 2015.
About 80 Minutes, “Palantir in a Number of Parts—Part 6—Graph,” Mar. 21, 2013, pp. 1-6, retrieved from the Internet http://about80minutes.blogspot.nl/2013/03/palantir-in-number-of-parts-part-6-graph.html retrieved on Aug. 18, 2015.
Official Communication for European Patent Application No. 15184764.7 dated Dec. 14, 2015.
Official Communication for European Patent Application No. 14197895.7 dated Apr. 28, 2015.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015.
Official Communication for European Patent Application No. 14197938.5 dated Apr. 28, 2015.
Symantec Corporation, “E-Security Begins with Sound Security Policies,” Announcement Symantec, Jun. 14, 2001.
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014.
Official Communication for Netherlands Patent Application No. 2012417 dated Sep. 18, 2015.
Palantir, “Write a Kite Configuration File in Eclipse,” Palantir Technologies, Inc., Copyright 2010, pp. 2.
Countly Mobile Analytics, <http://count.ly/> Printed Jul. 18, 2013 in 9 pages.
Nivas, Tuli, “Test Harness and Script Design Principles for Automated Testing of non-GUI or Web Based Applications,” Performance Lab, Jun. 2011, pp. 30-37.
Localytics—Mobile App Marketing & Analytics, <http://www.localytics.com/> Printed Jul. 18, 2013 in 12 pages.
Cohn, et al., “Semi-supervised clustering with user feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1 (2003): 17-32.
Pythagoras Communications Ltd., “Microsoft CRM Duplicate Detection,” Sep. 13, 2011, https://www.youtube.com/watch?v=j-7Qis0D0Kc.
Official Communication for New Zealand Patent Application No. 622497 dated Mar. 26, 2014.
Official Communication for Israel Patent Application No. 198253 dated Nov. 24, 2014.
Official Communication for European Patent Application No. 14159464.8 dated Feb. 18, 2016.
Official Communication for European Patent Application No. 14158977.0 dated Jun. 10, 2014.
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services”, HiPC 2006, LNCS 4297, pp. 277-288, 2006.
Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015.
Morrison et al., “Converting Users to Testers: An Alternative Approach to Load Test Script Creation, Parameterization and Data Corellation,” CCSC: Southeastern Conference, JCSC 28, 2, Dec. 2012, pp. 188-196.
Google Analytics Official Website—Web Analytics & Reporting, <http://www.google.com/analytics.index.html> Printed Jul. 18, 2013 in 22 pages.
Official Communication for Great Britain Patent Application No. 1404479.6 dated Jul. 9, 2015.
Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20.
Anonymous, “BackTult _ JD Edwards One World Version Control System,” printed Jul. 23, 2007 in 1 page.
Wollrath et al., “A Distributed Object Model for the Java System,” Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996, pp. 219-231.
Chung, Chin-Wan, “Dataplex: An Access to Heterogeneous Distributed Databases,” Communications of the ACM, Association for Computing Machinery, Inc., vol. 33, No. 1, Jan. 1, 1990, pp. 70-80.
Miklau et al., “Securing History: Privacy and Accountability in Database Systems,” 3rd Biennial Conference on Innovative Data Systems Research (CIDR), Jan. 7-10, 2007, Asilomar, California, pp. 387-396.
Official Communication for European Patent Application No. 14158958.0 dated Mar. 11, 2016.
TestFlight—Beta Testing on the Fly, <http://testflightapp.com/> Printed Jul. 18, 2013 in 3 pages.
Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748.
Appacts, “Smart Thinking for Super Apps,” <http://www.appacts.com> Printed Jul. 18, 2013 in 4 pages.
Official Communication for Canadian Patent Application No. 2666364 dated Jun. 4, 2012.
Distimo—App Analytics, <http://www.distimo.com/app-analytics> Printed Jul. 18, 2013 in 5 pages.
Official Communication for Australian Patent Application No. 2014201511 dated Feb. 27, 2015.
Official Communication for Netherlands Patent Application No. 2012421 dated Sep. 18, 2015.
Gesher, Ari, “Palantir Screenshots in the Wild: Swing Sightings,” The Palantir Blog, Sep. 11, 2007, pp. 1-12, retrieved from the internet https://www.palantir.com/2007/09/palantir-screenshots/ retrieved on Aug. 18, 2015.
Official Communication for Israel Patent Application No. 198253 dated Jan. 12, 2016.
Official Communication for New Zealand Patent Application No. 622389 dated Mar. 20, 2014.
Capptain—Pilot Your Apps, <http://www.capptain.com> Printed Jul. 18, 2013 in 6 pages.
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.
Kontagent Mobile Analytics, <http://www.kontagent.com/> Printed Jul. 18, 2013 in 9 pages.
Claims for European Patent Application No. 15192965.0 dated Mar. 2016, 3 pages.
Zaharia et al., “Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing” dated 2012, 14 pages.
Osterweil et al., “Capturing, Visualizing and Querying Scientific Data Provenance”, http://www.mtholyoke.edu/-blerner/dataprovenance/ddg.html, dated May 20, 2015, 3 pages.
Dean et al., “MapReduce: Simplified Data Processing on Large Clusters”, OSDI 2004, 13 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages.
Glaab et al., “EnrichNet: Network-Based Gene Set Enrichment Analysis,” Bioinformatics 28.18 (2012): pp. i451-i457.
Quest, “Toad for ORACLE 11.6—Guide to Using Toad”, pp. 1-162, Sep. 24, 2012.
Hur et al., “SciMiner: web-based literature mining tool for target identification and functional enrichment analysis,” Bioinformatics 25.6 (2009): pp. 838-840.
Zheng et al., “GOEAST: a web-based software toolkit for Gene Ontology enrichment analysis,” Nucleic acids research 36.suppl 2 (2008): pp. W385-W363.
European Claims in application No. 16182336.4-1952, dated Dec. 2016, 3 pages.
European Claims in application No. 16194936.7-1871 dated Mar. 3, 2017, 3 pages.
European Patent Office, “Search Report” in application No. 16182336.4-1952 dated Dec. 23, 2016, 10 pages.
European Patent Office , “Search Report” in application No. 16194936.7 dated Mar. 9, 2017, 8 pages.
European Patent Office, “Search Report” in application No. 16 182 336.4-1222, dated Jan. 11, 2018, 12 pages.
European Claims in application No. 16 182 336.4-1222, dated Jan. 2018, 4 pages.

Related Publications (1)

	Number	Date	Country
	20180341651 A1	Nov 2018	US

Provisional Applications (1)

	Number	Date	Country
	62349548	Jun 2016	US

Continuations (1)

	Number	Date	Country
Parent	15262207	Sep 2016	US
Child	16018777		US

Data revision control in large-scale data analytic systems

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Disclaimer

Term Extension

Abstract