Tag
query-planning
- Sep 19, 2026 Inverted Index Construction and Query Planning for Log Search How tokenized log records become delta-encoded posting lists, how a time-partitioned index prunes work, and when a scan beats an index lookup. observability
- Sep 17, 2026 Label Matchers, Posting Lists, and How a Series Is Selected How the inverted index maps label pairs to series, why equality matchers intersect cheaply while regex matchers degrade to scans, and what the index cannot answer. observability
- Jul 16, 2026 The Places Parameter Binding Cannot Reach Identifiers, sort direction, operators, and collation are resolved before execution, so binding cannot protect them; the designs that survive are structural. security
- Jun 10, 2026 Costing a Parallel Plan: Workers, Gather, and the Serial Fraction Why dividing a plan cost by the number of workers overestimates the gain, how the planner prices worker startup and row transfer, and when a parallel plan loses to a serial one. databases
- 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
- Sep 2, 2025 Metadata Filtering Inside Vector Search Why post-filtering a top-k list cannot satisfy a restrictive predicate, how pre-filtering collapses an index walk, and what the middle strategies actually cost. inference systems
- Dec 4, 2024 How a Query Cost Model Reduces I/O and CPU to One Number Why planner costs are weighted units rather than milliseconds, how sequential and random page reads enter the sum, and which effects the arithmetic deliberately ignores. databases
- Aug 15, 2023 Metadata Filtering Inside a Vector Index and the Selectivity Collapse Why post-filtering silently returns fewer results than requested, how pre-filtering degrades graph traversal, and what the filter selectivity threshold does to each index family. information retrieval