Concatenate

This node concatenates two tables. The table at inport 0 is given as the first input table (top input port), the table at inport 1 is the second table, resp. Columns with equal names are concatenated (if the column types differ the column type is the common base type of both input column types). If one input table contains column names that the other table does not, the columns can either be filled with missing values or filtered out, i.e. they will not be in the output table. The dialog allows setting the following parameters:

Options

How to combine input columns
  • Intersection: Use only the columns that appear in all input tables. Any other column is ignored and won't appear in the output table. Columns are matched by name.
  • Union: Use all columns from all input tables. Fill rows with missing values if they miss cells for some columns.
If there are duplicate RowIDs
  • Skip: Duplicate row identifiers (RowID) occurring in the second table and following tables are not appended to the output table. This option is relatively memory intensive as it needs to cache the RowIDs in order to find duplicates. Furthermore a full data duplication is needed.
  • Append suffix: The output table will contain all rows, but duplicate RowIDs are labeled with a suffix. Similar to the "Skip" option this method is also memory intensive.
  • Fail: The node will fail during execution if duplicate RowIDs are encountered. This option is efficient while checking uniqueness.
Enable hiliting
Advanced setting that enables hiliting between both inputs and the concatenated output table.

Input Ports

Icon
Table contributing the rows of the first part of the output table.
Icon
Table contributing the rows of the second part of the output table.
Icon
Table contributing subsequent rows.

Output Ports

Icon
Table with rows from all tables.

Popular Predecessors

Views

This node has no views

Workflows

Links

Developers

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.