| "use strict";(self.webpackChunk=self.webpackChunk||[]).push([[8909],{3905:(e,t,n)=>{n.d(t,{Zo:()=>d,kt:()=>g});var a=n(7294);function i(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}function r(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);t&&(a=a.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),n.push.apply(n,a)}return n}function l(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{};t%2?r(Object(n),!0).forEach((function(t){i(e,t,n[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(n)):r(Object(n)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(n,t))}))}return e}function o(e,t){if(null==e)return{};var n,a,i=function(e,t){if(null==e)return{};var n,a,i={},r=Object.keys(e);for(a=0;a<r.length;a++)n=r[a],t.indexOf(n)>=0||(i[n]=e[n]);return i}(e,t);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);for(a=0;a<r.length;a++)n=r[a],t.indexOf(n)>=0||Object.prototype.propertyIsEnumerable.call(e,n)&&(i[n]=e[n])}return i}var s=a.createContext({}),p=function(e){var t=a.useContext(s),n=t;return e&&(n="function"==typeof e?e(t):l(l({},t),e)),n},d=function(e){var t=p(e.components);return a.createElement(s.Provider,{value:t},e.children)},m="mdxType",u={inlineCode:"code",wrapper:function(e){var t=e.children;return a.createElement(a.Fragment,{},t)}},k=a.forwardRef((function(e,t){var n=e.components,i=e.mdxType,r=e.originalType,s=e.parentName,d=o(e,["components","mdxType","originalType","parentName"]),m=p(n),k=i,g=m["".concat(s,".").concat(k)]||m[k]||u[k]||r;return n?a.createElement(g,l(l({ref:t},d),{},{components:n})):a.createElement(g,l({ref:t},d))}));function g(e,t){var n=arguments,i=t&&t.mdxType;if("string"==typeof e||i){var r=n.length,l=new Array(r);l[0]=k;var o={};for(var s in t)hasOwnProperty.call(t,s)&&(o[s]=t[s]);o.originalType=e,o[m]="string"==typeof e?e:i,l[1]=o;for(var p=2;p<r;p++)l[p]=n[p];return a.createElement.apply(null,l)}return a.createElement.apply(null,n)}k.displayName="MDXCreateElement"},4440:(e,t,n)=>{n.r(t),n.d(t,{assets:()=>d,contentTitle:()=>s,default:()=>g,frontMatter:()=>o,metadata:()=>p,toc:()=>m});var a=n(7462),i=n(3366),r=(n(7294),n(3905)),l=["components"],o={id:"native-batch",title:"Native batch ingestion",sidebar_label:"Native batch"},s=void 0,p={unversionedId:"ingestion/native-batch",id:"ingestion/native-batch",title:"Native batch ingestion",description:"\x3c!--",source:"@site/docs/26.0.0/ingestion/native-batch.md",sourceDirName:"ingestion",slug:"/ingestion/native-batch",permalink:"/docs/26.0.0/ingestion/native-batch",draft:!1,tags:[],version:"current",frontMatter:{id:"native-batch",title:"Native batch ingestion",sidebar_label:"Native batch"},sidebar:"docs",previous:{title:"Realtime Process",permalink:"/docs/26.0.0/ingestion/standalone-realtime"},next:{title:"Native batch: input sources",permalink:"/docs/26.0.0/ingestion/native-batch-input-sources"}},d={},m=[{value:"Submit an indexing task",id:"submit-an-indexing-task",level:2},{value:"Parallel task indexing",id:"parallel-task-indexing",level:2},{value:"Supported compression formats",id:"supported-compression-formats",level:3},{value:"Implementation considerations",id:"implementation-considerations",level:3},{value:"Volume control for worker tasks",id:"volume-control-for-worker-tasks",level:4},{value:"Number of running tasks",id:"number-of-running-tasks",level:4},{value:"Replacing or appending data",id:"replacing-or-appending-data",level:4},{value:"Fully replacing existing segments using tombstones",id:"fully-replacing-existing-segments-using-tombstones",level:4},{value:"Parallel indexing example",id:"parallel-indexing-example",level:2},{value:"Parallel indexing configuration",id:"parallel-indexing-configuration",level:2},{value:"<code>dataSchema</code>",id:"dataschema",level:3},{value:"<code>ioConfig</code>",id:"ioconfig",level:3},{value:"<code>tuningConfig</code>",id:"tuningconfig",level:3},{value:"Split Hint Spec",id:"split-hint-spec",level:3},{value:"Size-based Split Hint Spec",id:"size-based-split-hint-spec",level:4},{value:"Segments Split Hint Spec",id:"segments-split-hint-spec",level:4},{value:"<code>partitionsSpec</code>",id:"partitionsspec",level:3},{value:"Dynamic partitioning",id:"dynamic-partitioning",level:4},{value:"Hash-based partitioning",id:"hash-based-partitioning",level:4},{value:"Hash partition function",id:"hash-partition-function",level:5},{value:"Single-dimension range partitioning",id:"single-dimension-range-partitioning",level:4},{value:"Multi-dimension range partitioning",id:"multi-dimension-range-partitioning",level:4},{value:"Benefits of range partitioning",id:"benefits-of-range-partitioning",level:4},{value:"HTTP status endpoints",id:"http-status-endpoints",level:2},{value:"Segment pushing modes",id:"segment-pushing-modes",level:2},{value:"Capacity planning",id:"capacity-planning",level:2},{value:"Splittable input sources",id:"splittable-input-sources",level:2},{value:"<code>segmentWriteOutMediumFactory</code>",id:"segmentwriteoutmediumfactory",level:3}],u={toc:m},k="wrapper";function g(e){var t=e.components,n=(0,i.Z)(e,l);return(0,r.kt)(k,(0,a.Z)({},u,n,{components:t,mdxType:"MDXLayout"}),(0,r.kt)("blockquote",null,(0,r.kt)("p",{parentName:"blockquote"},"This page describes native batch ingestion using ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/ingestion-spec"},"ingestion specs"),". Refer to the ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/#batch"},"ingestion\nmethods")," table to determine which ingestion method is right for you.")),(0,r.kt)("p",null,"Apache Druid supports the following types of native batch indexing tasks:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"Parallel task indexing (",(0,r.kt)("inlineCode",{parentName:"li"},"index_parallel"),") that can run multiple indexing tasks concurrently. Parallel task works well for production ingestion tasks."),(0,r.kt)("li",{parentName:"ul"},"Simple task indexing (",(0,r.kt)("inlineCode",{parentName:"li"},"index"),") that run a single indexing task at a time. Simple task indexing is suitable for development and test environments.")),(0,r.kt)("p",null,"This topic covers the configuration for ",(0,r.kt)("inlineCode",{parentName:"p"},"index_parallel")," ingestion specs."),(0,r.kt)("p",null,"For related information on batch indexing, see:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/#batch"},"Batch ingestion method comparison table")," for a comparison of batch ingestion methods."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/tutorials/tutorial-batch"},"Tutorial: Loading a file")," for a tutorial on native batch ingestion."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources"},"Input sources")," for possible input sources."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/data-formats#input-format"},"Input formats")," for possible input formats.")),(0,r.kt)("h2",{id:"submit-an-indexing-task"},"Submit an indexing task"),(0,r.kt)("p",null,"To run either kind of native batch indexing task you can:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"Use the ",(0,r.kt)("strong",{parentName:"li"},"Load Data")," UI in the web console to define and submit an ingestion spec."),(0,r.kt)("li",{parentName:"ul"},"Define an ingestion spec in JSON based upon the ",(0,r.kt)("a",{parentName:"li",href:"#parallel-indexing-example"},"examples")," and reference topics for batch indexing. Then POST the ingestion spec to the ",(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/operations/api-reference#tasks"},"Indexer API endpoint"),",\n",(0,r.kt)("inlineCode",{parentName:"li"},"/druid/indexer/v1/task"),", the Overlord service. Alternatively you can use the indexing script included with Druid at ",(0,r.kt)("inlineCode",{parentName:"li"},"bin/post-index-task"),".")),(0,r.kt)("h2",{id:"parallel-task-indexing"},"Parallel task indexing"),(0,r.kt)("p",null,"The parallel task type ",(0,r.kt)("inlineCode",{parentName:"p"},"index_parallel")," is a task for multi-threaded batch indexing. Parallel task indexing only relies on Druid resources. It does not depend on other external systems like Hadoop."),(0,r.kt)("p",null,"The ",(0,r.kt)("inlineCode",{parentName:"p"},"index_parallel")," task is a supervisor task that orchestrates\nthe whole indexing process. The supervisor task splits the input data and creates worker tasks to process the individual portions of data."),(0,r.kt)("p",null,"Druid issues the worker tasks to the Overlord. The overlord schedules and runs the workers on MiddleManagers or Indexers. After a worker task successfully processes the assigned input portion, it reports the resulting segment list to the supervisor task."),(0,r.kt)("p",null,"The supervisor task periodically checks the status of worker tasks. If a task fails, the supervisor retries the task until the number of retries reaches the configured limit. If all worker tasks succeed, it publishes the reported segments at once and finalizes ingestion."),(0,r.kt)("p",null,"The detailed behavior of the parallel task is different depending on the ",(0,r.kt)("inlineCode",{parentName:"p"},"partitionsSpec"),". See ",(0,r.kt)("a",{parentName:"p",href:"#partitionsspec"},(0,r.kt)("inlineCode",{parentName:"a"},"partitionsSpec"))," for more details."),(0,r.kt)("p",null,"Parallel tasks require:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"a splittable ",(0,r.kt)("a",{parentName:"li",href:"#splittable-input-sources"},(0,r.kt)("inlineCode",{parentName:"a"},"inputSource"))," in the ",(0,r.kt)("inlineCode",{parentName:"li"},"ioConfig"),". For a list of supported splittable input formats, see ",(0,r.kt)("a",{parentName:"li",href:"#splittable-input-sources"},"Splittable input sources"),"."),(0,r.kt)("li",{parentName:"ul"},"the ",(0,r.kt)("inlineCode",{parentName:"li"},"maxNumConcurrentSubTasks")," greater than 1 in the ",(0,r.kt)("inlineCode",{parentName:"li"},"tuningConfig"),". Otherwise tasks run sequentially. The ",(0,r.kt)("inlineCode",{parentName:"li"},"index_parallel")," task reads each input file one by one and creates segments by itself.")),(0,r.kt)("h3",{id:"supported-compression-formats"},"Supported compression formats"),(0,r.kt)("p",null,"Native batch ingestion supports the following compression formats: "),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"bz2")),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"gz")),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"xz")),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"zip")),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"sz")," (Snappy)"),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"zst")," (ZSTD).")),(0,r.kt)("h3",{id:"implementation-considerations"},"Implementation considerations"),(0,r.kt)("p",null,"This section covers implementation details to consider when you implement parallel task ingestion."),(0,r.kt)("h4",{id:"volume-control-for-worker-tasks"},"Volume control for worker tasks"),(0,r.kt)("p",null,"You can control the amount of input data each worker task processes using different configurations depending on the phase in parallel ingestion."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"See ",(0,r.kt)("a",{parentName:"li",href:"#partitionsspec"},(0,r.kt)("inlineCode",{parentName:"a"},"partitionsSpec"))," for details about how partitioning affects data volume for tasks."),(0,r.kt)("li",{parentName:"ul"},"For the tasks that read data from the ",(0,r.kt)("inlineCode",{parentName:"li"},"inputSource"),", you can set the ",(0,r.kt)("a",{parentName:"li",href:"#split-hint-spec"},"Split hint spec")," in the ",(0,r.kt)("inlineCode",{parentName:"li"},"tuningConfig"),"."),(0,r.kt)("li",{parentName:"ul"},"For the task that merge shuffled segments, you can set the ",(0,r.kt)("inlineCode",{parentName:"li"},"totalNumMergeTasks")," in the ",(0,r.kt)("inlineCode",{parentName:"li"},"tuningConfig"),".")),(0,r.kt)("h4",{id:"number-of-running-tasks"},"Number of running tasks"),(0,r.kt)("p",null,"The ",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks")," in the ",(0,r.kt)("inlineCode",{parentName:"p"},"tuningConfig")," determines the number of concurrent worker tasks that run in parallel. The supervisor task checks the number of current running worker tasks and creates more if it's smaller than ",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks")," regardless of the number of available task slots. This may affect to other ingestion performance. See ",(0,r.kt)("a",{parentName:"p",href:"#capacity-planning"},"Capacity planning")," section for more details."),(0,r.kt)("h4",{id:"replacing-or-appending-data"},"Replacing or appending data"),(0,r.kt)("p",null,"By default, batch ingestion replaces all data in the intervals in your ",(0,r.kt)("inlineCode",{parentName:"p"},"granularitySpec"),"' for any segment that it writes to. If you want to add to the segment instead, set the ",(0,r.kt)("inlineCode",{parentName:"p"},"appendToExisting")," flag in the ",(0,r.kt)("inlineCode",{parentName:"p"},"ioConfig"),". Batch ingestion only replaces data in segments where it actively adds data. If there are segments in the intervals for your ",(0,r.kt)("inlineCode",{parentName:"p"},"granularitySpec")," that have do not have data from a task, they remain unchanged. If any existing segments partially overlap with the intervals in the ",(0,r.kt)("inlineCode",{parentName:"p"},"granularitySpec"),", the portion of those segments outside the interval for the new spec remain visible."),(0,r.kt)("h4",{id:"fully-replacing-existing-segments-using-tombstones"},"Fully replacing existing segments using tombstones"),(0,r.kt)("p",null,"You can set ",(0,r.kt)("inlineCode",{parentName:"p"},"dropExisting")," flag in the ",(0,r.kt)("inlineCode",{parentName:"p"},"ioConfig")," to true if you want the ingestion task to replace all existing segments that start and end within the intervals for your ",(0,r.kt)("inlineCode",{parentName:"p"},"granularitySpec"),". This applies whether or not the new data covers all existing segments. ",(0,r.kt)("inlineCode",{parentName:"p"},"dropExisting")," only applies when ",(0,r.kt)("inlineCode",{parentName:"p"},"appendToExisting")," is false and the ",(0,r.kt)("inlineCode",{parentName:"p"},"granularitySpec")," contains an ",(0,r.kt)("inlineCode",{parentName:"p"},"interval"),". WARNING: this functionality is still in beta."),(0,r.kt)("p",null,"The following examples demonstrate when to set the ",(0,r.kt)("inlineCode",{parentName:"p"},"dropExisting")," property to true in the ",(0,r.kt)("inlineCode",{parentName:"p"},"ioConfig"),":"),(0,r.kt)("p",null,"Consider an existing segment with an interval of 2020-01-01 to 2021-01-01 and ",(0,r.kt)("inlineCode",{parentName:"p"},"YEAR")," ",(0,r.kt)("inlineCode",{parentName:"p"},"segmentGranularity"),". You want to overwrite the whole interval of 2020-01-01 to 2021-01-01 with new data using the finer segmentGranularity of ",(0,r.kt)("inlineCode",{parentName:"p"},"MONTH"),". If the replacement data does not have a record within every months from 2020-01-01 to 2021-01-01 Druid cannot drop the original ",(0,r.kt)("inlineCode",{parentName:"p"},"YEAR")," segment even if it does include all the replacement data. Set ",(0,r.kt)("inlineCode",{parentName:"p"},"dropExisting")," to true in this case to replace the original segment at ",(0,r.kt)("inlineCode",{parentName:"p"},"YEAR")," ",(0,r.kt)("inlineCode",{parentName:"p"},"segmentGranularity")," since you no longer need it.",(0,r.kt)("br",null),(0,r.kt)("br",null),"\nImagine you want to re-ingest or overwrite a datasource and the new data does not contain some time intervals that exist in the datasource. For example, a datasource contains the following data at ",(0,r.kt)("inlineCode",{parentName:"p"},"MONTH")," segmentGranularity: "),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"January"),": 1 record "),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"February"),": 10 records "),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"March"),": 10 records ")),(0,r.kt)("p",null,"You want to re-ingest and overwrite with new data as follows: "),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"January"),": 0 records "),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"February"),": 10 records "),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"March"),": 9 records ")),(0,r.kt)("p",null,"Unless you set ",(0,r.kt)("inlineCode",{parentName:"p"},"dropExisting")," to true, the result after ingestion with overwrite using the same MONTH segmentGranularity would be: "),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"January"),": 1 record "),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"February"),": 10 records "),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("strong",{parentName:"li"},"March"),": 9 records")),(0,r.kt)("p",null,"This may not be what it is expected since the new data has 0 records for January. Set ",(0,r.kt)("inlineCode",{parentName:"p"},"dropExisting")," to true to replace the unneeded January segment with a tombstone."),(0,r.kt)("h2",{id:"parallel-indexing-example"},"Parallel indexing example"),(0,r.kt)("p",null,"The following example illustrates the configuration for a parallel indexing task:"),(0,r.kt)("pre",null,(0,r.kt)("code",{parentName:"pre",className:"language-json"},'{\n "type": "index_parallel",\n "spec": {\n "dataSchema": {\n "dataSource": "wikipedia_parallel_index_test",\n "timestampSpec": {\n "column": "timestamp"\n },\n "dimensionsSpec": {\n "dimensions": [\n "country",\n "page",\n "language",\n "user",\n "unpatrolled",\n "newPage",\n "robot",\n "anonymous",\n "namespace",\n "continent",\n "region",\n "city"\n ]\n },\n "metricsSpec": [\n {\n "type": "count",\n "name": "count"\n },\n {\n "type": "doubleSum",\n "name": "added",\n "fieldName": "added"\n },\n {\n "type": "doubleSum",\n "name": "deleted",\n "fieldName": "deleted"\n },\n {\n "type": "doubleSum",\n "name": "delta",\n "fieldName": "delta"\n }\n ],\n "granularitySpec": {\n "segmentGranularity": "DAY",\n "queryGranularity": "second",\n "intervals": [\n "2013-08-31/2013-09-02"\n ]\n }\n },\n "ioConfig": {\n "type": "index_parallel",\n "inputSource": {\n "type": "local",\n "baseDir": "examples/indexing/",\n "filter": "wikipedia_index_data*"\n },\n "inputFormat": {\n "type": "json"\n }\n },\n "tuningConfig": {\n "type": "index_parallel",\n "partitionsSpec": {\n "type": "single_dim",\n "partitionDimension": "country",\n "targetRowsPerSegment": 5000000\n },\n "maxNumConcurrentSubTasks": 2\n }\n }\n}\n')),(0,r.kt)("h2",{id:"parallel-indexing-configuration"},"Parallel indexing configuration"),(0,r.kt)("p",null,"The following table defines the primary sections of the input spec:\n|property|description|required?|\n|--------|-----------|---------|\n|type|The task type. For parallel task indexing, set the value to ",(0,r.kt)("inlineCode",{parentName:"p"},"index_parallel"),".|yes|\n|id|The task ID. If omitted, Druid generates the task ID using the task type, data source name, interval, and date-time stamp. |no|\n|spec|The ingestion spec that defines the ",(0,r.kt)("a",{parentName:"p",href:"#dataschema"},"data schema"),", ",(0,r.kt)("a",{parentName:"p",href:"#ioconfig"},"IO config"),", and ",(0,r.kt)("a",{parentName:"p",href:"#tuningconfig"},"tuning config"),".|yes|\n|context|Context to specify various task configuration parameters. See ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/tasks#context-parameters"},"Task context parameters")," for more details.|no|"),(0,r.kt)("h3",{id:"dataschema"},(0,r.kt)("inlineCode",{parentName:"h3"},"dataSchema")),(0,r.kt)("p",null,"This field is required. In general, it defines the way that Druid will store your data: the primary timestamp column, the dimensions, metrics, and any transformations. For an overview, see ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/ingestion-spec#dataschema"},"Ingestion Spec DataSchema"),"."),(0,r.kt)("p",null,"When defining the ",(0,r.kt)("inlineCode",{parentName:"p"},"granularitySpec")," for index parallel, consider the defining ",(0,r.kt)("inlineCode",{parentName:"p"},"intervals")," explicitly if you know the time range of the data. This way locking failure happens faster and Druid won't accidentally replace data outside the interval range some rows contain unexpected timestamps. The reasoning is as follows:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"If you explicitly define ",(0,r.kt)("inlineCode",{parentName:"li"},"intervals"),", batch ingestion locks all intervals specified when it starts up. Problems with locking become evident quickly when multiple ingestion or indexing tasks try to obtain a lock on the same interval. For example, if a Kafka ingestion task tries to obtain a lock on a locked interval causing the ingestion task fail. Furthermore, if there are rows outside the specified intervals, Druid drops them, avoiding conflict with unexpected intervals."),(0,r.kt)("li",{parentName:"ul"},"If you do not define ",(0,r.kt)("inlineCode",{parentName:"li"},"intervals"),", batch ingestion locks each interval when the interval is discovered. In this case if the task overlaps with a higher-priority task, issues with conflicting locks occur later in the ingestion process. Also if the source data includes rows with unexpected timestamps, they may caused unexpected locking of intervals.")),(0,r.kt)("h3",{id:"ioconfig"},(0,r.kt)("inlineCode",{parentName:"h3"},"ioConfig")),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"The task type. Set to the value to ",(0,r.kt)("inlineCode",{parentName:"td"},"index_parallel"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"inputFormat"),(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/ingestion/data-formats#input-format"},(0,r.kt)("inlineCode",{parentName:"a"},"inputFormat"))," to specify how to parse input data."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"appendToExisting"),(0,r.kt)("td",{parentName:"tr",align:null},"Creates segments as additional shards of the latest version, effectively appending to the segment set instead of replacing it. This means that you can append new segments to any datasource regardless of its original partitioning scheme. You must use the ",(0,r.kt)("inlineCode",{parentName:"td"},"dynamic")," partitioning type for the appended segments. If you specify a different partitioning type, the task fails with an error."),(0,r.kt)("td",{parentName:"tr",align:null},"false"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"dropExisting"),(0,r.kt)("td",{parentName:"tr",align:null},"If ",(0,r.kt)("inlineCode",{parentName:"td"},"true")," and ",(0,r.kt)("inlineCode",{parentName:"td"},"appendToExisting")," is ",(0,r.kt)("inlineCode",{parentName:"td"},"false")," and the ",(0,r.kt)("inlineCode",{parentName:"td"},"granularitySpec")," contains an",(0,r.kt)("inlineCode",{parentName:"td"},"interval"),", then the ingestion task replaces all existing segments fully contained by the specified ",(0,r.kt)("inlineCode",{parentName:"td"},"interval")," when the task publishes new segments. If ingestion fails, Druid does not change any existing segment. In the case of misconfiguration where either ",(0,r.kt)("inlineCode",{parentName:"td"},"appendToExisting")," is ",(0,r.kt)("inlineCode",{parentName:"td"},"true")," or ",(0,r.kt)("inlineCode",{parentName:"td"},"interval")," is not specified in ",(0,r.kt)("inlineCode",{parentName:"td"},"granularitySpec"),", Druid does not replace any segments even if ",(0,r.kt)("inlineCode",{parentName:"td"},"dropExisting")," is ",(0,r.kt)("inlineCode",{parentName:"td"},"true"),". WARNING: this functionality is still in beta."),(0,r.kt)("td",{parentName:"tr",align:null},"false"),(0,r.kt)("td",{parentName:"tr",align:null},"no")))),(0,r.kt)("h3",{id:"tuningconfig"},(0,r.kt)("inlineCode",{parentName:"h3"},"tuningConfig")),(0,r.kt)("p",null,"The tuningConfig is optional and default parameters will be used if no tuningConfig is specified. See below for more details."),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"The task type. Set the value to",(0,r.kt)("inlineCode",{parentName:"td"},"index_parallel"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxRowsInMemory"),(0,r.kt)("td",{parentName:"tr",align:null},"Determines when Druid should perform intermediate persists to disk. Normally you do not need to set this. Depending on the nature of your data, if rows are short in terms of bytes. For example, you may not want to store a million rows in memory. In this case, set this value."),(0,r.kt)("td",{parentName:"tr",align:null},"1000000"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxBytesInMemory"),(0,r.kt)("td",{parentName:"tr",align:null},"Use to determine when Druid should perform intermediate persists to disk. Normally Druid computes this internally and you do not need to set it. This value represents number of bytes to aggregate in heap memory before persisting. This is based on a rough estimate of memory usage and not actual usage. The maximum heap memory usage for indexing is maxBytesInMemory * (2 + maxPendingPersists). Note that ",(0,r.kt)("inlineCode",{parentName:"td"},"maxBytesInMemory")," also includes heap usage of artifacts created from intermediary persists. This means that after every persist, the amount of ",(0,r.kt)("inlineCode",{parentName:"td"},"maxBytesInMemory")," until next persist will decrease. Tasks fail when the sum of bytes of all intermediary persisted artifacts exceeds ",(0,r.kt)("inlineCode",{parentName:"td"},"maxBytesInMemory"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"1/6 of max JVM memory"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxColumnsToMerge"),(0,r.kt)("td",{parentName:"tr",align:null},"Limit of the number of segments to merge in a single phase when merging segments for publishing. This limit affects the total number of columns present in a set of segments to merge. If the limit is exceeded, segment merging occurs in multiple phases. Druid merges at least 2 segments per phase, regardless of this setting."),(0,r.kt)("td",{parentName:"tr",align:null},"-1 (unlimited)"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxTotalRows"),(0,r.kt)("td",{parentName:"tr",align:null},"Deprecated. Use ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionsSpec")," instead. Total number of rows in segments waiting to be pushed. Used to determine when intermediate pushing should occur."),(0,r.kt)("td",{parentName:"tr",align:null},"20000000"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"numShards"),(0,r.kt)("td",{parentName:"tr",align:null},"Deprecated. Use ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionsSpec")," instead. Directly specify the number of shards to create when using a ",(0,r.kt)("inlineCode",{parentName:"td"},"hashed")," ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionsSpec"),". If this is specified and ",(0,r.kt)("inlineCode",{parentName:"td"},"intervals")," is specified in the ",(0,r.kt)("inlineCode",{parentName:"td"},"granularitySpec"),", the index task can skip the determine intervals/partitions pass through the data."),(0,r.kt)("td",{parentName:"tr",align:null},"null"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"splitHintSpec"),(0,r.kt)("td",{parentName:"tr",align:null},"Hint to control the amount of data that each first phase task reads. Druid may ignore the hint depending on the implementation of the input source. See ",(0,r.kt)("a",{parentName:"td",href:"#split-hint-spec"},"Split hint spec")," for more details."),(0,r.kt)("td",{parentName:"tr",align:null},"size-based split hint spec"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"partitionsSpec"),(0,r.kt)("td",{parentName:"tr",align:null},"Defines how to partition data in each timeChunk, see ",(0,r.kt)("a",{parentName:"td",href:"#partitionsspec"},"PartitionsSpec")),(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("inlineCode",{parentName:"td"},"dynamic")," if ",(0,r.kt)("inlineCode",{parentName:"td"},"forceGuaranteedRollup")," = false, ",(0,r.kt)("inlineCode",{parentName:"td"},"hashed")," or ",(0,r.kt)("inlineCode",{parentName:"td"},"single_dim")," if ",(0,r.kt)("inlineCode",{parentName:"td"},"forceGuaranteedRollup")," = true"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"indexSpec"),(0,r.kt)("td",{parentName:"tr",align:null},"Defines segment storage format options to be used at indexing time, see ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/ingestion/ingestion-spec#indexspec"},"IndexSpec")),(0,r.kt)("td",{parentName:"tr",align:null},"null"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"indexSpecForIntermediatePersists"),(0,r.kt)("td",{parentName:"tr",align:null},"Defines segment storage format options to use at indexing time for intermediate persisted temporary segments. You can use this configuration to disable dimension/metric compression on intermediate segments to reduce memory required for final merging. However, if you disable compression on intermediate segments, page cache use my increase while intermediate segments are used before Druid merges them to the final published segment published. See ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/ingestion/ingestion-spec#indexspec"},"IndexSpec")," for possible values."),(0,r.kt)("td",{parentName:"tr",align:null},"same as indexSpec"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxPendingPersists"),(0,r.kt)("td",{parentName:"tr",align:null},"Maximum number of pending persists that remain not started. If a new intermediate persist exceeds this limit, ingestion blocks until the currently-running persist finishes. Maximum heap memory usage for indexing scales with maxRowsInMemory * (2 + maxPendingPersists)."),(0,r.kt)("td",{parentName:"tr",align:null},"0 (meaning one persist can be running concurrently with ingestion, and none can be queued up)"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"forceGuaranteedRollup"),(0,r.kt)("td",{parentName:"tr",align:null},"Forces ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/ingestion/rollup"},"perfect rollup"),". The perfect rollup optimizes the total size of generated segments and querying time but increases indexing time. If true, specify ",(0,r.kt)("inlineCode",{parentName:"td"},"intervals")," in the ",(0,r.kt)("inlineCode",{parentName:"td"},"granularitySpec")," and use either ",(0,r.kt)("inlineCode",{parentName:"td"},"hashed")," or ",(0,r.kt)("inlineCode",{parentName:"td"},"single_dim")," for the ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionsSpec"),". You cannot use this flag in conjunction with ",(0,r.kt)("inlineCode",{parentName:"td"},"appendToExisting")," of IOConfig. For more details, see ",(0,r.kt)("a",{parentName:"td",href:"#segment-pushing-modes"},"Segment pushing modes"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"false"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"reportParseExceptions"),(0,r.kt)("td",{parentName:"tr",align:null},"If true, Druid throws exceptions encountered during parsing and halts ingestion. If false, Druid skips unparseable rows and fields."),(0,r.kt)("td",{parentName:"tr",align:null},"false"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"pushTimeout"),(0,r.kt)("td",{parentName:"tr",align:null},"Milliseconds to wait to push segments. Must be >= 0, where 0 means to wait forever."),(0,r.kt)("td",{parentName:"tr",align:null},"0"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"segmentWriteOutMediumFactory"),(0,r.kt)("td",{parentName:"tr",align:null},"Segment write-out medium to use when creating segments. See ",(0,r.kt)("a",{parentName:"td",href:"#segmentwriteoutmediumfactory"},"SegmentWriteOutMediumFactory"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"If not specified, uses the value from ",(0,r.kt)("inlineCode",{parentName:"td"},"druid.peon.defaultSegmentWriteOutMediumFactory.type")),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxNumConcurrentSubTasks"),(0,r.kt)("td",{parentName:"tr",align:null},"Maximum number of worker tasks that can be run in parallel at the same time. The supervisor task spawns worker tasks up to ",(0,r.kt)("inlineCode",{parentName:"td"},"maxNumConcurrentSubTasks")," regardless of the current available task slots. If this value is 1, the supervisor task processes data ingestion on its own instead of spawning worker tasks. If this value is set to too large, the supervisor may create too many worker tasks that block other ingestion tasks. See ",(0,r.kt)("a",{parentName:"td",href:"#capacity-planning"},"Capacity planning")," for more details."),(0,r.kt)("td",{parentName:"tr",align:null},"1"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxRetry"),(0,r.kt)("td",{parentName:"tr",align:null},"Maximum number of retries on task failures."),(0,r.kt)("td",{parentName:"tr",align:null},"3"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxNumSegmentsToMerge"),(0,r.kt)("td",{parentName:"tr",align:null},"Max limit for the number of segments that a single task can merge at the same time in the second phase. Used only when ",(0,r.kt)("inlineCode",{parentName:"td"},"forceGuaranteedRollup")," is true."),(0,r.kt)("td",{parentName:"tr",align:null},"100"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"totalNumMergeTasks"),(0,r.kt)("td",{parentName:"tr",align:null},"Total number of tasks that merge segments in the merge phase when ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionsSpec")," is set to ",(0,r.kt)("inlineCode",{parentName:"td"},"hashed")," or ",(0,r.kt)("inlineCode",{parentName:"td"},"single_dim"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"10"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"taskStatusCheckPeriodMs"),(0,r.kt)("td",{parentName:"tr",align:null},"Polling period in milliseconds to check running task statuses."),(0,r.kt)("td",{parentName:"tr",align:null},"1000"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"chatHandlerTimeout"),(0,r.kt)("td",{parentName:"tr",align:null},"Timeout for reporting the pushed segments in worker tasks."),(0,r.kt)("td",{parentName:"tr",align:null},"PT10S"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"chatHandlerNumRetries"),(0,r.kt)("td",{parentName:"tr",align:null},"Retries for reporting the pushed segments in worker tasks."),(0,r.kt)("td",{parentName:"tr",align:null},"5"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"awaitSegmentAvailabilityTimeoutMillis"),(0,r.kt)("td",{parentName:"tr",align:null},"Long"),(0,r.kt)("td",{parentName:"tr",align:null},"Milliseconds to wait for the newly indexed segments to become available for query after ingestion completes. If ",(0,r.kt)("inlineCode",{parentName:"td"},"<= 0"),", no wait occurs. If ",(0,r.kt)("inlineCode",{parentName:"td"},"> 0"),", the task waits for the Coordinator to indicate that the new segments are available for querying. If the timeout expires, the task exits as successful, but the segments are not confirmed as available for query."),(0,r.kt)("td",{parentName:"tr",align:null},"no (default = 0)")))),(0,r.kt)("h3",{id:"split-hint-spec"},"Split Hint Spec"),(0,r.kt)("p",null,"The split hint spec is used to help the supervisor task divide input sources. Each worker task processes a single input division. You can control the amount of data each worker task reads during the first phase."),(0,r.kt)("h4",{id:"size-based-split-hint-spec"},"Size-based Split Hint Spec"),(0,r.kt)("p",null,"The size-based split hint spec affects all splittable input sources except for the HTTP input source and SQL input source."),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"Set the value to ",(0,r.kt)("inlineCode",{parentName:"td"},"maxSize"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxSplitSize"),(0,r.kt)("td",{parentName:"tr",align:null},"Maximum number of bytes of input files to process in a single subtask. If a single file is larger than the limit, Druid processes the file alone in a single subtask. Druid does not split files across tasks. One subtask will not process more files than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxNumFiles")," even when their total size is smaller than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxSplitSize"),". ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/configuration/human-readable-byte"},"Human-readable format")," is supported."),(0,r.kt)("td",{parentName:"tr",align:null},"1GiB"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxNumFiles"),(0,r.kt)("td",{parentName:"tr",align:null},"Maximum number of input files to process in a single subtask. This limit avoids task failures when the ingestion spec is too long. There are two known limits on the max size of serialized ingestion spec: the max ZNode size in ZooKeeper (",(0,r.kt)("inlineCode",{parentName:"td"},"jute.maxbuffer"),") and the max packet size in MySQL (",(0,r.kt)("inlineCode",{parentName:"td"},"max_allowed_packet"),"). These limits can cause ingestion tasks fail if the serialized ingestion spec size hits one of them. One subtask will not process more data than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxSplitSize")," even when the total number of files is smaller than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxNumFiles"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"1000"),(0,r.kt)("td",{parentName:"tr",align:null},"no")))),(0,r.kt)("h4",{id:"segments-split-hint-spec"},"Segments Split Hint Spec"),(0,r.kt)("p",null,"The segments split hint spec is used only for ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/native-batch-input-sources"},(0,r.kt)("inlineCode",{parentName:"a"},"DruidInputSource")),"."),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"Set the value to ",(0,r.kt)("inlineCode",{parentName:"td"},"segments"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxInputSegmentBytesPerTask"),(0,r.kt)("td",{parentName:"tr",align:null},"Maximum number of bytes of input segments to process in a single subtask. If a single segment is larger than this number, Druid processes the segment alone in a single subtask. Druid never splits input segments across tasks. A single subtask will not process more segments than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxNumSegments")," even when their total size is smaller than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxInputSegmentBytesPerTask"),". ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/configuration/human-readable-byte"},"Human-readable format")," is supported."),(0,r.kt)("td",{parentName:"tr",align:null},"1GiB"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxNumSegments"),(0,r.kt)("td",{parentName:"tr",align:null},"Maximum number of input segments to process in a single subtask. This limit avoids failures due to the the ingestion spec being too long. There are two known limits on the max size of serialized ingestion spec: the max ZNode size in ZooKeeper (",(0,r.kt)("inlineCode",{parentName:"td"},"jute.maxbuffer"),") and the max packet size in MySQL (",(0,r.kt)("inlineCode",{parentName:"td"},"max_allowed_packet"),"). These limits can make ingestion tasks fail when the serialized ingestion spec size hits one of them. A single subtask will not process more data than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxInputSegmentBytesPerTask")," even when the total number of segments is smaller than ",(0,r.kt)("inlineCode",{parentName:"td"},"maxNumSegments"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"1000"),(0,r.kt)("td",{parentName:"tr",align:null},"no")))),(0,r.kt)("h3",{id:"partitionsspec"},(0,r.kt)("inlineCode",{parentName:"h3"},"partitionsSpec")),(0,r.kt)("p",null,"The primary partition for Druid is time. You can define a secondary partitioning method in the partitions spec. Use the ",(0,r.kt)("inlineCode",{parentName:"p"},"partitionsSpec")," type that applies for your ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/rollup"},"rollup")," method. For perfect rollup, you can use:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"hashed")," partitioning based on the hash value of specified dimensions for each row"),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"single_dim")," based on ranges of values for a single dimension"),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"range")," based on ranges of values of multiple dimensions.")),(0,r.kt)("p",null,"For best-effort rollup, use ",(0,r.kt)("inlineCode",{parentName:"p"},"dynamic"),"."),(0,r.kt)("p",null,"For an overview, see ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/partitioning"},"Partitioning"),"."),(0,r.kt)("p",null,"The ",(0,r.kt)("inlineCode",{parentName:"p"},"partitionsSpec")," types have different characteristics."),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"PartitionsSpec"),(0,r.kt)("th",{parentName:"tr",align:null},"Ingestion speed"),(0,r.kt)("th",{parentName:"tr",align:null},"Partitioning method"),(0,r.kt)("th",{parentName:"tr",align:null},"Supported rollup mode"),(0,r.kt)("th",{parentName:"tr",align:null},"Secondary partition pruning at query time"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("inlineCode",{parentName:"td"},"dynamic")),(0,r.kt)("td",{parentName:"tr",align:null},"Fastest"),(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("a",{parentName:"td",href:"#dynamic-partitioning"},"Dynamic partitioning")," based on the number of rows in a segment."),(0,r.kt)("td",{parentName:"tr",align:null},"Best-effort rollup"),(0,r.kt)("td",{parentName:"tr",align:null},"N/A")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("inlineCode",{parentName:"td"},"hashed")),(0,r.kt)("td",{parentName:"tr",align:null},"Moderate"),(0,r.kt)("td",{parentName:"tr",align:null},"Multiple dimension ",(0,r.kt)("a",{parentName:"td",href:"#hash-based-partitioning"},"hash-based partitioning")," may reduce both your datasource size and query latency by improving data locality. See ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/ingestion/partitioning"},"Partitioning")," for more details."),(0,r.kt)("td",{parentName:"tr",align:null},"Perfect rollup"),(0,r.kt)("td",{parentName:"tr",align:null},"The broker can use the partition information to prune segments early to speed up queries. Since the broker knows how to hash ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimensions")," values to locate a segment, given a query including a filter on all the ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimensions"),", the broker can pick up only the segments holding the rows satisfying the filter on ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimensions")," for query processing.",(0,r.kt)("br",null),(0,r.kt)("br",null),"Note that ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimensions")," must be set at ingestion time to enable secondary partition pruning at query time.")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("inlineCode",{parentName:"td"},"single_dim")),(0,r.kt)("td",{parentName:"tr",align:null},"Slower"),(0,r.kt)("td",{parentName:"tr",align:null},"Single dimension ",(0,r.kt)("a",{parentName:"td",href:"#single-dimension-range-partitioning"},"range partitioning")," may reduce your datasource size and query latency by improving data locality. See ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/ingestion/partitioning"},"Partitioning")," for more details."),(0,r.kt)("td",{parentName:"tr",align:null},"Perfect rollup"),(0,r.kt)("td",{parentName:"tr",align:null},"The broker can use the partition information to prune segments early to speed up queries. Since the broker knows the range of ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimension")," values in each segment, given a query including a filter on the ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimension"),", the broker can pick up only the segments holding the rows satisfying the filter on ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimension")," for query processing.")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("inlineCode",{parentName:"td"},"range")),(0,r.kt)("td",{parentName:"tr",align:null},"Slowest"),(0,r.kt)("td",{parentName:"tr",align:null},"Multiple dimension ",(0,r.kt)("a",{parentName:"td",href:"#multi-dimension-range-partitioning"},"range partitioning")," may reduce your datasource size and query latency by improving data locality. See ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/ingestion/partitioning"},"Partitioning")," for more details."),(0,r.kt)("td",{parentName:"tr",align:null},"Perfect rollup"),(0,r.kt)("td",{parentName:"tr",align:null},"The broker can use the partition information to prune segments early to speed up queries. Since the broker knows the range of ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimensions")," values within each segment, given a query including a filter on the first of the ",(0,r.kt)("inlineCode",{parentName:"td"},"partitionDimensions"),", the broker can pick up only the segments holding the rows satisfying the filter on the first partition dimension for query processing.")))),(0,r.kt)("h4",{id:"dynamic-partitioning"},"Dynamic partitioning"),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"Set the value to ",(0,r.kt)("inlineCode",{parentName:"td"},"dynamic"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxRowsPerSegment"),(0,r.kt)("td",{parentName:"tr",align:null},"Used in sharding. Determines how many rows are in each segment."),(0,r.kt)("td",{parentName:"tr",align:null},"5000000"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxTotalRows"),(0,r.kt)("td",{parentName:"tr",align:null},"Total number of rows across all segments waiting for being pushed. Used in determining when intermediate segment push should occur."),(0,r.kt)("td",{parentName:"tr",align:null},"20000000"),(0,r.kt)("td",{parentName:"tr",align:null},"no")))),(0,r.kt)("p",null,"With the Dynamic partitioning, the parallel index task runs in a single phase:\nit spawns multiple worker tasks (type ",(0,r.kt)("inlineCode",{parentName:"p"},"single_phase_sub_task"),"), each of which creates segments.\nHow the worker task creates segments:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"Whenever the number of rows in the current segment exceeds\n",(0,r.kt)("inlineCode",{parentName:"li"},"maxRowsPerSegment"),"."),(0,r.kt)("li",{parentName:"ul"},"When the total number of rows in all segments across all time chunks reaches to ",(0,r.kt)("inlineCode",{parentName:"li"},"maxTotalRows"),". At this point the task pushes all segments created so far to the deep storage and creates new ones.")),(0,r.kt)("h4",{id:"hash-based-partitioning"},"Hash-based partitioning"),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"Set the value to ",(0,r.kt)("inlineCode",{parentName:"td"},"hashed"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"numShards"),(0,r.kt)("td",{parentName:"tr",align:null},"Directly specify the number of shards to create. If this is specified and ",(0,r.kt)("inlineCode",{parentName:"td"},"intervals")," is specified in the ",(0,r.kt)("inlineCode",{parentName:"td"},"granularitySpec"),", the index task can skip the determine intervals/partitions pass through the data. This property and ",(0,r.kt)("inlineCode",{parentName:"td"},"targetRowsPerSegment")," cannot both be set."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"targetRowsPerSegment"),(0,r.kt)("td",{parentName:"tr",align:null},"A target row count for each partition. If ",(0,r.kt)("inlineCode",{parentName:"td"},"numShards")," is left unspecified, the Parallel task will determine a partition count automatically such that each partition has a row count close to the target, assuming evenly distributed keys in the input data. A target per-segment row count of 5 million is used if both ",(0,r.kt)("inlineCode",{parentName:"td"},"numShards")," and ",(0,r.kt)("inlineCode",{parentName:"td"},"targetRowsPerSegment")," are null."),(0,r.kt)("td",{parentName:"tr",align:null},"null (or 5,000,000 if both ",(0,r.kt)("inlineCode",{parentName:"td"},"numShards")," and ",(0,r.kt)("inlineCode",{parentName:"td"},"targetRowsPerSegment")," are null)"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"partitionDimensions"),(0,r.kt)("td",{parentName:"tr",align:null},"The dimensions to partition on. Leave blank to select all dimensions."),(0,r.kt)("td",{parentName:"tr",align:null},"null"),(0,r.kt)("td",{parentName:"tr",align:null},"no")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"partitionFunction"),(0,r.kt)("td",{parentName:"tr",align:null},"A function to compute hash of partition dimensions. See ",(0,r.kt)("a",{parentName:"td",href:"#hash-partition-function"},"Hash partition function")),(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("inlineCode",{parentName:"td"},"murmur3_32_abs")),(0,r.kt)("td",{parentName:"tr",align:null},"no")))),(0,r.kt)("p",null,"The Parallel task with hash-based partitioning is similar to ",(0,r.kt)("a",{parentName:"p",href:"https://en.wikipedia.org/wiki/MapReduce"},"MapReduce"),".\nThe task runs in up to 3 phases: ",(0,r.kt)("inlineCode",{parentName:"p"},"partial dimension cardinality"),", ",(0,r.kt)("inlineCode",{parentName:"p"},"partial segment generation")," and ",(0,r.kt)("inlineCode",{parentName:"p"},"partial segment merge"),"."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"The ",(0,r.kt)("inlineCode",{parentName:"li"},"partial dimension cardinality")," phase is an optional phase that only runs if ",(0,r.kt)("inlineCode",{parentName:"li"},"numShards")," is not specified.\nThe Parallel task splits the input data and assigns them to worker tasks based on the split hint spec.\nEach worker task (type ",(0,r.kt)("inlineCode",{parentName:"li"},"partial_dimension_cardinality"),") gathers estimates of partitioning dimensions cardinality for\neach time chunk. The Parallel task will aggregate these estimates from the worker tasks and determine the highest\ncardinality across all of the time chunks in the input data, dividing this cardinality by ",(0,r.kt)("inlineCode",{parentName:"li"},"targetRowsPerSegment")," to\nautomatically determine ",(0,r.kt)("inlineCode",{parentName:"li"},"numShards"),"."),(0,r.kt)("li",{parentName:"ul"},"In the ",(0,r.kt)("inlineCode",{parentName:"li"},"partial segment generation")," phase, just like the Map phase in MapReduce,\nthe Parallel task splits the input data based on the split hint spec\nand assigns each split to a worker task. Each worker task (type ",(0,r.kt)("inlineCode",{parentName:"li"},"partial_index_generate"),") reads the assigned split, and partitions rows by the time chunk from ",(0,r.kt)("inlineCode",{parentName:"li"},"segmentGranularity")," (primary partition key) in the ",(0,r.kt)("inlineCode",{parentName:"li"},"granularitySpec"),"\nand then by the hash value of ",(0,r.kt)("inlineCode",{parentName:"li"},"partitionDimensions")," (secondary partition key) in the ",(0,r.kt)("inlineCode",{parentName:"li"},"partitionsSpec"),".\nThe partitioned data is stored in local storage of\nthe ",(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/design/middlemanager"},"middleManager")," or the ",(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/design/indexer"},"indexer"),"."),(0,r.kt)("li",{parentName:"ul"},"The ",(0,r.kt)("inlineCode",{parentName:"li"},"partial segment merge")," phase is similar to the Reduce phase in MapReduce.\nThe Parallel task spawns a new set of worker tasks (type ",(0,r.kt)("inlineCode",{parentName:"li"},"partial_index_generic_merge"),") to merge the partitioned data created in the previous phase. Here, the partitioned data is shuffled based on\nthe time chunk and the hash value of ",(0,r.kt)("inlineCode",{parentName:"li"},"partitionDimensions")," to be merged; each worker task reads the data falling in the same time chunk and the same hash value from multiple MiddleManager/Indexer processes and merges them to create the final segments. Finally, they push the final segments to the deep storage at once.")),(0,r.kt)("h5",{id:"hash-partition-function"},"Hash partition function"),(0,r.kt)("p",null,"In hash partitioning, the partition function is used to compute hash of partition dimensions. The partition dimension values are first serialized into a byte array as a whole, and then the partition function is applied to compute hash of the byte array. Druid currently supports only one partition function."),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"name"),(0,r.kt)("th",{parentName:"tr",align:null},"description"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},(0,r.kt)("inlineCode",{parentName:"td"},"murmur3_32_abs")),(0,r.kt)("td",{parentName:"tr",align:null},"Applies an absolute value function to the result of ",(0,r.kt)("a",{parentName:"td",href:"https://guava.dev/releases/16.0/api/docs/com/google/common/hash/Hashing.html#murmur3_32()"},(0,r.kt)("inlineCode",{parentName:"a"},"murmur3_32")),".")))),(0,r.kt)("h4",{id:"single-dimension-range-partitioning"},"Single-dimension range partitioning"),(0,r.kt)("blockquote",null,(0,r.kt)("p",{parentName:"blockquote"},"Single dimension range partitioning is not supported in the sequential mode of the ",(0,r.kt)("inlineCode",{parentName:"p"},"index_parallel")," task type.")),(0,r.kt)("p",null,"Range partitioning has ",(0,r.kt)("a",{parentName:"p",href:"#benefits-of-range-partitioning"},"several benefits")," related to storage footprint and query\nperformance."),(0,r.kt)("p",null,"The Parallel task will use one subtask when you set ",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks")," to 1."),(0,r.kt)("p",null,"When you use this technique to partition your data, segment sizes may be unequally distributed if the data in your ",(0,r.kt)("inlineCode",{parentName:"p"},"partitionDimension")," is also unequally distributed. Therefore, to avoid imbalance in data layout, review the distribution of values in your source data before deciding on a partitioning strategy."),(0,r.kt)("p",null,"Range partitioning is not possible on multi-value dimensions. If the provided\n",(0,r.kt)("inlineCode",{parentName:"p"},"partitionDimension")," is multi-value, your ingestion job will report an error."),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"Set the value to ",(0,r.kt)("inlineCode",{parentName:"td"},"single_dim"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"partitionDimension"),(0,r.kt)("td",{parentName:"tr",align:null},"The dimension to partition on. Only rows with a single dimension value are allowed."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"targetRowsPerSegment"),(0,r.kt)("td",{parentName:"tr",align:null},"Target number of rows to include in a partition, should be a number that targets segments of 500MB","~","1GB."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"either this or ",(0,r.kt)("inlineCode",{parentName:"td"},"maxRowsPerSegment"))),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxRowsPerSegment"),(0,r.kt)("td",{parentName:"tr",align:null},"Soft max for the number of rows to include in a partition."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"either this or ",(0,r.kt)("inlineCode",{parentName:"td"},"targetRowsPerSegment"))),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"assumeGrouped"),(0,r.kt)("td",{parentName:"tr",align:null},"Assume that input data has already been grouped on time and dimensions. Ingestion will run faster, but may choose sub-optimal partitions if this assumption is violated."),(0,r.kt)("td",{parentName:"tr",align:null},"false"),(0,r.kt)("td",{parentName:"tr",align:null},"no")))),(0,r.kt)("p",null,"With ",(0,r.kt)("inlineCode",{parentName:"p"},"single-dim")," partitioning, the Parallel task runs in 3 phases,\ni.e., ",(0,r.kt)("inlineCode",{parentName:"p"},"partial dimension distribution"),", ",(0,r.kt)("inlineCode",{parentName:"p"},"partial segment generation"),", and ",(0,r.kt)("inlineCode",{parentName:"p"},"partial segment merge"),".\nThe first phase is to collect some statistics to find\nthe best partitioning and the other 2 phases are to create partial segments\nand to merge them, respectively, as in hash-based partitioning."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"In the ",(0,r.kt)("inlineCode",{parentName:"li"},"partial dimension distribution")," phase, the Parallel task splits the input data and\nassigns them to worker tasks based on the split hint spec. Each worker task (type ",(0,r.kt)("inlineCode",{parentName:"li"},"partial_dimension_distribution"),") reads\nthe assigned split and builds a histogram for ",(0,r.kt)("inlineCode",{parentName:"li"},"partitionDimension"),".\nThe Parallel task collects those histograms from worker tasks and finds\nthe best range partitioning based on ",(0,r.kt)("inlineCode",{parentName:"li"},"partitionDimension")," to evenly\ndistribute rows across partitions. Note that either ",(0,r.kt)("inlineCode",{parentName:"li"},"targetRowsPerSegment"),"\nor ",(0,r.kt)("inlineCode",{parentName:"li"},"maxRowsPerSegment")," will be used to find the best partitioning."),(0,r.kt)("li",{parentName:"ul"},"In the ",(0,r.kt)("inlineCode",{parentName:"li"},"partial segment generation")," phase, the Parallel task spawns new worker tasks (type ",(0,r.kt)("inlineCode",{parentName:"li"},"partial_range_index_generate"),")\nto create partitioned data. Each worker task reads a split created as in the previous phase,\npartitions rows by the time chunk from the ",(0,r.kt)("inlineCode",{parentName:"li"},"segmentGranularity")," (primary partition key) in the ",(0,r.kt)("inlineCode",{parentName:"li"},"granularitySpec"),"\nand then by the range partitioning found in the previous phase.\nThe partitioned data is stored in local storage of\nthe ",(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/design/middlemanager"},"middleManager")," or the ",(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/design/indexer"},"indexer"),"."),(0,r.kt)("li",{parentName:"ul"},"In the ",(0,r.kt)("inlineCode",{parentName:"li"},"partial segment merge")," phase, the parallel index task spawns a new set of worker tasks (type ",(0,r.kt)("inlineCode",{parentName:"li"},"partial_index_generic_merge"),") to merge the partitioned\ndata created in the previous phase. Here, the partitioned data is shuffled based on\nthe time chunk and the value of ",(0,r.kt)("inlineCode",{parentName:"li"},"partitionDimension"),"; each worker task reads the segments\nfalling in the same partition of the same range from multiple MiddleManager/Indexer processes and merges\nthem to create the final segments. Finally, they push the final segments to the deep storage.")),(0,r.kt)("blockquote",null,(0,r.kt)("p",{parentName:"blockquote"},"Because the task with single-dimension range partitioning makes two passes over the input\nin ",(0,r.kt)("inlineCode",{parentName:"p"},"partial dimension distribution")," and ",(0,r.kt)("inlineCode",{parentName:"p"},"partial segment generation")," phases,\nthe task may fail if the input changes in between the two passes.")),(0,r.kt)("h4",{id:"multi-dimension-range-partitioning"},"Multi-dimension range partitioning"),(0,r.kt)("blockquote",null,(0,r.kt)("p",{parentName:"blockquote"},"Multi-dimension range partitioning is not supported in the sequential mode of the ",(0,r.kt)("inlineCode",{parentName:"p"},"index_parallel")," task type.")),(0,r.kt)("p",null,"Range partitioning has ",(0,r.kt)("a",{parentName:"p",href:"#benefits-of-range-partitioning"},"several benefits")," related to storage footprint and query\nperformance. Multi-dimension range partitioning improves over single-dimension range partitioning by allowing\nDruid to distribute segment sizes more evenly, and to prune on more dimensions."),(0,r.kt)("p",null,"Range partitioning is not possible on multi-value dimensions. If one of the provided\n",(0,r.kt)("inlineCode",{parentName:"p"},"partitionDimensions")," is multi-value, your ingestion job will report an error."),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"property"),(0,r.kt)("th",{parentName:"tr",align:null},"description"),(0,r.kt)("th",{parentName:"tr",align:null},"default"),(0,r.kt)("th",{parentName:"tr",align:null},"required?"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"Set the value to ",(0,r.kt)("inlineCode",{parentName:"td"},"range"),"."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"partitionDimensions"),(0,r.kt)("td",{parentName:"tr",align:null},"An array of dimensions to partition on. Order the dimensions from most frequently queried to least frequently queried. For best results, limit your number of dimensions to between three and five dimensions."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"yes")),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"targetRowsPerSegment"),(0,r.kt)("td",{parentName:"tr",align:null},"Target number of rows to include in a partition, should be a number that targets segments of 500MB","~","1GB."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"either this or ",(0,r.kt)("inlineCode",{parentName:"td"},"maxRowsPerSegment"))),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"maxRowsPerSegment"),(0,r.kt)("td",{parentName:"tr",align:null},"Soft max for the number of rows to include in a partition."),(0,r.kt)("td",{parentName:"tr",align:null},"none"),(0,r.kt)("td",{parentName:"tr",align:null},"either this or ",(0,r.kt)("inlineCode",{parentName:"td"},"targetRowsPerSegment"))),(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"assumeGrouped"),(0,r.kt)("td",{parentName:"tr",align:null},"Assume that input data has already been grouped on time and dimensions. Ingestion will run faster, but may choose sub-optimal partitions if this assumption is violated."),(0,r.kt)("td",{parentName:"tr",align:null},"false"),(0,r.kt)("td",{parentName:"tr",align:null},"no")))),(0,r.kt)("h4",{id:"benefits-of-range-partitioning"},"Benefits of range partitioning"),(0,r.kt)("p",null,"Range partitioning, either ",(0,r.kt)("inlineCode",{parentName:"p"},"single_dim")," or ",(0,r.kt)("inlineCode",{parentName:"p"},"range"),", has several benefits:"),(0,r.kt)("ol",null,(0,r.kt)("li",{parentName:"ol"},"Lower storage footprint due to combining similar data into the same segments, which improves compressibility."),(0,r.kt)("li",{parentName:"ol"},"Better query performance due to Broker-level segment pruning, which removes segments from\nconsideration when they cannot possibly contain data matching the query filter.")),(0,r.kt)("p",null,"For Broker-level segment pruning to be effective, you must include partition dimensions in the ",(0,r.kt)("inlineCode",{parentName:"p"},"WHERE")," clause. Each\npartition dimension can participate in pruning if the prior partition dimensions (those to its left) are also\nparticipating, and if the query uses filters that support pruning."),(0,r.kt)("p",null,"Filters that support pruning include:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"Equality on string literals, like ",(0,r.kt)("inlineCode",{parentName:"li"},"x = 'foo'")," and ",(0,r.kt)("inlineCode",{parentName:"li"},"x IN ('foo', 'bar')")," where ",(0,r.kt)("inlineCode",{parentName:"li"},"x")," is a string."),(0,r.kt)("li",{parentName:"ul"},"Comparison between string columns and string literals, like ",(0,r.kt)("inlineCode",{parentName:"li"},"x < 'foo'")," or other comparisons\ninvolving ",(0,r.kt)("inlineCode",{parentName:"li"},"<"),", ",(0,r.kt)("inlineCode",{parentName:"li"},">"),", ",(0,r.kt)("inlineCode",{parentName:"li"},"<="),", or ",(0,r.kt)("inlineCode",{parentName:"li"},">="),".")),(0,r.kt)("p",null,"For example, if you configure the following ",(0,r.kt)("inlineCode",{parentName:"p"},"range")," partitioning during ingestion:"),(0,r.kt)("pre",null,(0,r.kt)("code",{parentName:"pre",className:"language-json"},'"partitionsSpec": {\n "type": "range",\n "partitionDimensions": ["countryName", "cityName"],\n "targetRowsPerSegment": 5000000\n}\n')),(0,r.kt)("p",null,"Then, filters like ",(0,r.kt)("inlineCode",{parentName:"p"},"WHERE countryName = 'United States'")," or ",(0,r.kt)("inlineCode",{parentName:"p"},"WHERE countryName = 'United States' AND cityName = 'New York'"),"\ncan make use of pruning. However, ",(0,r.kt)("inlineCode",{parentName:"p"},"WHERE cityName = 'New York'")," cannot make use of pruning, because countryName is not\ninvolved. The clause ",(0,r.kt)("inlineCode",{parentName:"p"},"WHERE cityName LIKE 'New%'")," cannot make use of pruning either, because LIKE filters do not\nsupport pruning."),(0,r.kt)("h2",{id:"http-status-endpoints"},"HTTP status endpoints"),(0,r.kt)("p",null,"The supervisor task provides some HTTP endpoints to get running status."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/mode"))),(0,r.kt)("p",null,"Returns 'parallel' if the indexing task is running in parallel. Otherwise, it returns 'sequential'."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/phase"))),(0,r.kt)("p",null,"Returns the name of the current phase if the task running in the parallel mode."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/progress"))),(0,r.kt)("p",null,"Returns the estimated progress of the current phase if the supervisor task is running in the parallel mode."),(0,r.kt)("p",null,"An example of the result is"),(0,r.kt)("pre",null,(0,r.kt)("code",{parentName:"pre",className:"language-json"},'{\n "running":10,\n "succeeded":0,\n "failed":0,\n "complete":0,\n "total":10,\n "estimatedExpectedSucceeded":10\n}\n')),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/subtasks/running"))),(0,r.kt)("p",null,"Returns the task IDs of running worker tasks, or an empty list if the supervisor task is running in the sequential mode."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/subtaskspecs"))),(0,r.kt)("p",null,"Returns all worker task specs, or an empty list if the supervisor task is running in the sequential mode."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/subtaskspecs/running"))),(0,r.kt)("p",null,"Returns running worker task specs, or an empty list if the supervisor task is running in the sequential mode."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/subtaskspecs/complete"))),(0,r.kt)("p",null,"Returns complete worker task specs, or an empty list if the supervisor task is running in the sequential mode."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/subtaskspec/{SUB_TASK_SPEC_ID}"))),(0,r.kt)("p",null,"Returns the worker task spec of the given id, or HTTP 404 Not Found error if the supervisor task is running in the sequential mode."),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/subtaskspec/{SUB_TASK_SPEC_ID}/state"))),(0,r.kt)("p",null,"Returns the state of the worker task spec of the given id, or HTTP 404 Not Found error if the supervisor task is running in the sequential mode.\nThe returned result contains the worker task spec, a current task status if exists, and task attempt history."),(0,r.kt)("p",null,"An example of the result is"),(0,r.kt)("pre",null,(0,r.kt)("code",{parentName:"pre",className:"language-json"},'{\n "spec": {\n "id": "index_parallel_lineitem_2018-04-20T22:12:43.610Z_2",\n "groupId": "index_parallel_lineitem_2018-04-20T22:12:43.610Z",\n "supervisorTaskId": "index_parallel_lineitem_2018-04-20T22:12:43.610Z",\n "context": null,\n "inputSplit": {\n "split": "/path/to/data/lineitem.tbl.5"\n },\n "ingestionSpec": {\n "dataSchema": {\n "dataSource": "lineitem",\n "timestampSpec": {\n "column": "l_shipdate",\n "format": "yyyy-MM-dd"\n },\n "dimensionsSpec": {\n "dimensions": [\n "l_orderkey",\n "l_partkey",\n "l_suppkey",\n "l_linenumber",\n "l_returnflag",\n "l_linestatus",\n "l_shipdate",\n "l_commitdate",\n "l_receiptdate",\n "l_shipinstruct",\n "l_shipmode",\n "l_comment"\n ]\n },\n "metricsSpec": [\n {\n "type": "count",\n "name": "count"\n },\n {\n "type": "longSum",\n "name": "l_quantity",\n "fieldName": "l_quantity",\n "expression": null\n },\n {\n "type": "doubleSum",\n "name": "l_extendedprice",\n "fieldName": "l_extendedprice",\n "expression": null\n },\n {\n "type": "doubleSum",\n "name": "l_discount",\n "fieldName": "l_discount",\n "expression": null\n },\n {\n "type": "doubleSum",\n "name": "l_tax",\n "fieldName": "l_tax",\n "expression": null\n }\n ],\n "granularitySpec": {\n "type": "uniform",\n "segmentGranularity": "YEAR",\n "queryGranularity": {\n "type": "none"\n },\n "rollup": true,\n "intervals": [\n "1980-01-01T00:00:00.000Z/2020-01-01T00:00:00.000Z"\n ]\n },\n "transformSpec": {\n "filter": null,\n "transforms": []\n }\n },\n "ioConfig": {\n "type": "index_parallel",\n "inputSource": {\n "type": "local",\n "baseDir": "/path/to/data/",\n "filter": "lineitem.tbl.5"\n },\n "inputFormat": {\n "type": "tsv",\n "delimiter": "|",\n "columns": [\n "l_orderkey",\n "l_partkey",\n "l_suppkey",\n "l_linenumber",\n "l_quantity",\n "l_extendedprice",\n "l_discount",\n "l_tax",\n "l_returnflag",\n "l_linestatus",\n "l_shipdate",\n "l_commitdate",\n "l_receiptdate",\n "l_shipinstruct",\n "l_shipmode",\n "l_comment"\n ]\n },\n "appendToExisting": false,\n "dropExisting": false\n },\n "tuningConfig": {\n "type": "index_parallel",\n "partitionsSpec": {\n "type": "dynamic"\n },\n "maxRowsInMemory": 1000000,\n "maxTotalRows": 20000000,\n "numShards": null,\n "indexSpec": {\n "bitmap": {\n "type": "roaring"\n },\n "dimensionCompression": "lz4",\n "metricCompression": "lz4",\n "longEncoding": "longs"\n },\n "indexSpecForIntermediatePersists": {\n "bitmap": {\n "type": "roaring"\n },\n "dimensionCompression": "lz4",\n "metricCompression": "lz4",\n "longEncoding": "longs"\n },\n "maxPendingPersists": 0,\n "reportParseExceptions": false,\n "pushTimeout": 0,\n "segmentWriteOutMediumFactory": null,\n "maxNumConcurrentSubTasks": 4,\n "maxRetry": 3,\n "taskStatusCheckPeriodMs": 1000,\n "chatHandlerTimeout": "PT10S",\n "chatHandlerNumRetries": 5,\n "logParseExceptions": false,\n "maxParseExceptions": 2147483647,\n "maxSavedParseExceptions": 0,\n "forceGuaranteedRollup": false\n }\n }\n },\n "currentStatus": {\n "id": "index_sub_lineitem_2018-04-20T22:16:29.922Z",\n "type": "index_sub",\n "createdTime": "2018-04-20T22:16:29.925Z",\n "queueInsertionTime": "2018-04-20T22:16:29.929Z",\n "statusCode": "RUNNING",\n "duration": -1,\n "location": {\n "host": null,\n "port": -1,\n "tlsPort": -1\n },\n "dataSource": "lineitem",\n "errorMsg": null\n },\n "taskHistory": []\n}\n')),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("inlineCode",{parentName:"li"},"http://{PEON_IP}:{PEON_PORT}/druid/worker/v1/chat/{SUPERVISOR_TASK_ID}/subtaskspec/{SUB_TASK_SPEC_ID}/history"))),(0,r.kt)("p",null,"Returns the task attempt history of the worker task spec of the given id, or HTTP 404 Not Found error if the supervisor task is running in the sequential mode."),(0,r.kt)("h2",{id:"segment-pushing-modes"},"Segment pushing modes"),(0,r.kt)("p",null,"While ingesting data using the parallel task indexing, Druid creates segments from the input data and pushes them. For segment pushing,\nthe parallel task index supports the following segment pushing modes based upon your type of ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/rollup"},"rollup"),":"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},"Bulk pushing mode: Used for perfect rollup. Druid pushes every segment at the very end of the index task. Until then, Druid stores created segments in memory and local storage of the service running the index task. To enable bulk pushing mode, set ",(0,r.kt)("inlineCode",{parentName:"li"},"forceGuaranteedRollup")," to ",(0,r.kt)("inlineCode",{parentName:"li"},"true")," in your tuning config. You cannot use bulk pushing with ",(0,r.kt)("inlineCode",{parentName:"li"},"appendToExisting")," in your IOConfig."),(0,r.kt)("li",{parentName:"ul"},"Incremental pushing mode: Used for best-effort rollup. Druid pushes segments are incrementally during the course of the indexing task. The index task collects data and stores created segments in the memory and disks of the services running the task until the total number of collected rows exceeds ",(0,r.kt)("inlineCode",{parentName:"li"},"maxTotalRows"),". At that point the index task immediately pushes all segments created up until that moment, cleans up pushed segments, and continues to ingest the remaining data.")),(0,r.kt)("h2",{id:"capacity-planning"},"Capacity planning"),(0,r.kt)("p",null,"The supervisor task can create up to ",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks")," worker tasks no matter how many task slots are currently available.\nAs a result, total number of tasks which can be run at the same time is ",(0,r.kt)("inlineCode",{parentName:"p"},"(maxNumConcurrentSubTasks + 1)")," (including the supervisor task).\nPlease note that this can be even larger than total number of task slots (sum of the capacity of all workers).\nIf ",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks")," is larger than ",(0,r.kt)("inlineCode",{parentName:"p"},"n (available task slots)"),", then\n",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks")," tasks are created by the supervisor task, but only ",(0,r.kt)("inlineCode",{parentName:"p"},"n")," tasks would be started.\nOthers will wait in the pending state until any running task is finished."),(0,r.kt)("p",null,"If you are using the Parallel Index Task with stream ingestion together,\nwe would recommend to limit the max capacity for batch ingestion to prevent\nstream ingestion from being blocked by batch ingestion. Suppose you have\n",(0,r.kt)("inlineCode",{parentName:"p"},"t")," Parallel Index Tasks to run at the same time, but want to limit\nthe max number of tasks for batch ingestion to ",(0,r.kt)("inlineCode",{parentName:"p"},"b"),". Then, (sum of ",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks"),"\nof all Parallel Index Tasks + ",(0,r.kt)("inlineCode",{parentName:"p"},"t")," (for supervisor tasks)) must be smaller than ",(0,r.kt)("inlineCode",{parentName:"p"},"b"),"."),(0,r.kt)("p",null,"If you have some tasks of a higher priority than others, you may set their\n",(0,r.kt)("inlineCode",{parentName:"p"},"maxNumConcurrentSubTasks")," to a higher value than lower priority tasks.\nThis may help the higher priority tasks to finish earlier than lower priority tasks\nby assigning more task slots to them."),(0,r.kt)("h2",{id:"splittable-input-sources"},"Splittable input sources"),(0,r.kt)("p",null,"Use the ",(0,r.kt)("inlineCode",{parentName:"p"},"inputSource")," object to define the location where your index can read data. Only the native parallel task and simple task support the input source."),(0,r.kt)("p",null,"For details on available input sources see:"),(0,r.kt)("ul",null,(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#s3-input-source"},"S3 input source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"s3"),") reads data from AWS S3 storage."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#google-cloud-storage-input-source"},"Google Cloud Storage input source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"gs"),") reads data from Google Cloud Storage."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#azure-input-source"},"Azure input source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"azure"),") reads data from Azure Blob Storage and Azure Data Lake."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#hdfs-input-source"},"HDFS input source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"hdfs"),") reads data from HDFS storage."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#http-input-source"},"HTTP input Source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"http"),") reads data from HTTP servers."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#inline-input-source"},"Inline input Source")," reads data you paste into the web console."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#local-input-source"},"Local input Source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"local"),") reads data from local storage."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#druid-input-source"},"Druid input Source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"druid"),") reads data from a Druid datasource."),(0,r.kt)("li",{parentName:"ul"},(0,r.kt)("a",{parentName:"li",href:"/docs/26.0.0/ingestion/native-batch-input-sources#sql-input-source"},"SQL input Source")," (",(0,r.kt)("inlineCode",{parentName:"li"},"sql"),") reads data from a RDBMS source.")),(0,r.kt)("p",null,"For information on how to combine input sources, see ",(0,r.kt)("a",{parentName:"p",href:"/docs/26.0.0/ingestion/native-batch-input-sources#combining-input-source"},"Combining input source"),"."),(0,r.kt)("h3",{id:"segmentwriteoutmediumfactory"},(0,r.kt)("inlineCode",{parentName:"h3"},"segmentWriteOutMediumFactory")),(0,r.kt)("table",null,(0,r.kt)("thead",{parentName:"table"},(0,r.kt)("tr",{parentName:"thead"},(0,r.kt)("th",{parentName:"tr",align:null},"Field"),(0,r.kt)("th",{parentName:"tr",align:null},"Type"),(0,r.kt)("th",{parentName:"tr",align:null},"Description"),(0,r.kt)("th",{parentName:"tr",align:null},"Required"))),(0,r.kt)("tbody",{parentName:"table"},(0,r.kt)("tr",{parentName:"tbody"},(0,r.kt)("td",{parentName:"tr",align:null},"type"),(0,r.kt)("td",{parentName:"tr",align:null},"String"),(0,r.kt)("td",{parentName:"tr",align:null},"See ",(0,r.kt)("a",{parentName:"td",href:"/docs/26.0.0/configuration/#segmentwriteoutmediumfactory"},"Additional Peon Configuration: SegmentWriteOutMediumFactory")," for explanation and available options."),(0,r.kt)("td",{parentName:"tr",align:null},"yes")))))}g.isMDXComponent=!0}}]); |