The disclosed implementations relate generally to data visualization and more specifically to systems, methods, and user interfaces to prepare and curate data for use by a data visualization application.
Data visualization applications enable a user to understand a data set visually, including distribution, trends, outliers, and other factors that are important to making business decisions. Some data sets are very large or complex, and include many data fields. Various tools can be used to help understand and analyze the data, including dashboards that have multiple data visualizations. However, data frequently needs to be manipulated or massaged to put it into a format that can be easily used by data visualization applications.
Disclosed implementations provide methods to conditionally group and replace data values in a data set, which can be used as part of a data preparation application.
In accordance with some implementations, a method prepares data for subsequent analysis. The method includes displaying a user interface that includes a plurality of panes, including a data flow pane and a data pane. The data flow pane includes a flow diagram having a plurality of nodes. Each node specifies a respective primary operation or specifies a plurality of secondary operations to clean a respective data set. The data pane includes a plurality of data values in a plurality of rows and a plurality of columns. The plurality of data values corresponds to a selected node in the data flow pane.
In accordance with some implementations, the method proceeds by receiving a first user input to select a first data value in a first column. The method continues with receiving a second user input to edit a second data value in a second column in accordance with one or more predefined conditions.
In response to receiving the second user input, the method highlights the second column. When the one or more predefined conditions have been met, the method changes the second data value to a replacement data value.
In some instances, the one or more predefined conditions are based on the first data value.
In some instances, the one or more predefined conditions are based on one or more data values.
In accordance with some implementations, in response to receiving a third user input and in accordance with a determination that the one or more predefined conditions have been met, the method changes a third data value in the second column to the replacement data value, where the third data value is equivalent to the second data value.
In accordance with some implementations, each node has a primary data set computed according to the primary operation. When the primary operation is selected in a change list pane, a sampling of data from the primary data set is displayed.
In some implementations, a computer system has one or more processors, memory, and a display. The one or more programs include instructions for performing any of the methods described herein.
In some implementations, a non-transitory computer readable storage medium stores one or more programs configured for execution by a computer system having one or more processors, memory, and a display. The one or more programs include instructions for performing any of the methods described herein.
Thus, methods, systems, and graphical user interfaces are disclosed that enable users to analyze, prepare, and curate data.
For a better understanding of the aforementioned systems, methods, and graphical user interfaces, as well as additional systems, methods, and graphical user interfaces that provide data visualization analytics and data preparation, 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.
Reference will now be made to implementations, examples of which are illustrated in the accompanying drawings. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one of ordinary skill in the art that the present invention may be practiced without requiring these specific details.
The graphical user interface 100 also includes a data visualization region 112. The data visualization region 112 includes a plurality of shelf regions, such as a columns shelf region 120 and a rows shelf region 122. These are also referred to as the column shelf 120 and the row shelf 122. As illustrated here, the data visualization region 112 also has a large space for displaying a visual graphic. Because no data elements have been selected yet, the space initially has no visual graphic. In some implementations, the data visualization region 112 has multiple layers that are referred to as sheets.
The computing device 200 includes a user interface 206 comprising a display device 208 and one or more input devices or mechanisms 210. In some implementations, the input device/mechanism includes a keyboard. In some implementations, the input device/mechanism includes a “soft” keyboard, which is displayed as needed on the display device 208, enabling a user to “press keys” that appear on the display 208. In some implementations, the display 208 and input device/mechanism 210 comprise a touch screen display (also called a touch sensitive display).
In some implementations, the memory 214 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices. In some implementations, the memory 214 includes non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. In some implementations, the memory 214 includes one or more storage devices remotely located from the CPU(s) 202. The memory 214, or alternatively the non-volatile memory devices within the memory 214, comprises a non-transitory computer readable storage medium. In some implementations, the memory 214, or the computer readable storage medium of the memory 214, stores the following programs, modules, and data structures, or a subset thereof:
In some instances, the computing device 200 stores a data prep application 230, which can be used to analyze and massage data for subsequent analysis (e.g., by a data visualization application 222).
Each of the above identified executable modules, applications, or sets of procedures may be stored in one or more of the previously mentioned memory devices, and corresponds to a set of instructions for performing a function described above. The above identified modules or programs (i.e., sets of instructions) need not be implemented as separate software programs, procedures, or modules, and thus various subsets of these modules may be combined or otherwise re-arranged in various implementations. In some implementations, the memory 214 stores a subset of the modules and data structures identified above. Furthermore, the memory 214 may store additional modules or data structures not described above.
Although
In some implementations, the left-hand pane 312 includes a data source palette/selector. The left-hand pane 312 also includes an operations palette, which displays operations that can be placed into the flow. In some implementations, the list of primary operations includes reshaping operations such as arbitrary joins (of arbitrary type and with various predicates), union, pivot, aggregate. In some implementations the primary operation comprises inputting or outputting. In some implementations, the list of secondary operations includes renaming and restricting columns, projecting, scalar calculations, filtering, data type conversion, data parse, coalesce, merge, split, value replacement, and sampling. Some implementations also support operators to create sets (e.g., partition the data values for a data field into sets), binning (e.g., grouping numeric data values for a data field into a set of ranges), and table calculations (e.g., calculating data values, such as percent of total, for each row, which depends not only on the data values in each row, but also on other data values in the table).
In some implementations, the left-hand pane 312 also includes a palette of other flows that can be incorporated in whole or in part into the current flow. This enables a user to reuse components of a flow to create new flows. For example, if a portion of a flow has been created that scrubs a certain type of input using a combination of 10 steps, that 10 step flow portion can be saved and reused, either in the same flow or in completely separate flows.
The flow pane 313 displays a visual representation (e.g., node/link flow diagram) 323 for the current flow. The Flow Pane 313 provides an overview of the flow, which serves to document the process. As the number of nodes increases, implementations typically add scroll bars. The need for scroll bars is reduced by coalescing multiple related nodes into super nodes, which are also called container nodes. This enables a user to see the entire flow more conceptually, and allows a user to dig into the details only when necessary. In some implementations, when a “super node” is expanded, the flow pane 313 shows just the nodes within the super node, and the flow pane 313 has a heading that identifies what portion of the flow is being displayed. Implementations typically enable multiple hierarchical levels.
The profile pane 314 provides a quick way for users to figure out if the results of the one or more transforms are what they expect them to be. The profile pane provides distribution data for the data values in the currently selected data set (corresponding to the selected node in the flow pane 313). The distributions are typically displayed as histograms of individual data values or value ranges, such as the bar 324 for the data value “ILLINOIS” in the column for the data field “STATE CODE”. Outliers and incorrect values typically “pop out” visually based on comparisons with both other values in the node or based on comparisons of values in other nodes. The profile pane helps users ferret out data problems, regardless of whether the problems are caused by incorrect transforms or dirty data. In addition to helping users find the bad data, the profile pane also allows direct interactions to fix the discovered problems. In some implementations, the profile pane 314 updates asynchronously. When a node is selected in the flow pane, the user interface starts populating partial values (e.g., data value distribution histograms) that get better as time goes on. In some implementations, the profile pane includes an indicator to alert the user whether it is complete or not. With very large data sets, some implementations build a profile based on sample data only.
Within the profile pane 314, a user can perform various tasks, including:
The data pane 315 provides a way for users to see and modify rows that result from the flows. The data is displayed as a grid with a plurality of rows and a plurality of columns, such as the columns 326. Typically, the data pane selects a sampling of rows corresponding to the selected node (e.g., a sample of 10, 50, or 100 rows rather than a million rows). In some implementations, the rows are sampled in order to display a variety of features. In some implementations, the rows are sampled statistically, such as every nth row.
The data pane 315 is typically where a user cleans up data (e.g., when the source data is not clean). Like the profile pane, the data pane updates asynchronously. When a node is first selected, rows in the data pane 315 start appearing, and the sampling gets better as time goes on. Most data sets will only have a subset of the data available here (unless the data set is small).
Within the data pane 315, a user can perform various tasks, including:
A node-specific pane displays information that is particular to a selected node in the flow. Because a node specific pane is not needed most of the time, the user interface typically does not designate a region within the user interface that is solely for this use. Instead, a node specific pane is displayed as needed, sometimes using a popup that floats over other regions of the user interface. For example, some implementations use a node specific pane to provide specific user interfaces for joins, unions, pivoting, unpivoting, running Python scripts, parsing log files, or transforming a JSON objects into tabular form.
The Data Source Palette/Chooser enables a user to bring in data from various data sources. In some implementations, the data source palette/chooser is in the left-hand pane 312. A user can perform various tasks with the data source palette/chooser, including:
In some implementations, the profile and data panes are reorganized depending on the selected node, and one or more new panes (e.g., panes 510 and 512) are displayed, enabling users to manage and coordinate operations. In some implementations, an additional panel 512 provides for display of two data sets 520 and 522 used in a join operation. For example, in
In some instances, no results (or a small number of results) are displayed initially because the join did not behave as expected. For example, this can be caused by mismatched values in the intermediate data sets 520 and 522. In some implementations, the system highlights these mismatched values to indicate to the user that some manual data cleaning or modifications are necessary in order to complete the primary operation in the new node.
In
In order to facilitate the join operation 524 between data sets 520 and 522, the user must coordinate the category values. In the example shown in
The manual mapping that the user performed in
Because the data for one row was fixed, profile pane 314 now displays the matched row 542 and the data pane 315 also shows a single matched row 543.
In some implementations, a new icon 538 is displayed in the flow pane upon showing the addition of a cleaning operation. In some implementations, the new icon 538 is displayed associated with the active or selected node 506. In some implementations, the new icon 538 is displayed above the active or selected node 506. In some implementations, there is no indication associated with the addition of a secondary cleaning operation displayed in the flow pane 313. In some implementations, the icon 538 is an affordance that, upon receiving a user input, displays the change list (e.g., a list of cleaning operations) performed at the associated node.
As shown in
In some implementations, the cleaning operations 540, 560, and 580 are ordered in the Changes list 508 in the left pane 508 in chronological order (the order in which they were created). In some instances, the order is not chronological if the user manually changes the order or when there is a data dependency that requires an alternative order.
With the conditional remapping operations described in reference to
Karl is a data scientist for a software company. He wants to understand which database connectors Tableau supports versus popular databases on the market. To do this, he needs to join Tableau connectors to DB-Engines data, but the database names are frequently very different. He also has to edit the applied join clauses to get a clean join. With conditional remapping, he can do this with 30 simple edits. Previously, he would use a combination of a spreadsheet application and a custom R program to collect and edit this data.
Mary is a user experience researcher for a company. Throughout alpha and beta product releases, many customers logged suggestions on the company site. These comments need to be categorized into groups so that Mary can monitor and trend them over time. Standard methods of group and replace are possible, but Mary wants each edit to be based upon the “suggestion ID” value. Previously, Mary mapped the values in a spreadsheet but also had to write vlookups or copy and paste when she got new data. This pain discouraged her from monitoring the customer suggestions more frequently, thus making it more difficult for her to do her job. With conditional remapping as taught here, Mary can do her job more efficiently.
Sales analysts at retail sales outlet sometimes find incorrect sales amounts or stages that needed to be manually overridden for analytical purposes. The analysts may need to override a specific sales order. They do not want to update all orders, nor do they want to update all domain values. Their current solution is to have analysts fill out an override form, send it to their data warehousing team, and ask the data warehouse team to reload sales data. This takes hours and delays their ability to quickly report on sales numbers. With conditional remapping, analysts can directly modify the desired values and mappings.
An earlier workflow for Conference Registrations involved joining a small spreadsheet to a large relational table. Being able to edit directly in the Data Prep application 230, users never need to perform a join and can simply add the data directly through a group and replace operation.
As an example of creating a single conditional group and replace, Arthur is mapping Project suggestions. He follows these steps. Arthur selects multiple domain values across several columns. He selects the ‘group and replace’ or ‘edit’ button. The Data Prep application 230 visually indicates which columns are conditions versus not conditions. The system allows Arthur to edit the last value selected. Arthur replaces the last selected value with the appropriate value and commits the action. The system records the change, adds an annotation, and updates the data to reflect the replacement.
In these cases, Suggestion ID=“SUG-01” and Category=NULL are the conditions and “SAP HANA” 406 is the replacement value.
When a conditional group and replace is used, as shown in
When a conditional replacement is no longer valid or is incorrect, Arthur can edit the operation and preserve his edits. When editing, Arthur can see the conditional values and correct them if necessary. For example, there may be a typo, either in the source data or from a previous cleaning operation performed by the user. In some instances, it is desirable to change the replacement value. For example, Arthur initially wrote “SPA HANA” and needs to change it to “SAP HANA.” In some instances, it is desirable to change the condition values. For example, “Springfield” is changed to “spring field” in the source system and Arthur needs to update the condition value to map properly. In some instances, it is desirable to add another column condition. For example, there are now multiple SUG-01 rows. One such row should refer to SAP HANA, and the other refers to Kinetica. Arthur wants to add a field called “Suggestion Line ID” as a condition and add a specific value related to that condition.
In some implementations, it is also possible to edit a conditional replacement in the following way. Arthur selects and edits an annotation. The system displays all columns and values involved in the conditional edit. The desired conditional edit includes both the original value and the replacement value. Arthur is able to change any of the values and apply the change. The system subsequently checks whether the new values are in or out of the sample. If they are out of the sample, the UI notates it (e.g., through highlighting the values that are out of the sample). Arthur can also remove an entire condition.
The method 600 displays (602) a user interface 300, which includes a plurality of panes, including a data flow pane 313 and a data pane 315. The data flow pane includes (602) a flow diagram having a plurality of nodes (e.g., the nodes 502, 504, and 506 in
In some implementations, each node in the plurality of nodes has (604) a primary data set computed according to the primary operation. In some implementations, when the primary operation in selected in a change list pane, the method displays a sampling of data from the primary data set.
The method receives (606) a first user input to select a first data value in a first column. In some instances, the first user input selects (608) a plurality of data values from the first column. The plurality of data values includes the first data value.
The method receives (610) a second user input to edit a second data value in a second column in accordance with one or more predefined conditions. In some implementations, the one or more predefined conditions are based (612) on the first data value. In some implementations, the one or more predefined conditions are based (614) on one or more data values.
In response to receiving the second user input, the method highlights (616) the second column. In accordance with a determination that the one or more predefined conditions have been met, the method changes the second data value to a replacement data value.
In some implementations, in response to receiving a third user input and in accordance with a determination that the one or more predefined conditions have been met, the method changes (618) a third data value in the second column to the replacement data value. The third data value is equivalent to the second data value.
The disclosed data prep systems 230 give control to users. In many cases, the data prep application 230 makes intelligent choices for the user, but the user is always able to assert control. Control often has two different facets: control over the logical ordering of operations, which is used to ensure the results are correct and match the user's desired semantics; and physical control, which is mostly used to ensure performance.
The disclosed data prep applications 230 also provide freedom. Users can assemble and reassemble their data production components however they wish in order to achieve the shape of data they need.
The disclosed data prep applications 230 provide incremental interaction and immediate feedback. When a user takes actions, the system provides feedback through immediate results on samples of the user's data, as well as through visual feedback.
The terminology used in the description of the invention herein is for the purpose of describing particular implementations only and is not intended to be limiting of the invention. As used in the description of the invention 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 “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, elements, components, and/or groups thereof.
The foregoing description, for purpose of explanation, has been described with reference to specific implementations. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The implementations were chosen and described in order to best explain the principles of the invention and its practical applications, to thereby enable others skilled in the art to best utilize the invention and various implementations with various modifications as are suited to the particular use contemplated.
This application claims priority to U.S. Provisional Application Ser. No. 62/748,995, filed Oct. 22, 2018, entitled “Data Preparation User Interface with Conditional Remapping of Data Values,” which is incorporated by reference herein in its entirety. This application is related to U.S. patent application Ser. No. 15/345,391, filed Nov. 7, 2016, U.S. patent application Ser. No. 15/701,381, filed Sep. 11, 2017, U.S. patent application Ser. No. 15/701,392, filed Sep. 11, 2017, U.S. patent application Ser. No. 15/705,174, filed Sep. 14, 2017, U.S. patent application Ser. No. 16/138,705, filed Sep. 21, 2018, U.S. patent application Ser. No. 16/153,615, filed Oct. 5, 2018, and U.S. patent application Ser. No. 16/155,818, filed Oct. 9, 2018, each of which is incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4357673 | Willis et al. | Nov 1982 | A |
4458323 | Willis et al. | Jul 1984 | A |
5421008 | Banning et al. | May 1995 | A |
5999192 | Selfridge et al. | Dec 1999 | A |
6278452 | Huberman et al. | Aug 2001 | B1 |
6470344 | Kothuri et al. | Oct 2002 | B1 |
6778873 | Wang et al. | Aug 2004 | B1 |
6993553 | Kaneko et al. | Jan 2006 | B2 |
7362718 | Kakivaya et al. | Apr 2008 | B2 |
7720779 | Perry et al. | May 2010 | B1 |
7793160 | McClure et al. | Sep 2010 | B1 |
8418181 | Sirota et al. | Apr 2013 | B1 |
8479136 | Hopkins et al. | Jul 2013 | B2 |
8626475 | Fontes et al. | Jan 2014 | B1 |
8806377 | Chen et al. | Aug 2014 | B2 |
8812752 | Shih et al. | Aug 2014 | B1 |
8819592 | Jackson, Jr. | Aug 2014 | B2 |
8843959 | McMaster et al. | Sep 2014 | B2 |
8863029 | Chen et al. | Oct 2014 | B2 |
9323503 | Fontes et al. | Apr 2016 | B1 |
9465523 | Kleser et al. | Oct 2016 | B2 |
10127511 | Epstein et al. | Nov 2018 | B1 |
10204173 | Vaught | Feb 2019 | B2 |
10242079 | Kim et al. | Mar 2019 | B2 |
10275545 | Yeager et al. | Apr 2019 | B2 |
10339681 | Moore | Jul 2019 | B2 |
10466978 | Vidan | Nov 2019 | B1 |
10528587 | Kim et al. | Jan 2020 | B2 |
10733165 | Broad et al. | Aug 2020 | B1 |
20020070953 | Barg et al. | Jun 2002 | A1 |
20030088546 | Brown | May 2003 | A1 |
20030001825 | Park et al. | Sep 2003 | A1 |
20030167265 | Corynen | Sep 2003 | A1 |
20030220928 | Durand et al. | Nov 2003 | A1 |
20040034616 | Witkowski et al. | Feb 2004 | A1 |
20040078105 | Moon et al. | Apr 2004 | A1 |
20050010877 | Udler | Jan 2005 | A1 |
20050022129 | Borenstein et al. | Jan 2005 | A1 |
20050044525 | Lazarov | Feb 2005 | A1 |
20060143534 | Dall | Jun 2006 | A1 |
20060168205 | Barron et al. | Jul 2006 | A1 |
20060173812 | Bahl et al. | Aug 2006 | A1 |
20060247912 | Suzuki | Nov 2006 | A1 |
20070016615 | Mohan et al. | Jan 2007 | A1 |
20070150581 | Banerjee et al. | Jun 2007 | A1 |
20070198312 | Bagchi et al. | Aug 2007 | A1 |
20070214136 | MacLennan et al. | Sep 2007 | A1 |
20070288899 | Fanning et al. | Dec 2007 | A1 |
20080059563 | Backmann et al. | Mar 2008 | A1 |
20080140688 | Clayton | Jun 2008 | A1 |
20080155440 | Trevor et al. | Jun 2008 | A1 |
20080183687 | Law | Jul 2008 | A1 |
20080195626 | Ukigawa et al. | Aug 2008 | A1 |
20080209392 | Able et al. | Aug 2008 | A1 |
20080254430 | Woolf et al. | Oct 2008 | A1 |
20080262988 | Williams et al. | Oct 2008 | A1 |
20080281801 | Larson et al. | Nov 2008 | A1 |
20090018996 | Hunt et al. | Jan 2009 | A1 |
20090021767 | Fujimaki | Jan 2009 | A1 |
20090064053 | Crawford et al. | Mar 2009 | A1 |
20090100086 | Dumant et al. | Apr 2009 | A1 |
20090276724 | Rosenthal et al. | Nov 2009 | A1 |
20090319688 | Mason et al. | Dec 2009 | A1 |
20100057618 | Spicer et al. | Mar 2010 | A1 |
20100156889 | Martinez et al. | Jun 2010 | A1 |
20110302551 | Hummel | Dec 2011 | A1 |
20110320384 | Chang | Dec 2011 | A1 |
20120022707 | Budhraja et al. | Jan 2012 | A1 |
20120023302 | Amdt et al. | Jan 2012 | A1 |
20120278015 | Budhraja et al. | Jan 2012 | A1 |
20120102396 | Arksey et al. | Apr 2012 | A1 |
20120151453 | Finking et al. | Jun 2012 | A1 |
20120209886 | Henderson | Aug 2012 | A1 |
20120226742 | Monchilov et al. | Sep 2012 | A1 |
20130042154 | Agarwa et al. | Feb 2013 | A1 |
20130080197 | Kung et al. | Mar 2013 | A1 |
20130166568 | Binkert et al. | Jun 2013 | A1 |
20130212234 | Bartlett et al. | Aug 2013 | A1 |
20130283106 | King et al. | Oct 2013 | A1 |
20140043325 | Ruble et al. | Feb 2014 | A1 |
20140249999 | Johnson et al. | Sep 2014 | A1 |
20140250153 | Nixon et al. | Sep 2014 | A1 |
20150081701 | Lerios et al. | Mar 2015 | A1 |
20150106456 | van Hoek | Apr 2015 | A1 |
20150149912 | Moore | May 2015 | A1 |
20150200867 | Dutta et al. | Jul 2015 | A1 |
20150027825 | Kienzle et al. | Oct 2015 | A1 |
20150317344 | Birdwell et al. | Nov 2015 | A1 |
20150324437 | Jiang et al. | Nov 2015 | A1 |
20150378863 | Balachandran | Dec 2015 | A1 |
20150378869 | Balachandran | Dec 2015 | A1 |
20160062737 | Stanfill et al. | Mar 2016 | A1 |
20160070430 | Kim et al. | Mar 2016 | A1 |
20160070451 | Kim et al. | Mar 2016 | A1 |
20160092476 | Stojanovic et al. | Mar 2016 | A1 |
20160260063 | Harris et al. | Sep 2016 | A1 |
20160306908 | Fontes et al. | Oct 2016 | A1 |
20160364434 | Spitz et al. | Dec 2016 | A1 |
20170005674 | Hussain et al. | Jan 2017 | A1 |
20170032026 | Parker et al. | Feb 2017 | A1 |
20170069118 | Stewart | Mar 2017 | A1 |
20170116396 | Gu et al. | Apr 2017 | A1 |
20170212944 | Hellman et al. | Jul 2017 | A1 |
20170277664 | Mihalcea et al. | Sep 2017 | A1 |
20170286264 | Surmarayana | Oct 2017 | A1 |
20170315516 | Kozionov et al. | Nov 2017 | A1 |
20180129374 | Kim et al. | May 2018 | A1 |
20180129719 | Kim et al. | May 2018 | A1 |
20180157579 | Rozenberg et al. | Jun 2018 | A1 |
20180165297 | Kuchoor et al. | Jun 2018 | A1 |
20180314764 | Orad et al. | Nov 2018 | A1 |
20180349251 | Mietke et al. | Dec 2018 | A1 |
20180367371 | Nagarajan et al. | Dec 2018 | A1 |
20190121807 | Boutros et al. | Apr 2019 | A1 |
20190138675 | Fontes et al. | May 2019 | A1 |
20190179927 | Rao et al. | Jun 2019 | A1 |
20190258575 | Dey et al. | Aug 2019 | A1 |
20190294421 | Pietzsch | Sep 2019 | A1 |
20200012656 | Pugh et al. | Jan 2020 | A1 |
Entry |
---|
Anonymous, “Cursor (databases) Wikipedia, the free encyclopedia,” Dec. 2, 2012, XP055222764, Retrieved from the internet: https://en.wikipedia.org/wiki/Cursor_(databases), 7 pgs. |
Anand, Preinterview First Office Action, U.S. Appl. No. 16/167,313, dated Jan. 24, 2020, 6 pgs. |
Anand, Notice of Allowance, U.S. Appl. No. 16/167,313, dated Mar. 2, 2020, 9 pgs. |
Anand, Notice of Allowance, U.S. Appl. No. 16/908,700, dated Mar. 11, 2021, 10 pgs. |
Bae, J., Understanding Indirect Casual Relationships in Node-Link Graphs, Eurographics Conference on Visualization (Euro Vis) Jun. 2017, vol. 36, No. 3, 12 pgs. |
Disclosed Anonymously, IP COM Method to enter data while filter applied, Dec. 6, 2011, (YearL 2011), 7 pgs. |
Cole, Office-Action, U.S. Appl. No. 15/726,294, dated Nov. 9, 2018, 40 pgs. |
Cole, Notice of Allowance, U.S. Appl. No. 15/726,294, dated May 15, 2019, 14 pgs. |
Ghani, S., Perception of Animated Node-Link Diagrams Graphs, Eurographics Conference on Visualization, (Euro Vis) Jun. 2012, vol. 31, No. 3, 11 pgs. |
Ishio et al., “A Lightweight Visualization of Interprocedural Data-Flow Paths for Source Code Reading,” [Online], 2012, pp. 37-46, retrieved from internet on May 7, 2019, <https://ieeexplore.org/stampjsp?tp=&arnumber=6240506> (Year: 2012). |
Kabbaj et al., “Towards an Active Help on Detecting Data Flow Errors in Business Process Models,” [Online}, 2015, pp. 16-25, [retrieved from internet on Jul. 11, 2020] <https://www.researchgate.net/profile/Mohammed_Isaam_Kabbaj/publication/263966796_Toward_an_active_help_on_detecting_data_flow_errors> (Year:2015), 11 pgs. |
Kim, Office Action, U.S. Appl. No. 15/345,391, dated Jun. 28, 2019, 10 pgs. |
Kim, Office Action, U.S. Appl. No. 15/345,391, dated Feb. 13, 2020, 16 pgs. |
Kim, Final Office Action, U.S. Appl. No. 15/345,391, dated Sep. 17, 2020, 16 pgs. |
Kim, Office Action, U.S. Appl. No. 15/345,391, dated Jun. 8, 2021, 14 pgs. |
Kim, Pre-Interview First Office Action—U.S. Appl. No. 15/701,392, dated Mar. 9, 2020, 5 pgs. |
Kim, Final Office Action—U.S. Appl. No. 15/701,392, dated Sep. 21, 2020, 18 pgs. |
Kim, Notice of Allowance, U.S. Appl. No. 15/701,392, dated Apr. 20, 2021, 9 pgs. |
Kim, Notice of Allowance, U.S. Appl. No. 15/705,174, dated Sep. 24, 2019, 10 pgs. |
Kim, Notice of Allowance, U.S. Appl. No. 16/153,615, dated Jul. 14, 2020, 10 pgs. |
Kim, Notice of Allowance, U.S. Appl. No. 16/285,084, dated Apr. 6, 2020, 9 pgs. |
Kim, Notice of Allowance, U.S. Appl. No. 16/537,444, dated Jul. 22, 2020, 14 pgs. |
Kim, Notice of Allowance, U.S. Appl. No. 16/138,705, dated Aug. 7, 2020, 9 pgs. |
Kim, Notice of Allowance, U.S. Appl. No. 15/701,381, dated Nov. 9, 2018, 6 pgs. |
Pugh, Notice of Allowance, U.S. Appl. No. 16/155,818, dated Oct. 1, 2020, 9 pgs. |
Pugh, Notice of Allowance, U.S. Appl. No. 17/142,138, dated Aug. 5, 2021, 9 pgs. |
Wildenradt, Notice of Allowance, U.S. Appl. No. 16/681,753, dated May 6, 2021, 10 pgs. |
Logothetis et al., “Scalable Lineage Capture for Debugging DISC Analytics,” [Online], 2013, pp. 1-15, retrieved from internet on May 7, 2019, <http://delivery.acm.org/10.1145/250000/252369/a17-logothetis.pdf> (Year:2013). |
Lovat et al., “On Quantitative Dynamic Data Flow Tracking,” [Online], 2014, pp. 211-222, [retrieved from internet on Jul. 11, 2020, <https://dl,acm/doi/pdf/10.11145/2557547.2557551> (Year: 2014), 12 pgs. |
Meda et al., “On Detecting Data Flow Errors in Workflows,” [Online] 2010, pp. 4:1-4:31, [retrieved from internet on Jul. 11, 2020], <https://dl.acm.org/doi/pdf/10.1145/1805286.1805290> (Year: 2020), 31 pgs. |
Moser et al., “Advanced Verification of Distributed WS-BPEL Business Processes Incorporating CSSA-based Data Flow Analysis,” [Online], 2007, pp. 1-8, [retrieved from internet on Jul. 11, 2020], <https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4278643> (Year: 2007), 8 pgs. |
Tableau Software, Inc., International Search Report and Written Opinion, PCT/US2017/060232, dated Jan. 18, 2018, 10 pgs. |
Tableau Software, Inc., International Search Report and Written Opinion, PCT/US2019/053935, dated Dec. 18, 2019, 13 pgs. |
Tableau Software, Inc., Communication Pursuant Rules 161(1) and 162, EP17801216.7, dated Jun. 17, 2019, 3 pgs. |
Tableau Software, Inc., Communication Pursuant to Article 94(3), EP17801216.7, dated Apr. 3, 2020, 6 pgs. |
Tibco, “TIBCO ActiveMatrix BusinessWorks™ Process Design Software Release 5.13,” Aug. 31, 2015, retrieved from the Internet: URL:https://docs.tibco.com/pub/activematrix_businessworks/5.13.0/doc/pdf/tib_bw_process_design_guide.pdf, 107 pgs. |
Yip et al., “Improving Application Security with Data Flow Assertions,” [Online], 2009, pp. 1-18, retrieved from internet on May 7, 2019, <http://www.sigops.org/conferences/sosp/2009/papers/yip-sosp09.pdf> (Year:2009). |
Number | Date | Country | |
---|---|---|---|
62748995 | Oct 2018 | US |