<li><ahref="#streams_developer-guide_interactive-queries_your_app">3.1 Your application and interactive queries</a>
<li><ahref="#streams_developer-guide_interactive-queries_local-stores">3.2 Querying local state stores (for an application instance)</a>
<li><ahref="#streams_developer-guide_interactive-queries_local-key-value-stores">3.3 Querying local key-value stores</a>
<li><ahref="#streams_developer-guide_interactive-queries_local-window-stores">3.4 Querying local window stores</a>
<li><ahref="#streams_developer-guide_interactive-queries_custom-stores">3.5 Querying local custom state stores</a>
<li><ahref="#streams_developer-guide_interactive-queries_discovery">3.6 Querying remote state stores (for the entire application)</a>
<li><ahref="#streams_developer-guide_interactive-queries_rpc-layer">3.7 Adding an RPC layer to your application</a>
<li><ahref="#streams_developer-guide_interactive-queries_expose-rpc">3.8 Exposing the RPC endpoints of your application</a>
<li><ahref="#streams_developer-guide_interactive-queries_discover-app-instances-and-stores">3.9 Discovering and accessing application instances and their respective local state stores</a>
There is a <ahref="/{{version}}/documentation/#quickstart_kafkastreams">quickstart</a> example that provides how to run a stream processing program coded in the Kafka Streams library.
This section focuses on how to write, configure, and execute a Kafka Streams application.
</p>
<p>
As we have mentioned above, the computational logic of a Kafka Streams application is defined as a <ahref="/{{version}}/documentation/streams/core-concepts#streams_topology">processor topology</a>.
Currently Kafka Streams provides two sets of APIs to define the processor topology, which will be described in the subsequent sections.
As mentioned in the <ahref="/{{version}}/documentation/streams/core-concepts"><b>Core Concepts</b></a> section, a stream processor is a node in the processor topology that represents a single processing step.
With the <code>Processor</code> API developers can define arbitrary stream processors that process one received record at a time, and connect these processors with
their associated state stores to compose the processor topology that represents their customized processing logic.
</p>
<p>
The <code>Processor</code> interface provides one main API method, the <code>process</code> method,
which is performed on each of the received records.
In addition, the processor can maintain the current <code>ProcessorContext</code> instance variable initialized in the <code>init</code> method
and use the context to schedule a periodically called punctuation function (<code>context().schedule</code>),
to forward the modified / new key-value pair to downstream processors (<code>context().forward</code>),
to commit the current processing progress (<code>context().commit</code>), etc.
</p>
<p>
The following example <code>Processor</code> implementation defines a simple word-count algorithm:
</p>
<preclass="brush: java;">
public class MyProcessor implements Processor<String, String> {
// Note: Do not close any StateStores as these are managed
// by the library
}
};
</pre>
<p>
In the above implementation, the following actions are performed:
</p>
<ul>
<li>In the <code>init</code> method, schedule the punctuation every 1 second and retrieve the local state store by its name "Counts".</li>
<li>In the <code>process</code> method, upon each received record, split the value string into words, and update their counts into the state store (we will talk about this feature later in the section).</li>
<li>In the scheduled <code>punctuate</code> method, iterate the local state store and send the aggregated counts to the downstream processor, and commit the current stream state.</li>
// add "PROCESS1" node which takes the source processor "SOURCE" as its upstream processor
.addProcessor("PROCESS1", () -> new MyProcessor1(), "SOURCE")
// add "PROCESS2" node which takes "PROCESS1" as its upstream processor
.addProcessor("PROCESS2", () -> new MyProcessor2(), "PROCESS1")
// add "PROCESS3" node which takes "PROCESS1" as its upstream processor
.addProcessor("PROCESS3", () -> new MyProcessor3(), "PROCESS1")
// add the sink processor node "SINK1" that takes Kafka topic "sink-topic1"
// as output and the "PROCESS1" node as its upstream processor
.addSink("SINK1", "sink-topic1", "PROCESS1")
// add the sink processor node "SINK2" that takes Kafka topic "sink-topic2"
// as output and the "PROCESS2" node as its upstream processor
.addSink("SINK2", "sink-topic2", "PROCESS2")
// add the sink processor node "SINK3" that takes Kafka topic "sink-topic3"
// as output and the "PROCESS3" node as its upstream processor
.addSink("SINK3", "sink-topic3", "PROCESS3");
</pre>
There are several steps in the above code to build the topology, and here is a quick walk through:
<ul>
<li>First of all a source node named "SOURCE" is added to the topology using the <code>addSource</code> method, with one Kafka topic "src-topic" fed to it.</li>
<li>Three processor nodes are then added using the <code>addProcessor</code> method; here the first processor is a child of the "SOURCE" node, but is the parent of the other two processors.</li>
<li>Finally three sink nodes are added to complete the topology using the <code>addSink</code> method, each piping from a different parent processor node and writing to a separate topic.</li>
In order to make state stores fault-tolerant (e.g., to recover from machine crashes) as well as to allow for state store migration without data loss (e.g., to migrate a stateful stream task from one machine to another when elastically adding or removing capacity from your application), a state store can be <strong>continuously backed up</strong> to a Kafka topic behind the scenes.
We sometimes refer to this topic as the state store's associated <em>changelog topic</em> or simply its <em>changelog</em>.
In the case of a machine failure, for example, the state store and thus the application's state can be fully restored from its changelog.
You can enable or disable this backup feature for a state store, and thus its fault tolerance.
</p>
<p>
By default, persistent <strong>key-value stores</strong> are fault-tolerant.
They are backed by a <ahref="https://kafka.apache.org/documentation.html#compaction">compacted</a> changelog topic.
The purpose of compacting this topic is to prevent the topic from growing indefinitely, to reduce the storage consumed in the associated Kafka cluster, and to minimize recovery time if a state store needs to be restored from its changelog topic.
</p>
<p>
Similarly, persistent <strong>window stores</strong> are fault-tolerant.
They are backed by a topic that uses both <em>compaction</em> and <em>deletion</em>.
Using deletion in addition to compaction is required for the changelog topics of window stores because of the structure of the message keys that are being sent to the changelog topics: for window stores, the message keys are composite keys that include not only the "normal" key but also window timestamps.
For such composite keys it would not be sufficient to enable just compaction in order to prevent a changelog topic from growing out of bounds.
With deletion enabled, old windows that have expired will be cleaned up by Kafka's log cleaner as the log segments expire.
The default retention setting is <code>Windows#maintainMs()</code> + 1 day. This setting can be overriden by specifying <code>StreamsConfig.WINDOW_STORE_CHANGE_LOG_ADDITIONAL_RETENTION_MS_CONFIG</code> in the <code>StreamsConfig</code>.
When starting up your application any fault-tolerant state stores don't need a restoration process as the persisted state is read from local disk.
But there could be situations when a full restore from the backing changelog topic is required (e.g., a failure wiped out the local state or your application runs in a stateless environment and persisted data is lost on re-starts).
</p>
<p>
If you have a significant amount of data in the changelog topic, the restoration process could take a non-negligible amount of time.
Given that processing of new data won't start until the restoration process is completed, having a window into the progress of restoration is useful.
</p>
<p>
In order to observe the restoration of all state stores you provide your application an instance of the <code>org.apache.kafka.streams.processor.StateRestoreListener</code> interface.
You set the <code>org.apache.kafka.streams.processor.StateRestoreListener</code> by calling the <code>KafkaStreams#setGlobalStateRestoreListener</code> method.
</p>
<p>
A basic implementation example that prints restoration status to the console:
The <code>StateRestoreListener</code> instance is shared across all <code>org.apache.kafka.streams.processor.internals.StreamThread</code> instances and it is assumed all methods are stateless.
If any stateful operations are desired, then the user will need to provide synchronization internally.
You can enable or disable fault tolerance for a state store by enabling or disabling, respectively ,the changelogging of the store through <code>StateStoreBuilder#withLoggingEnabled(Map<String, String>)</code>
and <code>StateStoreBuilder#withLoggingDisabled()</code>.
You can also fine-tune the associated topic’s configuration if needed.
In addition to the actual store, you also need to provide a "factory" for the store by implementing the <code>org.apache.kafka.streams.processor.state.StoreSupplier</code> interface, which Kafka Streams uses to create instances of your store.
You also have the option of providing a <code>org.apache.kafka.streams.processor.StateRestoreCallback</code> instance used to restore the state store from its backing changelog topic.
This is done via the <code>org.apache.kafka.streams.processor.ProcessorContext#register</code> call inside the <code>StateStore#init</code> all.
There is an additional interface <code>org.apache.kafka.streams.processor.BatchingStateRestoreCallback</code> that provides bulk restoration semantics vs. the single record-at-a-time restoration semantics offered by the <code>StateRestoreCallback</code> interface.
</p>
<p>
Addtionally there are two abstract classes that implement <code>StateRestoreCallback</code> or <code>BatchingStateRestoreCallback</code> in conjuntion with the <code>org.apache.kafka.streams.processor.StateRestoreListener</code> interface (<code>org.apache.kafka.streams.processor.AbstractNotifyingRestoreCallback</code> and <code>org.apache.kafka.streams.processor.AbstractNotifyingBatchingRestoreCallback</code> respectively) that provide the ability for the state store to recieve notification of restoration progress for that store.
The <code>StateRestoreListener</code> in this case is per state store instance and is used for internal purposes such as updating config settings based on the status of the restoration process.
Now that we have defined a processor (WordCountProcessor) and the state stores, we can now construct the processor topology by connecting these processors and state stores together by using the <code>Topology</code> instance.
In addition, users can add <em>source processors</em> with the specified Kafka topics to generate input data streams into the topology, and <em>sink processors</em> with the specified Kafka topics to generate output data streams out of the topology.
</p>
<preclass="brush: java;">
Topology topology = new Topology();
// add the source processor node that takes Kafka topic "source-topic" as input
topology.addSource("Source", "source-topic")
// add the WordCountProcessor node which takes the source processor as its upstream processor
.addProcessor("Process", () -> new WordCountProcessor(), "Source")
// add the count store associated with the WordCountProcessor processor
.addStateStore(countStoreSupplier, "Process")
// add the sink processor node that takes Kafka topic "sink-topic" as output
// and the WordCountProcessor node as its upstream processor
.addSink("Sink", "sink-topic", "Process");
</pre>
<p>There are several steps in the above implementation to build the topology, and here is a quick walk-through:</p>
<ul>
<li>A source processor node named "Source" is added to the topology using the <code>addSource</code> method, with one Kafka topic "source-topic" fed to it.</li>
<li>A processor node named "Process" with the pre-defined <code>WordCountProcessor</code> logic is then added as the downstream processor of the "Source" node using the <code>addProcessor</code> method.</li>
<li>A predefined persistent key-value state store is created and associated with the "Process" node, using <code>countStoreSupplier</code>.</li>
<li>A sink processor node is then added to complete the topology using the <code>addSink</code> method, taking the "Process" node as its upstream processor and writing to a separate "sink-topic" Kafka topic.</li>
</ul>
<p>
In this topology, the "Process" stream processor node is considered a downstream processor of the "Source" node, and an upstream processor of the "Sink" node.
As a result, whenever the "Source" node forward a newly fetched record from Kafka to its downstream "Process" node, <code>WordCountProcessor#process()</code> method is triggered to process the record and update the associated state store; and whenever <code>context#forward()</code> is called in the <code>Punctuator#punctuate()</code> method, the aggregate key-value pair will be sent via the "Sink" processor node to the Kafka topic "sink-topic".
Note that in the <code>WordCountProcessor</code> implementation, users need to refer to the same store name "Counts" when accessing the key-value store; otherwise an exception will be thrown at runtime, indicating that the state store cannot be found; also, if the state store itself is not associated with the processor in the <code>Topology</code> code, accessing it in the processor's <code>init()</code> method will also throw an exception at runtime, indicating the state store is not accessible from this processor.
<h4><aid="streams_processor_describe"href="#streams_processor_describe">Describe a <code>Topology</code></a></h4>
<p>
After a <code>Topology</code> is specified it is possible to retrieve a description of the corresponding DAG via <code>#describe()</code> that returns a <code>TopologyDescription</code>.
A <code>TopologyDescription</code> contains all added source, processor, and sink nodes as well as all attached stores.
For source and sink nodes one can access the specified input/output topic name/pattern.
For processor nodes the attached stores are added to the description.
Additionally, all nodes have a list to all their connected successor and predecessor nodes.
Thus, <code>TopologyDescritpion</code> allows to retrieve the DAG structure of the specified topology.
<br/>
Note that global stores are listed explicitly as they are accessible by all nodes without the need to explicitly connect them.
Furthermore, nodes are grouped by <code>Sub-topologies</code>, where each sub-topology is a group of processor nodes that are directly connected to each other (i.e., either by a direct connection—but not a topic—or by sharing a store).
During execution, each <code>Sub-topology</code> will be processed by <ahref="/{{version}}/documentation/streams/architecture#streams_architecture_tasks">one or multiple tasks</a>.
Thus, each <code>Sub-topology</code> describes an independent unit of works that can be executed by different threads in parallel.
Describing a <code>Topology</code> before starting your streams application with the specified topology is helpful to reason about tasks and thus maximum parallelism (we will talk about how to execute your written application later in this section).
It is also helpful to get insight into a <code>Topology</code> if it is not specified directly as described above but via Kafka Streams DSL (we will describe the DSL in the next section.
A simple example is included with the source code for Kafka in the <code>streams/examples</code> package. The rest of this section will walk
through some code to demonstrate the key steps in creating a topology using the Streams DSL, but we recommend developers to read the full example source
codes for details.
<h4><aid="streams_duality"href="#streams_duality">Duality of Streams and Tables</a></h4>
<p>
Before we discuss concepts such as aggregations in Kafka Streams we must first introduce tables, and most importantly the relationship between tables and streams:
the so-called <ahref="https://engineering.linkedin.com/distributed-systems/log-what-every-software-engineer-should-know-about-real-time-datas-unifying/">stream-table duality</a>.
Essentially, this duality means that a stream can be viewed as a table, and vice versa. Kafka's log compaction feature, for example, exploits this duality.
</p>
<p>
A simple form of a table is a collection of key-value pairs, also called a map or associative array. Such a table may look as follows:
The <b>stream-table duality</b> describes the close relationship between streams and tables.
<ul>
<li><b>Stream as Table</b>: A stream can be considered a changelog of a table, where each data record in the stream captures a state change of the table. A stream is thus a table in disguise, and it can be easily turned into a "real" table by replaying the changelog from beginning to end to reconstruct the table. Similarly, in a more general analogy, aggregating data records in a stream - such as computing the total number of pageviews by user from a stream of pageview events - will return a table (here with the key and the value being the user and its corresponding pageview count, respectively).</li>
<li><b>Table as Stream</b>: A table can be considered a snapshot, at a point in time, of the latest value for each key in a stream (a stream's data records are key-value pairs). A table is thus a stream in disguise, and it can be easily turned into a "real" stream by iterating over each key-value entry in the table.</li>
</ul>
<p>
Let's illustrate this with an example. Imagine a table that tracks the total number of pageviews by user (first column of diagram below). Over time, whenever a new pageview event is processed, the state of the table is updated accordingly. Here, the state changes between different points in time - and different revisions of the table - can be represented as a changelog stream (second column).
The same mechanism is used, for example, to replicate databases via change data capture (CDC) and, within Kafka Streams, to replicate its so-called state stores across machines for fault-tolerance.
The stream-table duality is such an important concept that Kafka Streams models it explicitly via the <ahref="#streams_kstream_ktable">KStream, KTable, and GlobalKTable</a> interfaces, which we describe in the next sections.
</p>
<h5><aid="streams_kstream_ktable"href="#streams_kstream_ktable">KStream, KTable, and GlobalKTable</a></h5>
The DSL uses three main abstractions. A <b>KStream</b> is an abstraction of a record stream, where each data record represents a self-contained datum in the unbounded data set.
A <b>KTable</b> is an abstraction of a changelog stream, where each data record represents an update. More precisely, the value in a data record is considered to be an update of the last value for the same record key,
if any (if a corresponding key doesn't exist yet, the update will be considered a create).
Like a <b>KTable</b>, a <b>GlobalKTable</b> is an abstraction of a changelog stream, where each data record represents an update.
However, a <b>GlobalKTable</b> is different from a <b>KTable</b> in that it is fully replicated on each KafkaStreams instance.
<b>GlobalKTable</b> also provides the ability to look up current values of data records by keys.
This table-lookup functionality is available through <ahref="#streams_dsl_joins">join operations</a>.
To illustrate the difference between KStreams and KTables/GlobalKTables, let's imagine the following two data records are being sent to the stream:
If the stream is defined as a KStream and the stream processing application were to sum the values it would return <code>4</code>. If the stream is defined as a KTable or GlobalKTable, the return would be <code>3</code>, since the last record would be considered as an update.
<b>Example of semantics for stream aggregations</b>: A <code>KGroupedStream → KTable</code> example is shown below. The streams and the table are
initially empty. We use bold font in the column for "KTable <code>aggregated</code>" to highlight changed state. An entry such as <code>(hello, 1)</code>
denotes a record with key <code>hello</code> and value <code>1</code>. To improve the readability of the semantics table we assume that all records are
<b>Impact of <ahref=#streams_developer-guide_memory-management_record-cache>record caches</a></b>: For illustration purposes,
the column "KTable <code>aggregated</code>" below shows the table's state changes over
time in a very granular way. In practice, you would observe state changes in such a granular way only when record caches are
disabled (default: enabled). When record caches are enabled, what might happen for example is that the output results of the
rows with timestamps 4 and 5 would be compacted, and there would only be a single state update for the key <code>kafka</code> in the KTable
(here: from <code>(kafka 1)</code> directly to <code>(kafka, 3)</code>. Typically, you should only disable record caches for testing or debugging purposes
-- under normal circumstances it is better to leave record caches enabled.
</p>
<tableclass="data-table"border="1">
<thead>
<col>
<colgroupspan="2"></colgroup>
<colgroupspan="2"></colgroup>
<col>
<tr>
<thscope="col"></th>
<thcolspan="2">KStream wordCounts</th>
<thcolspan="2">KGroupedStream groupedStream</th>
<thscope="col">KTable aggregated</th>
</tr>
</thead>
<tbody>
<tr>
<thscope="col">Timestamp</th>
<thscope="col">Input record</th>
<thscope="col">Grouping</th>
<thscope="col">Initializer</th>
<thscope="col">Adder</th>
<thscope="col">State</th>
</tr>
<tr>
<td>1</td>
<td>(hello, 1)</td>
<td>(hello, 1)</td>
<td>0 (for hello)</td>
<td>(hello, 0 + 1)</td>
<td>(hello, 1)</td>
</tr>
<tr>
<td>2</td>
<td>(kafka, 1)</td>
<td>(kafka, 1)</td>
<td>0 (for kafka)</td>
<td>(kafka, 0 + 1)</td>
<td>(hello, 1), (kafka, 1)</td>
</tr>
<tr>
<td>3</td>
<td>(streams, 1)</td>
<td>(streams, 1)</td>
<td>0 (for streams)</td>
<td>(streams, 0 + 1)</td>
<td>(hello, 1), (kafka, 1), (streams, 1)</td>
</tr>
<tr>
<td>4</td>
<td>(kafka, 1)</td>
<td>(kafka, 1)</td>
<td></td>
<td>(kafka, 1 + 1)</td>
<td>(hello, 1), (kafka, 2), (streams, 1)</td>
</tr>
<tr>
<td>5</td>
<td>(kafka, 1)</td>
<td>(kafka, 1)</td>
<td></td>
<td>(kafka, 2 + 1)</td>
<td>(hello, 1), (kafka, 3), (streams, 1)</td>
</tr>
<tr>
<td>6</td>
<td>(streams, 1)</td>
<td>(streams, 1)</td>
<td></td>
<td>(streams, 1 + 1)</td>
<td>(hello, 1), (kafka, 3), (streams, 2)</td>
</tr>
</tbody>
</table>
<p>
Example of semantics for table aggregations: A <code>KGroupedTable → KTable</code> example is shown below. The tables are initially empty.
We use bold font in the column for "KTable <code>aggregated</code>" to highlight changed state. An entry such as <code>(hello, 1)</code> denotes a
record with key <code>hello</code> and value <code>1</code>. To improve the readability of the semantics table we assume that all records are processed
in timestamp order.
</p>
<preclass="brush: java;">
// Key: username, value: user region (abbreviated to "E" for "Europe", "A" for "Asia")
KTable<String, String> userProfiles = ...;
// Re-group `userProfiles`. Don't read too much into what the grouping does:
// its prime purpose in this example is to show the *effects* of the grouping
A stream processor may need to divide data records into time buckets, i.e. to <b>window</b> the stream by time. This is usually needed for join and aggregation operations, etc. Kafka Streams currently defines the following types of windows:
<ul>
<li><b>Hopping time windows</b> are windows based on time intervals. They model fixed-sized, (possibly) overlapping windows. A hopping window is defined by two properties: the window's size and its advance interval (aka "hop"). The advance interval specifies by how much a window moves forward relative to the previous one. For example, you can configure a hopping window with a size 5 minutes and an advance interval of 1 minute. Since hopping windows can overlap a data record may belong to more than one such windows.</li>
<li><b>Tumbling time windows</b> are a special case of hopping time windows and, like the latter, are windows based on time intervals. They model fixed-size, non-overlapping, gap-less windows. A tumbling window is defined by a single property: the window's size. A tumbling window is a hopping window whose window size is equal to its advance interval. Since tumbling windows never overlap, a data record will belong to one and only one window.</li>
<li><b>Sliding windows</b> model a fixed-size window that slides continuously over the time axis; here, two data records are said to be included in the same window if the difference of their timestamps is within the window size. Thus, sliding windows are not aligned to the epoch, but on the data record timestamps. In Kafka Streams, sliding windows are used only for join operations, and can be specified through the <code>JoinWindows</code> class.</li>
<li><b>Session windows</b> are used to aggregate key-based events into sessions.
Sessions represent a period of activity separated by a defined gap of inactivity.
Any events processed that fall within the inactivity gap of any existing sessions are merged into the existing sessions.
If the event falls outside of the session gap, then a new session will be created.
Session windows are tracked independently across keys (e.g. windows of different keys typically have different start and end times) and their sizes vary (even windows for the same key typically have different sizes);
as such session windows can't be pre-computed and are instead derived from analyzing the timestamps of the data records.
</li>
</ul>
<p>
In the Kafka Streams DSL users can specify a <b>retention period</b> for the window. This allows Kafka Streams to retain old window buckets for a period of time in order to wait for the late arrival of records whose timestamps fall within the window interval.
If a record arrives after the retention period has passed, the record cannot be processed and is dropped.
</p>
<p>
Late-arriving records are always possible in real-time data streams. However, it depends on the effective <ahref="/{{version}}/documentation/streams/core-concepts#streams_time">time semantics</a> how late records are handled. Using processing-time, the semantics are "when the data is being processed",
which means that the notion of late records is not applicable as, by definition, no record can be late. Hence, late-arriving records only really can be considered as such (i.e. as arriving "late") for event-time or ingestion-time semantics. In both cases,
Kafka Streams is able to properly handle late-arriving records.
A <b>join</b> operation merges two streams based on the keys of their data records, and yields a new stream. A join over record streams usually needs to be performed on a windowing basis because otherwise the number of records that must be maintained for performing the join may grow indefinitely. In Kafka Streams, you may perform the following join operations:
<ul>
<li><b>KStream-to-KStream Joins</b> are always windowed joins, since otherwise the memory and state required to compute the join would grow infinitely in size. Here, a newly received record from one of the streams is joined with the other stream's records within the specified window interval to produce one result for each matching pair based on user-provided <code>ValueJoiner</code>. A new <code>KStream</code> instance representing the result stream of the join is returned from this operator.</li>
<li><b>KTable-to-KTable Joins</b> are join operations designed to be consistent with the ones in relational databases. Here, both changelog streams are materialized into local state stores first. When a new record is received from one of the streams, it is joined with the other stream's materialized state stores to produce one result for each matching pair based on user-provided ValueJoiner. A new <code>KTable</code> instance representing the result stream of the join, which is also a changelog stream of the represented table, is returned from this operator.</li>
<li><b>KStream-to-KTable Joins</b> allow you to perform table lookups against a changelog stream (<code>KTable</code>) upon receiving a new record from another record stream (<code>KStream</code>). An example use case would be to enrich a stream of user activities (<code>KStream</code>) with the latest user profile information (<code>KTable</code>). Only records received from the record stream will trigger the join and produce results via <code>ValueJoiner</code>, not vice versa (i.e., records received from the changelog stream will be used only to update the materialized state store). A new <code>KStream</code> instance representing the result stream of the join is returned from this operator.</li>
<li><b>KStream-to-GlobalKTable Joins</b> allow you to perform table lookups against a fully replicated changelog stream (<code>GlobalKTable</code>) upon receiving a new record from another record stream (<code>KStream</code>).
Joins with a <code>GlobalKTable</code> don't require repartitioning of the input <code>KStream</code> as all partitions of the <code>GlobalKTable</code> are available on every KafkaStreams instance.
The <code>KeyValueMapper</code> provided with the join operation is applied to each KStream record to extract the join-key that is used to do the lookup to the GlobalKTable so non-record-key joins are possible.
An example use case would be to enrich a stream of user activities (<code>KStream</code>) with the latest user profile information (<code>GlobalKTable</code>).
Only records received from the record stream will trigger the join and produce results via <code>ValueJoiner</code>, not vice versa (i.e., records received from the changelog stream will be used only to update the materialized state store).
A new <code>KStream</code> instance representing the result stream of the join is returned from this operator.</li>
</ul>
Depending on the operands the following join operations are supported: <b>inner joins</b>, <b>outer joins</b> and <b>left joins</b>.
Their <ahref="https://cwiki.apache.org/confluence/display/KAFKA/Kafka+Streams+Join+Semantics">semantics</a> are similar to the corresponding operators in relational databases.
<h4><aid="streams_dsl_sink"href="#streams_dsl_sink">Write streams back to Kafka</a></h4>
<p>
At the end of the processing, users can choose to (continuously) write the final resulted streams back to a Kafka topic through
<code>KStream.to</code> and <code>KTable.to</code>.
<h4><aid="streams_dsl_build"href="#streams_dsl_build">Generate the processor topology</a></h4>
<p>
Within the Streams DSL, while users are specifying the operations to create / transform various streams as described above, a <code>Topology</code> is constructed implicitly within the <code>StreamsBuilder</code>.
Users can generate the constructed topology at any given point in time by calling <code>build</code>:
</p>
<preclass="brush: java;">
Topology topology = builder.build();
</pre>
<p>
Users can investigate the generated <code>Topology</code> via its <code>describe</code> API, and continue building or modifying the topology until they are satisfied with it.
The topology then can be used to execute the application (we will talk about this later in this section).
Interactive queries let you get more from streaming than just the processing of data. This feature allows you to treat the stream processing layer as a lightweight embedded database and, more concretely, <i>to directly query the latest state</i> of your stream processing application, without needing to materialize that state to external databases or external storage first.
As a result, interactive queries simplify the architecture of many use cases and lead to more application-centric architectures. For example, you often no longer need to operate and interface with a separate database cluster -- or a separate infrastructure team in your company that runs that cluster -- to share data between a Kafka Streams application (say, an event-driven microservice) and downstream applications, regardless of whether these applications use Kafka Streams or not; they may even be applications that do not run on the JVM, e.g. implemented in Python, C/C++, or JavaScript.
The following diagrams juxtapose two architectures: the first does not use interactive queries whereas the second architecture does. It depends on the concrete use case to determine which of these architectures is a better fit -- the important takeaway is that Kafka Streams and interactive queries give you the flexibility to pick and to compose the right one, rather than limiting you to just a single way.
<h4><aid="streams_developer-guide_interactive-queries_your_app"href="#streams_developer-guide_interactive-queries_your_app">Your application and interactive queries</a></h4>
Interactive queries allow you to tap into the <i>state</i> of your application, and notably to do that from outside your application.
However, an application is not interactively queryable out of the box: you make it queryable by leveraging the API of Kafka Streams.
</p>
<p>
It is important to understand that the state of your application -- to be extra clear, we might call it "the full state of the entire application" -- is typically split across many distributed instances of your application, and thus across many state stores that are managed locally by these application instances.
Accordingly, the API to let you interactively query your application's state has two parts, a <i>local</i> and a <i>remote</i> one:
</p>
<ol>
<li><ahref="#streams_developer-guide_interactive-queries_local-stores">Querying local state stores (for an application instance)</a>: You can query that (part of the full) state that is managed locally by an instance of your application. Here, an application instance can directly query its own local state stores. You can thus use the corresponding (local) data in other parts of your application code that are not related to calling the Kafka Streams API. Querying state stores is always *read-only* to guarantee that the underlying state stores will never be mutated out-of-band, e.g. you cannot add new entries; state stores should only ever be mutated by the corresponding processor topology and the input data it operates on.
</li>
<li><ahref="#streams_developer-guide_interactive-queries_discovery">Querying remote state stores (for the entire application)</a>: To query the full state of your entire application we must be able to piece together the various local fragments of the state. In addition to being able to (a) query local state stores as described in the previous bullet point, we also need to (b) discover all the running instances of your application in the network, including their respective state stores and (c) have a way to communicate with these instances over the network, i.e. an RPC layer. Collectively, these building blocks enable intra-app communcation (between instances of the same app) as well as inter-app communication (from other applications) for interactive queries.
</li>
</ol>
<tableclass="data-table">
<tbody>
<tr>
<th>What of the below is required to access the state of ...</th>
<th>... an app instance (local state)</th>
<th>... the entire application (full state)</th>
</tr>
<tr>
<td>Query local state stores of an app instance</td><td>Required (but already built-in)</td><td>Required (but already built-in)</td>
</tr>
<tr>
<td>Make an app instance discoverable to others</td><td>Not needed</td><td>Required (but already built-in)</td>
</tr>
<tr>
<td>Discover all running app instances and their state stores</td><td>Not needed</td><td>Required (but already built-in)</td>
</tr>
<tr>
<td>Communicate with app instances over the network (RPC)</td><td>Not needed</td><td>Required <b>user must provide</b></td>
</tr>
</tbody>
</table>
<p>
Kafka Streams provides all the required functionality for interactively querying your application's state out of the box, with but one exception: if you want to expose your application's full state via interactive queries, then --
for reasons we explain further down below -- it is your responsibility to add an appropriate RPC layer (such as a REST
API) to your application that allows application instances to communicate over the network. If, however, you only need
to let your application instances access their own local state, then you do not need to add such an RPC layer at all.
</p>
<h4><aid="streams_developer-guide_interactive-queries_local-stores"href="#streams_developer-guide_interactive-queries_local-stores">Querying local state stores (for an application instance)</a></h4>
<p>
A Kafka Streams application is typically running on many instances.
The state that is locally available on any given instance is only a subset of the application's entire state.
Querying the local stores on an instance will, by definition, <i>only return data locally available on that particular instance</i>.
We explain how to access data in state stores that are not locally available in section <ahref="#streams_developer-guide_interactive-queries_discovery"><b>Querying remote state stores</b></a> (for the entire application).
<figcaptionstyle="text-align: center;"><i>Every application instance can directly query any of its local state stores</i></figcaption>
</figure>
<p>
The <i>name</i> of a state store is defined when you are creating the store, either when creating the store explicitly (e.g. when using the Processor API) or when creating the store implicitly (e.g. when using stateful operations in the DSL).
We show examples of how to name a state store further down below.
</p>
<p>
The <i>type</i> of a state store is defined by <code>QueryableStoreType</code>, and you can access the built-in types via the class <code>QueryableStoreTypes</code>.
Kafka Streams currently has two built-in types:
</p>
<ul>
<li>A key-value store <code>QueryableStoreTypes#keyValueStore()</code>, see <ahref="#streams_developer-guide_interactive-queries_local-key-value-stores">Querying local key-value stores</a>.</li>
<li>A window store <code>QueryableStoreTypes#windowStore()</code>, see <ahref="#streams_developer-guide_interactive-queries_local-window-stores">Querying local window stores</a>.</li>
</ul>
<p>
Both store types return <i>read-only</i> versions of the underlying state stores.
This read-only constraint is important to guarantee that the underlying state stores will never be mutated (e.g. new entries added) out-of-band, i.e. only the corresponding processing topology of Kafka Streams is allowed to mutate and update the state stores in order to ensure data consistency.
You can also implement your own <code>QueryableStoreType</code> as described in section <ahref="#streams_developer-guide_interactive-queries_custom-stores#"><b>Querying local custom stores</b></a>
<h4><aid="streams_developer-guide_interactive-queries_local-key-value-stores"href="#streams_developer-guide_interactive-queries_local-key-value-stores">Querying local key-value stores</a></h4>
<p>
To query a local key-value store, you must first create a topology with a key-value store:
<h4><aid="streams_developer-guide_interactive-queries_local-window-stores"href="#streams_developer-guide_interactive-queries_local-window-stores">Querying local window stores</a></h4>
<p>
A window store differs from a key-value store in that you will potentially have many results for any given key because the key can be present in multiple windows.
However, there will ever be at most one result per window for a given key.
</p>
<p>
To query a local window store, you must first create a topology with a window store:
<h4><aid="streams_developer-guide_interactive-queries_custom-stores"href="#streams_developer-guide_interactive-queries_custom-stores">Querying local custom state stores</a></h4>
<p>
Any custom state stores you use in your Kafka Streams applications can also be queried.
However there are some interfaces that will need to be implemented first:
</p>
<ol>
<li>Your custom state store must implement <code>StateStore</code>.</li>
<li>You should have an interface to represent the operations available on the store.</li>
<li>It is recommended that you also provide an interface that restricts access to read-only operations so users of this API can't mutate the state of your running Kafka Streams application out-of-band.</li>
// implementation of the supplier for MyCustomStore
}
</pre>
<p>
To make this store queryable you need to:
</p>
<ul>
<li>Provide an implementation of <code>QueryableStoreType</code>.</li>
<li>Provide a wrapper class that will have access to all of the underlying instances of the store and will be used for querying.</li>
</ul>
<p>
Implementing <code>QueryableStoreType</code> is straight forward:
</p>
<preclass="brush: java;">
public class MyCustomStoreType<K,V> implements QueryableStoreType<MyReadableCustomStore<K,V>> {
// Only accept StateStores that are of type MyCustomStore
public boolean accepts(final StateStore stateStore) {
return stateStore instanceOf MyCustomStore;
}
public MyReadableCustomStore<K,V> create(final StateStoreProvider storeProvider, final String storeName) {
return new MyCustomStoreTypeWrapper(storeProvider, storeName, this);
}
}
</pre>
<p>
A wrapper class is required because even a single instance of a Kafka Streams application may run multiple stream tasks and, by doing so, manage multiple local instances of a particular state store.
The wrapper class hides this complexity and lets you query a "logical" state store with a particular name without having to know about all of the underlying local instances of that state store.
</p>
<p>
When implementing your wrapper class you will need to make use of the <code>StateStoreProvider</code>
interface to get access to the underlying instances of your store.
<code>StateStoreProvider#stores(String storeName, QueryableStoreType<T> queryableStoreType)</code> returns a <code>List</code> of state stores with the given <code>storeName</code> and of the type as defined by <code>queryableStoreType</code>.
MyReadableCustomStore<String,String> store = streams.store("the-custom-store", new MyCustomStoreType<String,String>());
// Query the store
String value = store.read("key");
</pre>
<h4><aid="streams_developer-guide_interactive-queries_discovery"href="#streams_developer-guide_interactive-queries_discovery">Querying remote state stores (for the entire application)</a></h4>
<p>
Typically, the ultimate goal for interactive queries is not to just query locally available state stores from within an instance of a Kafka Streams application as described in the previous section.
Rather, you want to expose the application's full state (i.e. the state across all its instances) to other applications that might be running on different machines.
For example, you might have a Kafka Streams application that processes the user events in a multi-player video game, and you want to retrieve the latest status of each user directly from this application so that you can display it in a mobile companion app.
</p>
<p>
Three steps are needed to make the full state of your application queryable:
</p>
<ol>
<li>You must <ahref="#streams_developer-guide_interactive-queries_rpc-layer">add an RPC layer to your application</a> so that the instances of your application may be interacted with via the network -- notably to respond to interactive queries.
By design Kafka Streams does not provide any such RPC functionality out of the box so that you can freely pick your favorite approach: a REST API, Thrift, a custom protocol, and so on.</li>
<li>You need to <ahref="#streams_developer-guide_interactive-queries_expose-rpc">expose the respective RPC endpoints</a> of your application's instances via the <code>application.server</code> configuration setting of Kafka Streams.
Because RPC endpoints must be unique within a network, each instance will have its own value for this configuration setting.
This makes an application instance discoverable by other instances.</li>
<li> In the RPC layer, you can then <ahref="#streams_developer-guide_interactive-queries_discover-app-instances-and-stores">discover remote application instances</a> and their respective state stores (e.g. for forwarding queries to other app instances if an instance lacks the local data to respond to a query) as well as <ahref="#streams_developer-guide_interactive-queries_local-stores">query locally available state stores</a> (in order to directly respond to queries) in order to make the full state of your application queryable.</li>
<figcaptionstyle="text-align: center;"><i>Discover any running instances of the same application as well as the respective RPC endpoints they expose for interactive queries</i></figcaption>
</figure>
<h4><aid="streams_developer-guide_interactive-queries_rpc-layer"href="#streams_developer-guide_interactive-queries_rpc-layer">Adding an RPC layer to your application</a></h4>
<p>
As Kafka Streams doesn't provide an RPC layer you are free to choose your favorite approach.
There are many ways of doing this, and it will depend on the technologies you have chosen to use.
The only requirements are that the RPC layer is embedded within the Kafka Streams application and that it exposes an endpoint that other application instances and applications can connect to.
</p>
<h4><aid="streams_developer-guide_interactive-queries_expose-rpc"href="#streams_developer-guide_interactive-queries_expose-rpc">Exposing the RPC endpoints of your application</a></h4>
<p>
To enable the remote discovery of state stores running within a (typically distributed) Kafka Streams application you need to set the <code>application.server</code> configuration property in <code>StreamsConfig</code>.
The <code>application.server</code> property defines a unique <code>host:port</code> pair that points to the RPC endpoint of the respective instance of a Kafka Streams application.
It's important to understand that the value of this configuration property varies across the instances of your application.
When this property is set, then, for every instance of an application, Kafka Streams will keep track of the instance's RPC endpoint information, its state stores, and assigned stream partitions through instances of <code>StreamsMetadata</code>
</p>
<p>
Below is an example of configuring and running a Kafka Streams application that supports the discovery of its state stores.
</p>
<preclass="brush: java;">
Properties props = new Properties();
// Set the unique RPC endpoint of this application instance through which it
// can be interactively queried. In a real application, the value would most
// probably not be hardcoded but derived dynamically.
// Then, create and start the actual RPC service for remote access to this
// application instance's local state stores.
//
// This service should be started on the same host and port as defined above by
// the property `StreamsConfig.APPLICATION_SERVER_CONFIG`. The example below is
// fictitious, but we provide end-to-end demo applications (such as KafkaMusicExample)
// that showcase how to implement such a service to get you started.
MyRPCService rpcService = ...;
rpcService.listenAt(rpcEndpoint);
</pre>
<h4><aid="streams_developer-guide_interactive-queries_discover-app-instances-and-stores"href="#streams_developer-guide_interactive-queries_discover-app-instances-and-stores">Discovering and accessing application instances and their respective local state stores</a></h4>
<p>
With the <code>application.server</code> property set, we can now find the locations of remote app instances and their state stores.
The following methods return <code>StreamsMetadata</code> objects, which provide meta-information about application instances such as their RPC endpoint and locally available state stores.
</p>
<ul>
<li><code>KafkaStreams#allMetadata()</code>: find all instances of this application</li>
<li><code>KafkaStreams#allMetadataForStore(String storeName)</code>: find those applications instances that manage local instances of the state store "storeName"</li>
<li><code>KafkaStreams#metadataForKey(String storeName, K key, Serializer<K> keySerializer)</code>: using the default stream partitioning strategy, find the one application instance that holds the data for the given key in the given state store</li>
<li><code>KafkaStreams#metadataForKey(String storeName, K key, StreamPartitioner<K, ?> partitioner)</code>: using <code>>partitioner</code>, find the one application instance that holds the data for the given key in the given state store</li>
</ul>
<p>
If <code>application.server</code> is not configured for an application instance, then the above methods will not find any <code>StreamsMetadata</code> for it.
</p>
<p>
For example, we can now find the <code>StreamsMetadata</code> for the state store named "word-count" that we defined in the code example shown in the previous section:
</p>
<preclass="brush: java;">
KafkaStreams streams = ...;
// Find all the locations of local instances of the state store named "word-count"
At this point the full state of the application is interactively queryable:
</p>
<ul>
<li>We can discover the running instances of the application as well as the state stores they manage locally.</li>
<li>Through the RPC layer that was added to the application, we can communicate with these application instances over the network and query them for locally available state</li>
<li>The application instances are able to serve such queries because they can directly query their own local state stores and respond via the RPC layer</li>
<li>Collectively, this allows us to query the full state of the entire application</li>
<h4><aid="streams_developer-guide_memory-management_record-cache"href="#streams_developer-guide_memory-management_record-cache">Record caches in the DSL</a></h4>
<p>
Developers of an application using the DSL have the option to specify, for an instance of a processing topology, the
total memory (RAM) size of a record cache that is leveraged by the following <code>KTable</code> instances:
</p>
<ol>
<li>Source <code>KTable</code>, i.e. <code>KTable</code> instances that are created via <code>StreamBuilder#table()</code> or <code>StreamBuilder#globalTable()</code>.</li>
<li>Aggregation <code>KTable</code>, i.e. instances of <code>KTable</code> that are created as a result of aggregations</li>
</ol>
<p>
For such <code>KTable</code> instances, the record cache is used for:
</p>
<ol>
<li>Internal caching and compacting of output records before they are written by the underlying stateful processor node to its internal state store.</li>
<li>Internal caching and compacting of output records before they are forwarded from the underlying stateful processor node to any of its downstream processor nodes</li>
</ol>
<p>
Here is a motivating example:
</p>
<ul>
<li>Imagine the input is a <code>KStream<String, Integer></code> with the records <code><A, 1>, <D, 5>, <A, 20>, <A, 300></code>.
Note that the focus in this example is on the records with key == <code>A</code>
</li>
<li>
An aggregation computes the sum of record values, grouped by key, for the input above and returns a <code>KTable<String, Integer></code>.
<ul>
<li><b>Without caching</b>, what is emitted for key <code>A</code> is a sequence of output records that represent changes in the
resulting aggregation table (here, the parentheses denote changes, where the left and right numbers denote the new
aggregate value and the previous aggregate value, respectively):
This parameter controls the number of bytes allocated for caching.
Specifically, for a processor topology instance with <code>T</code> threads and <code>C</code> bytes allocated for caching,
each thread will have an even <code>C/T</code> bytes to construct its own cache and use as it sees fit among its tasks.
I.e., there are as many caches as there are threads, but no sharing of caches across threads happens.
The basic API for the cache is made of <code>put()</code> and <code>get()</code> calls.
Records are evicted using a simple LRU scheme once the cache size is reached.
The first time a keyed record <code>R1 = <K1, V1></code> finishes processing at a node, it is marked as dirty in the cache.
Any other keyed record <code>R2 = <K1, V2></code> with the same key <code>K1</code> that is processed on that node during that time will overwrite <code><K1, V1></code>, which we also refer to as "being compacted".
Note that this has the same effect as <ahref="https://kafka.apache.org/documentation.html#compaction">Kafka's log compaction</a>, but happens (a) earlier, while the
records are still in memory, and (b) within your client-side application rather than on the server-side aka the Kafka broker.
Upon flushing <code>R2</code> is (1) forwarded to the next processing node and (2) written to the local state store.
</p>
<p>
The semantics of caching is that data is flushed to the state store and forwarded to the next downstream processor node
whenever the earliest of <code>commit.interval.ms</code> or <code>cache.max.bytes.buffering</code> (cache pressure) hits.
Both <code>commit.interval.ms</code> and <code>cache.max.bytes.buffering</code> are <b>global</b> parameters: they apply to all processor nodes in
the topology, i.e., it is not possible to specify different parameters for each node.
Below we provide some example settings for both parameters based on desired scenarios.
</p>
<p>To turn off caching the cache size can be set to zero:</p>
<preclass="brush: java;">
// Disable record cache
Properties streamsConfiguration = new Properties();
The illustration below shows the effect of these two configurations visually.
For simplicity we have records with 4 keys: blue, red, yellow and green. Without loss of generality, let's assume the cache has space for only 3 keys.
When the cache is disabled, we observer that all the input records will be output. With the cache enabled, we make the following observations.
First, most records are output at the end of a commit intervals (e.g., at <code>t1</code> one blue records is output, which is the final over-write of the blue key up to that time).
Second, some records are output because of cache pressure, i.e. before the end of a commit interval (cf. the red record right before t2).
With smaller cache sizes we expect cache pressure to be the primary factor that dictates when records are output. With large cache sizes, the commit interval will be the primary factor.
Third, the number of records output has been reduced (here: from 15 to 8).
<h4><aid="streams_developer-guide_memory-management_state-store-cache"href="#streams_developer-guide_memory-management_state-store-cache">State store caches in the Processor API</a></h4>
<p>
Developers of a Kafka Streams application using the Processor API have the option to specify, for an instance of a
processing topology, the total memory (RAM) size of the <i>state store cache</i> that is used for:
</p>
<ul><li>Internal <i>caching and compacting</i> of output records before they are written from a <b>stateful</b> processor node to its state stores.</li></ul>
<p>
Note that, unlike <ahref="#streams_developer-guide_memory-management_record-cache">record caches</a> in the DSL, the state
store cache in the Processor API <i>will not cache or compact</i> any output records that are being forwarded downstream.
In other words, downstream processor nodes see all records, whereas the state stores see a reduced number of records.
It is important to note that this does not impact correctness of the system but is merely a performance optimization
for the state stores.
</p>
<p>
A note on terminology: we use the narrower term <i>state store caches</i> when we refer to the Processor API and the
broader term <i>record caches</i> when we are writing about the DSL.
We made a conscious choice to not expose the more general record caches to the Processor API so that we keep it simple and flexible.
For example, developers of the Processor API might chose to store a record in a state store while forwarding a different value downstream, i.e., they
might not want to use the unified record cache for both state store and forwarding downstream.
<h3><aid="streams_configure_execute"href="#streams_configure_execute">Application Configuration and Execution</a></h3>
<p>
Besides defining the topology, developers will also need to configure their applications
in <code>StreamsConfig</code> before running it. A complete list of
Kafka Streams configs can be found <ahref="/{{version}}/documentation/#streamsconfigs"><b>here</b></a>.
Note, that different parameters do have different "levels of importance", with the following interpretation:
</p>
<ul>
<li> HIGH: you would most likely change the default value if you go to production </li>
<li> MEDIUM: default value might be ok, but you should double-check it </li>
<li> LOW: default value is most likely ok; only consider to change it if you hit an issues when running in production </li>
</ul>
<p>
Specifying the configuration in Kafka Streams is similar to the Kafka Producer and Consumer clients. Typically, you create a <code>java.util.Properties</code> instance,
set the necessary parameters, and construct a <code>StreamsConfig</code> instance from the <code>Properties</code> instance.
Apart from Kafka Streams' own configuration parameters you can also specify parameters for the Kafka consumers and producers that are used internally,
depending on the needs of your application. Similar to the Streams settings you define any such consumer and/or producer settings via <code>StreamsConfig</code>.
Note that some consumer and producer configuration parameters do use the same parameter name. For example, <code>send.buffer.bytes</code> or <code>receive.buffer.bytes</code> which
are used to configure TCP buffers; <code>request.timeout.ms</code> and <code>retry.backoff.ms</code> which control retries for client request (and some more).
If you want to set different values for consumer and producer for such a parameter, you can prefix the parameter name with <code>consumer.</code> or <code>producer.</code>:
</p>
<preclass="brush: java;">
Properties settings = new Properties();
// Example of a "normal" setting for Kafka Streams
Introduced in 0.11.0 is a new broker config that is particularly relevant to Kafka Streams applications, <code>group.initial.rebalance.delay.ms</code>.
This config specifies the time, in milliseconds, that the <code>GroupCoordinator</code> will delay the initial consumer rebalance.
The rebalance will be further delayed by the value of <code>group.initial.rebalance.delay.ms</code> as each new member joins the consumer group, up to a maximum of the value set by <code>max.poll.interval.ms</code>.
The net benefit is that this should reduce the overall startup time for Kafka Streams applications with more than one thread.
The default value for <code>group.initial.rebalance.delay.ms</code> is 3 seconds.
</p>
<p>
In practice this means that if you are starting up your Kafka Streams app from a cold start, then when the first member joins the group there will be at least a 3 second delay before it is assigned any tasks.
If any other members join the group within the initial 3 seconds, then there will be a further 3 second delay.
Once no new members have joined the group within the 3 second delay, or <code>max.poll.interval.ms</code> is reached, then the group rebalance can complete and all current members will be assigned tasks.
The benefit of this approach, particularly for Kafka Streams applications, is that we can now delay the assignment and re-assignment of potentially expensive tasks as new members join.
So we can avoid the situation where one instance is assigned all tasks, begins restoring/processing, only to shortly after be rebalanced, and then have to start again with half of the tasks and so on.
Kafka Streams automatically creates internal repartitioning and changelog topics.
You can override the default configs used when creating these topics by adding any configs from <code>TopicConfig</code> to your <code>StreamsConfig</code> with the prefix <code>StreamsConfig.TOPIC_PREFIX</code>:
</p>
<preclass="brush: java;">
Properties settings = new Properties();
// Example of a "normal" setting for Kafka Streams
The first argument of the <code>KafkaStreams</code> constructor takes an instance of <code>Topology</code>.
This topology can be either created directly following the <code>Processor</code> API or implicitly via the <code>StreamsBuilder</code> in the higher-level Streams DSL.
At this point, internal structures have been initialized, but the processing is not started yet. You have to explicitly start the Kafka Streams thread by calling the <code>start()</code> method:
</p>
<preclass="brush: java;">
// Start the Kafka Streams instance
streams.start();
</pre>
<p>
To catch any unexpected exceptions, you may set an <code>java.lang.Thread.UncaughtExceptionHandler</code> before you start the application. This handler is called whenever a stream thread is terminated by an unexpected exception:
// here you should examine the exception and perform an appropriate action!
}
);
</pre>
<p>
To stop the application instance call the <code>close()</code> method:
</p>
<preclass="brush: java;">
// Stop the Kafka Streams instance
streams.close();
</pre>
Now it's time to execute your application that uses the Kafka Streams library, which can be run just like any other Java application - there is no special magic or requirement on the side of Kafka Streams.
For example, you can package your Java application as a fat jar file and then start the application via:
<preclass="brush: bash;">
# Start the application in class `com.example.MyStreamsApp`
# from the fat jar named `path-to-app-fatjar.jar`.
When the application instance starts running, the defined processor topology will be initialized as one or more stream tasks that can be executed in parallel by the stream threads within the instance.
If the processor topology defines any state stores, these state stores will also be (re-)constructed, if possible, during the initialization
period of their associated stream tasks.
It is important to understand that, when starting your application as described above, you are actually launching what Kafka Streams considers to be one instance of your application.
More than one instance of your application may be running at a time, and in fact the common scenario is that there are indeed multiple instances of your application running in parallel (e.g., on another JVM or another machine).
In such cases, Kafka Streams transparently re-assigns tasks from the existing instances to the new instance that you just started.
See <ahref="/{{version}}/documentation/streams/architecture#streams_architecture_tasks"><b>Stream Partitions and Tasks</b></a> and <ahref="/{{version}}/documentation/streams/architecture#streams_architecture_threads"><b>Threading Model</b></a> for details.
