Tag
partitioning
- Sep 22, 2026 Quicksort Partition Schemes and the Duplicate-Key Quadratic How Lomuto and Hoare partitioning differ in swap count and branch behaviour, why two-way partitions degrade on equal keys, and what three-way partitioning restores. algorithms
- Sep 20, 2026 Storage Partition Keys and the Origin Boundary How a browser derives the key that web storage is filed under, how scheme and port enter that key, and why partitioned third-party storage adds the top-level site. web platform
- Sep 2, 2026 Partition Statistics as Validation Signals Per-partition row counts, byte sizes, and file counts are metadata, so checking them costs almost nothing; the hard part is knowing which deviation means which fault. data engineering
- Aug 18, 2026 Fixed-Slice Partitioning of Shared Engines Inside One Device Splitting a GPU into isolated instances without separate PCI functions requires slicing the caches and memory controllers, and the slices that cannot be cut set the floor on granularity. gpu computing
- Jul 27, 2026 SR-IOV Virtual Functions and Static Partitioning of GPU Engines A single PCI function becomes many by replicating the parts that carry identity, and the GPU functions that cannot be replicated become the hard limits on how finely a card can be split. gpu computing
- Jun 17, 2026 Hash and Range Partitioning: Choosing What the Shard Key Preserves Why range partitioning keeps ordered scans and concentrates writes, why hashing spreads load and destroys locality, and how consistent hashing changes only the movement cost. databases
- Mar 8, 2026 Split Discovery and Why a Parallel Read Is Not a Consistent Read How a connector partitions a table into independently readable ranges, and why the boundaries it discovers are only correct if the key distribution does not change. data engineering
- Feb 17, 2026 Partitioning a Workload So Every Thread Reads Local Memory How to divide data and threads so that each partition lives on the node that processes it, what the boundaries between partitions cost, and where the design breaks on machines with uneven node counts. memory systems
- Dec 5, 2025 Quickselect and the Cost of Finding One Element in Place How the selection recursion differs from quicksort, why the expected cost is linear, and which inputs make the linear promise fail. algorithms
- Oct 15, 2025 Local and Global Secondary Indexes Under Partitioning An index can be partitioned with the data or by the indexed value. The first makes writes cheap and reads expensive; the second inverts it, and neither is free. distributed systems
- Oct 3, 2025 Holding Delayed Jobs: Buckets, Timers, and the Cost of Time-Ordered Scans Why millions of future-dated jobs concentrate contention on one index page, how time bucketing and a separate promotion step spread it, and where in-memory timer wheels fit. backend systems
- Sep 19, 2025 Ordering Guarantees and Head-of-Line Blocking A log guarantees order only within a partition, and that guarantee survives retries, consumer parallelism, and rebalances only under specific conditions. backend systems
- Sep 8, 2025 Adaptive Partitioning and Runtime Repartitioning How a shuffle writer reports per-partition sizes at the stage barrier, and how coalescing and splitting use that report to correct a partition count chosen before the data was read. data engineering
- Aug 6, 2025 Partition Evolution Without Rewriting Existing Data How a table can change its partition granularity while old files keep their original layout, why the manifest must record the spec that produced each file, and what queries pay for the mixture. data engineering
- Apr 15, 2025 Merge-Path Partitioning: Splitting Two Sorted Runs Without Sampling How binary search over the merge path cuts two sorted arrays into equal-sized pieces at the correct values, and why the split is exact rather than statistical. algorithms
- Sep 24, 2024 How a Partitioner Maps Keys to Reduce Tasks Why the reduce task count is fixed before any record is read, what hash-modulo partitioning guarantees, and why changing the count remaps almost every key. data engineering
- Jun 18, 2024 Request Rate Limits and Why Key Prefixes Are Partitioned A bucket scales by splitting its keyspace across index partitions. Sequential keys hammer one partition, so the naming scheme decides the achievable request rate. cloud infrastructure
- Aug 8, 2023 Partitioning a Crawl Across Machines Without Duplicate Fetches Why host-based partitioning is the only split that preserves politeness, how a frontier survives reassignment, and what happens when one partition dies. information retrieval
- May 19, 2023 Exchange Operators: Partitioning, Broadcasting, and Parallel Pipelines How a plan is divided into fragments, what a repartition exchange does to tuple order and memory, and why the exchange is the only operator that moves rows between workers. databases