From MQTT to SQL: A Practical Guide to Sensor Data Ingestion

Every developer who's built an IoT pipeline has hit this wall: the code that worked beautifully with ten sensors publishing once per second collapses under production load. Your database starts lagging, the message queue backs up, and suddenly you're troubleshooting at 2 AM trying to figure out why 5000 devices at 1Hz brought everything to its knees. 5000 devices at 1Hz brought everything to its knees 5000 devices at 1Hz brought everything to its knees Your code is fine. The broker config is fine. The architecture isn't. MQTT streams data continuously; SQL databases thrive on batched writes. Most tutorials gloss over this fundamental mismatch, and you discover it the hard way when you scale. MQTT MQTT This article walks you through the fundamentals of building an MQTT-to-TimescaleDB pipeline: why the per-message insert approach fails under load, the schema foundations that enable batched writes, how to implement time-window batching that keeps pace with your sensors, and how to handle common edge cases like graceful shutdown, duplicates, malformed messages, and back-pressure. The focus is on the ingestion pipeline (ensuring sensor data reliably reaches TimescaleDB at scale). For schema design and data exploration, see Building a Data Pipeline. For query optimization techniques (indexing, continuous aggregates, compression tuning), see Optimizing for High-Volume Production Data. TimescaleDB TimescaleDB The focus is on the ingestion pipeline Building a Data Pipeline Building a Data Pipeline Optimizing for High-Volume Production Data Optimizing for High-Volume Production Data The Per-Message Insert Trap The per-message insert pattern fails at scale, and the failure is predictable. Each individual INSERT opens a transaction and forces a filesystem sync through the WAL. At low rates, this overhead barely registers. At thousands of messages per second, your database spends more time managing transactions than storing data. INSERT WAL WAL The symptoms are consistent across deployments: queue depth grows, write latency climbs from single-digit milliseconds to tens or hundreds, and eventually connection pools exhaust themselves. The demo benchmarks later in this article quantify the problem precisely by simulating 500 devices at 10Hz, which shows the per-message pattern processing less than 5% of the incoming message rate, while the remaining 95% accumulates in the broker. PostgreSQL isn't the bottleneck. You're fighting a structural mismatch: MQTT delivers streams, SQL expects batches. The subscribe-insert-repeat pattern works fine in development because low throughput masks the architectural problem. Production exposes it immediately. The root cause matters because it points to the solution. Batching is the foundational requirement that makes your pipeline viable at production scale. Before you can implement effective batching, though, you need a schema designed for the write patterns it will generate. Hypertable Schema for Sensor Streams Companion Repository: The complete working implementation is available in the companion GitHub repository, which includes the schema definitions, ingestion scripts, and benchmark experiments referenced throughout this article. Companion Repository companion GitHub repository The schema in db/schema.sql creates the table, converts it to a hypertable, and adds a unique index for deduplication, optimized for time-series writes at scale: db/schema.sql hypertable hypertable -- Create the base table with sensor reading structure CREATE TABLE sensor_readings ( ts TIMESTAMPTZ NOT NULL, device_id VARCHAR(64) NOT NULL, metric_type VARCHAR(32) NOT NULL, value DOUBLE PRECISION NOT NULL ); -- Convert to hypertable with 1-day chunk interval SELECT create_hypertable('sensor_readings', 'ts', chunk_time_interval => INTERVAL '1 day'); -- Create unique index for deduplication and query acceleration CREATE UNIQUE INDEX idx_readings_dedup ON sensor_readings (ts, device_id, metric_type); -- Create the base table with sensor reading structure CREATE TABLE sensor_readings ( ts TIMESTAMPTZ NOT NULL, device_id VARCHAR(64) NOT NULL, metric_type VARCHAR(32) NOT NULL, value DOUBLE PRECISION NOT NULL ); -- Convert to hypertable with 1-day chunk interval SELECT create_hypertable('sensor_readings', 'ts', chunk_time_interval => INTERVAL '1 day'); -- Create unique index for deduplication and query acceleration CREATE UNIQUE INDEX idx_readings_dedup ON sensor_readings (ts, device_id, metric_type); The narrow four-column design keeps the schema flexible: the metric_type column acts as a discriminator, so temperature, humidity, pressure, and any other metric share the same table without schema changes. The 1-day chunk interval used in our demo suits high-throughput pipelines, but the right value depends on your write volume and query patterns. See the TimescaleDB docs on improving query performance for guidance on tuning chunk intervals for your workload. TimescaleDB docs on improving query performance TimescaleDB docs on improving query performance Indexing strategy for write-heavy workloads Every index adds overhead to every INSERT, so restraint is critical during the ingestion-tuning phase. Start minimal with a single unique index that serves double duty: INSERT -- Create unique index for deduplication and query acceleration CREATE UNIQUE INDEX idx_readings_dedup ON sensor_readings (ts, device_id, metric_type); -- Create unique index for deduplication and query acceleration CREATE UNIQUE INDEX idx_readings_dedup ON sensor_readings (ts, device_id, metric_type); This index accelerates query filtering by device and time and enables efficient deduplication strategies during batch ingestion. The combination of these three columns uniquely identifies each reading. The database can then detect and handle duplicates automatically. and Once your ingestion pipeline is stable and read patterns emerge, composite indexes are essential for query performance. For example, an index like (device_id, ts DESC) dramatically improves device-specific time-range queries. During the ingestion-tuning phase, however, restraint is critical: premature indexing on a write-heavy table borrows performance from your ingestion pipeline to pay for queries you haven't written yet. For detailed indexing strategies, see Optimizing for High-Volume Production Data. Once your ingestion pipeline is stable and read patterns emerge, composite indexes are essential for query performance. (device_id, ts DESC) Optimizing for High-Volume Production Data Optimizing for High-Volume Production Data Compression for long-term storage Hypercore is TimescaleDB’s columnar compression engine that reduces storage for time-series data. For this tutorial, compression is optional, since it requires at least 7 days of data to demonstrate. In production, though, some high-frequency pipelines compress data as early as every 3 days. The key is to compress chunks older than your “hot” query window; the time range your dashboards and real-time analytics actively query. Adjust based on your query patterns and storage budget. Hypercore Hypercore TimescaleDB’s columnar compression engine TimescaleDB’s columnar compression engine The key is to compress chunks older than your “hot” query window With the schema in place, the next challenge is getting data into it efficiently, replacing per-message inserts with a batching strategy that matches your pipeline’s throughput. Batching Strategies That Actually Work Time-window batching is the most practical approach for MQTT-to-SQL pipelines. The concept: buffer incoming messages in memory and flush the entire buffer to the database at a fixed interval, regardless of how many messages have accumulated. This gives you a predictable write cadence. Instead of thousands of individual INSERTs per second, your database handles one bulk write every few seconds. This transforms transaction overhead from a per-message cost to a per-batch cost. buffer incoming messages in memory and flush the entire buffer to the database at a fixed interval, regardless of how many messages have accumulated INSERT The architecture The ingestion script runs two concurrent activities: an MQTT callback that buffers messages as they arrive, and a timer-based flush loop that writes the buffer to TimescaleDB. The MQTT callback does one thing: append to an in-memory list. No database connection, no transaction, no I/O. def on_message(client, userdata, message, properties=None): try: payload = json.loads(message.payload.decode()) with buffer_lock: buffer.append(( payload['ts'], payload['device_id'], payload['metric'], payload['value'], )) except Exception as e: print(f" Error:{e}") def on_message(client, userdata, message, properties=None): try: payload = json.loads(message.payload.decode()) with buffer_lock: buffer.append(( payload['ts'], payload['device_id'], payload['metric'], payload['value'], )) except Exception as e: print(f" Error:{e}") Separating message receipt from database writes is the critical design decision. It prevents slow database operations from creating back-pressure on the MQTT client. Separating message receipt from database writes Thread safety The MQTT client library runs callbacks on its own thread. The flush loop runs on the main thread. Both access the shared buffer, so thread safety is non-negotiable. A lock-per-flush-cycle pattern keeps the critical section minimal: # Copy buffer under lock with buffer_lock: if not buffer: return batch = buffer[:] buffer.clear() # Flush outside lock (I/O doesn't block message receipt) batch_write(batch) # Copy buffer under lock with buffer_lock: if not buffer: return batch = buffer[:] buffer.clear() # Flush outside lock (I/O doesn't block message receipt) batch_write(batch) The lock is held only for the microseconds it takes to copy and clear the list. The actual database write, which might take tens of milliseconds, happens outside the lock. The result: the MQTT callback is never blocked waiting for a database operation to complete. The flush operation The batch write uses PostgreSQL’s COPY protocol for maximum throughput, combined with a temporary staging table to handle deduplication: COPY def batch_write(rows): conn = get_connection() try: with conn.cursor() as cur: # 1. Create temp table (auto-dropped on commit) cur.execute( "CREATE TEMP TABLE tmp_ingest " "(LIKE sensor_readings INCLUDING DEFAULTS) ON COMMIT DROP" ) # 2. Stream data into temp table (fastest possible write) with cur.copy( "COPY tmp_ingest (ts, device_id, metric_type, value) FROM STDIN" ) as copy: for row in rows: copy.write_row(row) # 3. Merge into hypertable with deduplication cur.execute(""" INSERT INTO sensor_readings (ts, device_id, metric_type, value) SELECT ts, device_id, metric_type, value FROM tmp_ingest ON CONFLICT (ts, device_id, metric_type) DO NOTHING """) conn.commit() return len(rows) except Exception as e: conn.rollback() raise def batch_write(rows): conn = get_connection() try: with conn.cursor() as cur: # 1. Create temp table (auto-dropped on commit) cur.execute( "CREATE TEMP TABLE tmp_ingest " "(LIKE sensor_readings INCLUDING DEFAULTS) ON COMMIT DROP" ) # 2. Stream data into temp table (fastest possible write) with cur.copy( "COPY tmp_ingest (ts, device_id, metric_type, value) FROM STDIN" ) as copy: for row in rows: copy.write_row(row) # 3. Merge into hypertable with deduplication cur.execute(""" INSERT INTO sensor_readings (ts, device_id, metric_type, value) SELECT ts, device_id, metric_type, value FROM tmp_ingest ON CONFLICT (ts, device_id, metric_type) DO NOTHING """) conn.commit() return len(rows) except Exception as e: conn.rollback() raise We use the COPY protocol because it is the fastest way to load data into PostgreSQL. However, COPY doesn’t support ON CONFLICT, so you can’t deduplicate inline. To achieve both maximum speed and safe deduplication, we first stream data into a temporary staging table. Once staged, we move the data to the final hypertable using INSERT ... SELECT ... ON CONFLICT DO NOTHING, which efficiently filters out duplicates. The temporary table is configured with ON COMMIT DROP, ensuring zero cleanup overhead. COPY protocol COPY protocol COPY ON CONFLICT INSERT ... SELECT ... ON CONFLICT DO NOTHING ON COMMIT DROP Running the demo The companion repository includes a unified demo script that compares per-message and batched approaches side-by-side. Run it to see the performance difference on your hardware: companion repository uv run src/per-message-insert.py uv run src/per-message-insert.py This script runs per-message (naive) ingestion for 15 seconds, then batched ingestion for 15 seconds, and displays a comparison. The demo simulates 5,000 devices publishing at 1Hz (5,000 messages/second total), a realistic plant floor scenario, with a 5-second flush interval for batched writes. Here’s the output from a typical run: Metric Per-message Batched Stored at T=15s 2,090 / 75,000 (2.8%) 75,000 / 75,000 (100%) Queue backlog 72,910 (growing ~4,861/s) 0 Throughput (msg/s) 139.3 4,999.7 Avg write latency (ms) 6.87 328.32 Metric Per-message Batched Stored at T=15s 2,090 / 75,000 (2.8%) 75,000 / 75,000 (100%) Queue backlog 72,910 (growing ~4,861/s) 0 Throughput (msg/s) 139.3 4,999.7 Avg write latency (ms) 6.87 328.32 Metric Per-message Batched Metric Metric Per-message Per-message Batched Batched Stored at T=15s 2,090 / 75,000 (2.8%) 75,000 / 75,000 (100%) Stored at T=15s Stored at T=15s 2,090 / 75,000 (2.8%) 2,090 / 75,000 (2.8%) 75,000 / 75,000 (100%) 75,000 / 75,000 (100%) Queue backlog 72,910 (growing ~4,861/s) 0 Queue backlog Queue backlog 72,910 (growing ~4,861/s) 72,910 (growing ~4,861/s) 0 0 Throughput (msg/s) 139.3 4,999.7 Throughput (msg/s) Throughput (msg/s) 139.3 139.3 4,999.7 4,999.7 Avg write latency (ms) 6.87 328.32 Avg write latency (ms) Avg write latency (ms) 6.87 6.87 328.32 328.32 The difference is stark. The per-message approach managed 139 msg/s, just 2.8% of the incoming rate, while its backlog grew by ~4,861 msg/s with no hope of recovery. The batched approach sustained the full 5,000 msg/s with zero backlog. The COPY + temp table pattern converts thousands of individual transactions into one bulk write per flush cycle, and that single change is the difference between a pipeline that drowns and one that keeps pace. COPY Results will vary based on your hardware. Adjust parameters in the .env file to experiment with different sensor counts, publish rates, and flush intervals. .env Keep in mind that this demo uses synthetic sensor data and a simplified ingestion pipeline to illustrate the core batching concepts. Production deployments involve additional complexity like network variability, heterogeneous device types, authentication, TLS encryption, and operational monitoring. The patterns demonstrated here form the foundation, but production systems require the edge case handling covered in the next section. synthetic sensor data and a simplified ingestion pipeline Tuning guidance The flush interval is your primary tuning knob. Shorter intervals (1–2 seconds) reduce end-to-end latency but increase the number of database operations. Longer intervals (5–10 seconds) maximize batch size and write efficiency but add latency to your data pipeline. Start with a 5-second interval and measure two metrics: flush latency (how long each batch write takes) and queue depth (how many messages wait in the buffer between flushes). If flush latency approaches your flush interval, your batches are too large; shorten the interval or scale horizontally. If queue depth consistently grows, your database can’t sustain the aggregate write load. 5-second interval flush latency queue depth One trade-off to be aware of: time-window batching produces variable batch sizes. During high-traffic periods, batches are large and efficient. During quiet periods, you might flush only a handful of messages, which creates a small latency spike for what amounts to a near-empty batch. For most sensor workloads with consistent publish rates, this is rarely an issue, but if your traffic is highly variable, consider hybrid strategies that combine time-based and size-based triggers. Batching solves the throughput problem, but production pipelines encounter failures that the happy path never surfaces. Handling those failures without losing data is what separates a demo from a deployment. Handling the Edge Cases Production MQTT pipelines fail in predictable ways. The only question is whether your pipeline handles them or silently drops data. The tutorial repository includes dedicated experiment scripts for each edge case, allowing you to observe the failure modes and their solutions. Graceful shutdown When your ingestion process receives a termination signal (deployment, restart, scaling event), messages sit in the buffer waiting for the next flush cycle. Without explicit handling, those messages vanish. The batching implementation covered earlier already includes signal handlers that flush the buffer before exit. To see the impact in isolation, run the graceful shutdown experiment: uv run src/experiments/graceful-shutdown.py uv run src/experiments/graceful-shutdown.py This script runs two parallel ingestion processes: one with signal handlers, one without—then prompts you to interrupt both with Ctrl+C. Ctrl+C The results are stark: with a 30-second flush interval at 5,000 msg/s, the process without graceful shutdown loses all ~50,000 buffered messages (0% success rate), while the process with signal handlers flushes the buffer on exit and achieves 100% recovery. The lesson: implementing graceful shutdown is a few lines of code that prevent meaningful data loss on every deployment event. implementing graceful shutdown is a few lines of code that prevent meaningful data loss on every deployment event. Duplicate handling MQTT QoS 1 guarantees at-least-once delivery, which means your subscriber will occasionally receive the same message twice. Network retries and broker failovers compound the problem. The unique index on (ts, device_id, metric_type) combined with deduplication logic makes every insert idempotent, which was covered in the schema section. To verify this behavior in isolation, run the duplicate handling experiment: (ts, device_id, metric_type) uv run src/experiments/duplicate-handling.py uv run src/experiments/duplicate-handling.py This script sends 1,000 unique messages, then deliberately resends 500 of them. The experiment compares two tables: one without a unique constraint (stores all 1,500 rows including duplicates), and one with the constraint (stores exactly 1,000 rows, silently discarding the 500 duplicates). Key takeaway: this pattern makes your ingestion safe to retry from any failure point without creating duplicate data. this pattern makes your ingestion safe to retry from any failure point without creating duplicate data. Error recovery: the poison pill problem A single malformed message in a batch can crash your entire write operation. The database rejects the whole batch, and you lose every valid message alongside the bad one. The defensive pattern: attempt the batch write, and on failure, fall back to row-by-row insertion to isolate the offending record: try: batch_write(batch) except Exception: # Batch failed - fall back to row-by-row to isolate bad data for row in batch: try: single_write(row) except Exception: sideline_bad_message(row) # Log for investigation try: batch_write(batch) except Exception: # Batch failed - fall back to row-by-row to isolate bad data for row in batch: try: single_write(row) except Exception: sideline_bad_message(row) # Log for investigation This approach preserves valid messages while sidelining the “poison pill” for later investigation. The trade-off is performance: row-by-row insertion is slower, but it only activates when a batch fails, which keeps the happy path fast. Run the error recovery experiment to see this in action: uv run src/experiments/error-recovery.py uv run src/experiments/error-recovery.py The script sends 200 valid messages plus 1 poison pill in a single batch. The naive approach (no error handling) drops all 201 messages, a 0% success rate. The lesson: the defensive approach (row-by-row fallback) saves all 200 valid messages, losing only the single bad record, a 100% success rate for valid data. the defensive approach (row-by-row fallback) saves all 200 valid messages, losing only the single bad record, a 100% success rate for valid data. Back-pressure and horizontal scaling When your sensor data rate exceeds what a single consumer can sustain, queue depth grows indefinitely, regardless of how fast your write protocol is. The COPY + temp table pattern from the flush section is one of the fastest single-connection write paths available. The bottleneck at extreme scale isn’t the database write; it’s that a single MQTT client can’t subscribe fast enough to keep up with the incoming message rate. COPY Recognizing the problem: Run the back-pressure overload experiment to see the breaking point: Recognizing the problem: uv run src/experiments/back-pressure-overload.py uv run src/experiments/back-pressure-overload.py This script runs three phases with increasing load (1k, 5k, 30k msg/s). Here’s the output: Load phase Messages sent Messages processed Efficiency Queue depth 1k msg/s (1,000 devices) 24,700 24,700 100.0% 0 5k msg/s (5,000 devices) 131,800 131,798 100.0% 2 30k msg/s (30,000 devices) 1,008,000 665,905 66.1% 342,095 Load phase Messages sent Messages processed Efficiency Queue depth 1k msg/s (1,000 devices) 24,700 24,700 100.0% 0 5k msg/s (5,000 devices) 131,800 131,798 100.0% 2 30k msg/s (30,000 devices) 1,008,000 665,905 66.1% 342,095 Load phase Messages sent Messages processed Efficiency Queue depth Load phase Load phase Messages sent Messages sent Messages processed Messages processed Efficiency Efficiency Queue depth Queue depth 1k msg/s (1,000 devices) 24,700 24,700 100.0% 0 1k msg/s (1,000 devices) 1k msg/s (1,000 devices) 24,700 24,700 24,700 24,700 100.0% 100.0% 0 0 5k msg/s (5,000 devices) 131,800 131,798 100.0% 2 5k msg/s (5,000 devices) 5k msg/s (5,000 devices) 131,800 131,800 131,798 131,798 100.0% 100.0% 2 2 30k msg/s (30,000 devices) 1,008,000 665,905 66.1% 342,095 30k msg/s (30,000 devices) 30k msg/s (30,000 devices) 1,008,000 1,008,000 665,905 665,905 66.1% 66.1% 342,095 342,095 At 1k and 5k msg/s, the batching pattern handles the load with 100% efficiency. At 30k msg/s, it breaks: queue depth explodes to 342,095 messages. The single consumer can't subscribe fast enough, even though each batch write completes well within the flush interval. Since the bottleneck is the MQTT client’s subscription throughput, a potential solution is to implement horizontal scaling via topic-based partitioning. Each consumer gets its own partition of the topic space, its own MQTT client connection, and its own database connection, running the same COPY pattern we used before. Since the bottleneck is the MQTT client’s subscription throughput, a potential solution is to implement horizontal scaling via topic-based partitioning The scaling experiment demonstrates this: uv run src/experiments/back-pressure-scaling.py uv run src/experiments/back-pressure-scaling.py The script spawns 3 consumer processes (configurable via EXPERIMENT_CONSUMER_COUNT). Here’s the output: EXPERIMENT_CONSUMER_COUNT Load phase Messages sent Messages processed Efficiency Queue depth 1k msg/s (1,000 devices) 24,700 24,700 100.0% 0 5k msg/s (5,000 devices) 131,800 131,798 100.0% 2 30k msg/s (30,000 devices) 1,008,000 665,905 66.1% 342,095 Load phase Messages sent Messages processed Efficiency Queue depth 1k msg/s (1,000 devices) 24,700 24,700 100.0% 0 5k msg/s (5,000 devices) 131,800 131,798 100.0% 2 30k msg/s (30,000 devices) 1,008,000 665,905 66.1% 342,095 Load phase Messages sent Messages processed Efficiency Queue depth Load phase Load phase Messages sent Messages sent Messages processed Messages processed Efficiency Efficiency Queue depth Queue depth 1k msg/s (1,000 devices) 24,700 24,700 100.0% 0 1k msg/s (1,000 devices) 1k msg/s (1,000 devices) 24,700 24,700 24,700 24,700 100.0% 100.0% 0 0 5k msg/s (5,000 devices) 131,800 131,798 100.0% 2 5k msg/s (5,000 devices) 5k msg/s (5,000 devices) 131,800 131,800 131,798 131,798 100.0% 100.0% 2 2 30k msg/s (30,000 devices) 1,008,000 665,905 66.1% 342,095 30k msg/s (30,000 devices) 30k msg/s (30,000 devices) 1,008,000 1,008,000 665,905 665,905 66.1% 66.1% 342,095 342,095 Efficiency jumps from 66.1% (single consumer) to 100.0% (3 consumers). The foundation hasn’t changed: each consumer runs the same COPY + temp table pattern that handled 5k msg/s in the main demo. Scaling works because the batching architecture is sound; you’re distributing the subscription load, not reinventing the write path. Each additional consumer adds ~16k msg/s capacity, so scaling is near-linear, but it comes with operational cost: more processes to deploy, more database connections to manage, and partition logic to maintain. COPY because Alternative back-pressure strategies Horizontal scaling is not a silver bullet, nor your only option. Also consider these alternative strategies: Adaptive flush intervals: Shorten the flush interval when queue depth grows, increasing write frequency to drain the backlog faster Flow control: Implement MQTT back-pressure by pausing the subscriber when the queue depth exceeds a threshold so the database can catch up Vertical scaling: Tune PostgreSQL configuration (shared_buffers, max_wal_size, checkpoint_timeout) to handle higher write loads Database connection pooling: Use psycopg_pool.ConnectionPool instead of single connections for better concurrency under load Batch size limits: Cap batch sizes to prevent memory exhaustion and keep flush latency predictable Adaptive flush intervals: Shorten the flush interval when queue depth grows, increasing write frequency to drain the backlog faster Adaptive flush intervals Flow control: Implement MQTT back-pressure by pausing the subscriber when the queue depth exceeds a threshold so the database can catch up Flow control Vertical scaling: Tune PostgreSQL configuration (shared_buffers, max_wal_size, checkpoint_timeout) to handle higher write loads Vertical scaling Vertical scaling Vertical scaling shared_buffers, max_wal_size, checkpoint_timeout Database connection pooling: Use psycopg_pool.ConnectionPool instead of single connections for better concurrency under load Database connection pooling psycopg_pool.ConnectionPool psycopg_pool.ConnectionPool Batch size limits: Cap batch sizes to prevent memory exhaustion and keep flush latency predictable Batch size limits Final Thoughts You started with a narrow schema, layered batching on top, then stress-tested the failure modes. Batching is the architectural requirement that makes your pipeline viable at production scale. This tutorial focused on the ingestion mechanics; the patterns that remain constant whether you’re handling 500 devices or 50,000. Production adds its own complexity: TLS, monitoring, orchestration, and whatever else your ops team throws at you. But those concerns sit on top of the foundation you’ve built here. 500 devices or 50,000 500 devices or 50,000 Time-window batching is a system of interconnected design decisions. Optimal performance requires balancing batch size (efficiency vs. memory), flush interval (latency vs. database operations), error handling (data preservation vs. overhead), back-pressure management (horizontal scaling vs. complexity), and deduplication strategy (simplicity vs. throughput). Next steps for production deployment: Next steps for production deployment: Monitoring: Instrument your pipeline to track flush latency, queue depth, and throughput. These metrics tell you when to scale or tune your flush interval. Compression: Enable Hypercore compression for chunks older than your active query window (start with 7 days and adjust based on storage budget). Query optimization: Use EXPLAIN ANALYZE to measure query performance and add composite indexes for your read patterns. Implement continuous aggregates to pre-compute hourly/daily summaries for dashboards and analytics. Scaling: When a single consumer can’t keep up, add topic-based partitioning as demonstrated in the back-pressure experiments. Each additional consumer+publisher pair adds ~16k msg/s capacity. Monitoring: Instrument your pipeline to track flush latency, queue depth, and throughput. These metrics tell you when to scale or tune your flush interval. Monitoring Compression: Enable Hypercore compression for chunks older than your active query window (start with 7 days and adjust based on storage budget). Compression Query optimization: Use EXPLAIN ANALYZE to measure query performance and add composite indexes for your read patterns. Implement continuous aggregates to pre-compute hourly/daily summaries for dashboards and analytics. Query optimization EXPLAIN ANALYZE Scaling: When a single consumer can’t keep up, add topic-based partitioning as demonstrated in the back-pressure experiments. Each additional consumer+publisher pair adds ~16k msg/s capacity. Scaling Start with a single consumer running the COPY + temp table pattern. When you hit throughput limits, you’ll know exactly where the ceiling is because you’ve tested the failure modes in isolation. The experiments in the companion repository are your proving ground. COPY companion repository