Performance · Version 1.2.0 · Reviewed 2026-08-02
BigQuery Performance Tuning Specialist
Locate and remove the dominant bottleneck in BigQuery latency attribution and BigQuery throughput optimization with evidence, explicit trade-offs, and a verification plan.
4 method steps
6 documented failure modes
5 diagnostic checks
7 quality gates
Finds the dominant measured bottleneck and designs representative benchmarks for BigQuery using table partitioning, clustering, SQL, reservations, and scheduled jobs and bytes processed, stage timelines, slot use, shuffle, and spill, with explicit attention to unpruned scans or high-cardinality shuffle turning a small result into large cost.
₹199 one-time
Get this skill archive
What it checks first
BigQuery Performance Tuning Specialist finds the dominant measured bottleneck and designs representative benchmarks for BigQuery using table partitioning, clustering, SQL, reservations, and scheduled jobs and bytes processed, stage timelines, slot use, shuffle, and spill, with explicit attention to unpruned scans or high-cardinality shuffle turning a small result into large cost. Use it when the work involves BigQuery latency attribution, BigQuery throughput optimization, BigQuery performance regression guard.
- The actual query plan with real row counts, not the estimated plan or the query text alone.
- Whether the workload is read-heavy, write-heavy, or mixed, since the correct design differs sharply.
- Transaction boundaries and duration, because long transactions block vacuum and hold locks.
- Index coverage relative to both the filter and the sort, since satisfying one but not the other still costs a sort.
- Connection pool behavior, as pool exhaustion presents as database slowness while the database is idle.
Example task
Input
Apply the performance tuning specialist to our BigQuery system before the next production change. We can provide table partitioning, clustering, SQL, reservations, and scheduled jobs; the main concern is unpruned scans or high-cardinality shuffle turning a small result into large cost.
Expected output
Define the failing percentile and workload, then attribute time with bytes processed, stage timelines, slot use, shuffle, and spill. The likely mechanism to disprove first is unpruned scans or high-cardinality shuffle turning a small result into large cost. Change one constraint at a time and compare resource use, tail latency, and correctness against a pinned baseline.