Note
This documentation is for a prior release of Kinetica. For the latest documentation, click here.
Multi-Head Ingest (Distributed Ingest) is a mechanism that allows sharded data to be ingested directly into cluster nodes, bypassing the overhead of pushing the data through the head node to the cluster nodes.
Operationally, the ingest mechanism calculates the target shard of each record to insert, and sends batches of would-be co-located records to their respective target nodes.
To fully utilize multi-head ingest, the ingestion process should use a multi-node parallel processing framework, such as MapReduce, Storm, or Spark. As data is divided up and flows through the processing nodes, a Kinetica bulk ingest object can be instantiated in each node to push data to the proper Kinetica cluster node. This greatly increases the speed of ingestion by both parallelizing the ingestion process and spreading the network traffic across multiple nodes.
API Support
Language | Multi-head Ingest Mechanism |
---|---|
C++ | GPUdbIngestor |
C# | KineticaIngestor |
Java | BulkInserter |
Javascript | X |
Node.js | X |
Python | GPUdbIngestor |
REST | X |
SQL | <automatic> |
Configuration
Server-Side
Kinetica in AWS automatically configures the database for multi-head ingest.
Client-Side
With the exception of the Python background multi-head process, the multi-head ingest object of each API requires a list of worker nodes to use to distribute the insert requests, with one entry in the list for each node/process. This list can be auto-populated simply by using a GPUdb connection object, which can retrieve the list of available cluster nodes from the database itself. Below is a code snippet showing an automatically populated worker list and subsequent creation of a multi-head ingest object with it:
|
|
|
|
Considerations
There are several factors to consider when using multi-head ingest:
- Replicated tables are not supported
- There is a small performance penalty for calculating the shard key of each record to be inserted into a sharded table.
- There is an additional per-record performance penalty for primary key collision checks for any target table that has a primary key that is not the same as its shard key (the shard key columns are a proper subset of the primary key columns)
- Randomly-sharded tables benefit more from multi-head ingest than sharded tables do, as there is no target shard key to calculate for each record and, therefore, no associated performance penalty for that calculation.
- The batch size used to configure the bulk ingest object determines the record threshold for each of the insert queues targeting the worker nodes, not the record threshold for the bulk ingest object itself. Thus, ingestion into tables with non-uniform record distribution may require periodic flushes of the bulk ingest queues to ensure timely insertion of records in queues that infrequently reach their threshold.
Example
All the functionality for multi-head ingestion is encapsulated in the bulk ingest object. See API Support for chart listing the API-specific object to use for bulk ingestion.
The following is a Java API code block that demonstrates the use of the BulkInserter for ingesting data.
|
|
Note
If the BulkInserter is not declared as the resource in a try-with-resources block, the close() method needs to be called explicitly after use to release its resources.
However, for a one-time use, as in this example, the flush() call can be removed, as the close() method will automatically call flush().
Python Background Multihead
In the Python API, the GPUdbTable constructor has a use_multihead_io parameter, which allows a GPUdbTable object to handle all GPUdbIngestor interactions with the associated table in the background:
|
|
Cautions
If using the Java API and MapReduce, there is a conflict between the version of Avro used by Kinetica and the one used by MapReduce. This conflict can be overcome by using the Maven shade plug-in with the relocation tag:
|
|