SkillVaultskills Browse all 500 skills

Search · Version 1.7.0 · Reviewed 2026-08-02

Elasticsearch Query Optimizer

Make a defensible decision about query latency analysis and mapping review with evidence, explicit trade-offs, and a verification plan.

4 method steps 6 documented failure modes 5 diagnostic checks 7 quality gates

Analyzes mappings, analyzers, query clauses, shard fan-out, aggregations, and circuit-breaker pressure in Elasticsearch workloads.

₹99 one-time

Get this skill archive

What this skill helps you do

  • Query latency analysis
  • Mapping review
  • Aggregation optimization

How Elasticsearch Query Optimizer works

You provide

Schema, query plans, and the real access pattern

It inspects

Plan accuracy and lock behavior for query latency analysis

It decides

A mapping review change weighed against write cost

You verify

Re-measured plan with buffer reads and timing compared

What it checks first

Elasticsearch Query Optimizer analyzes mappings, analyzers, query clauses, shard fan-out, aggregations, and circuit-breaker pressure in Elasticsearch workloads. Use it when the work involves Query latency analysis, Mapping review, Aggregation optimization.

  1. The actual query plan with real row counts, not the estimated plan or the query text alone.
  2. Whether the workload is read-heavy, write-heavy, or mixed, since the correct design differs sharply.
  3. Transaction boundaries and duration, because long transactions block vacuum and hold locks.
  4. Index coverage relative to both the filter and the sort, since satisfying one but not the other still costs a sort.
  5. Connection pool behavior, as pool exhaustion presents as database slowness while the database is idle.

Failure modes it recognizes

  • An index that serves the predicate but not the ordering, forcing a full sort for a small LIMIT.
  • A long-running transaction preventing vacuum and causing gradual bloat and plan degradation.
  • Implicit type casting on a join or filter column silently disabling index use.
  • Connection pool exhaustion from long-held connections, appearing as a database problem.
  • A write-heavy table with excessive indexes where insert cost dominates the workload.
  • Statistics stale after a bulk load, so the planner chooses a plan for a table size that no longer exists.

Answers it will reject

  • Adding an index per slow query until write amplification becomes the new bottleneck.
  • Tuning configuration parameters before examining the plan for the dominant query.
  • Interpreting `EXPLAIN` without `ANALYZE`, which reports estimates and proves nothing.
  • Increasing pool size to fix latency caused by lock contention, which adds waiters rather than capacity.

Decision rules it applies

  • Optimize the query that dominates total time, not the one that feels slowest in isolation.
  • Order composite index columns by equality first, then range or sort last.
  • Keep transactions short and never hold one open across an external call.
  • Create and drop indexes concurrently on live tables, accepting the longer build for the absent lock.

Evidence it asks for

  • `EXPLAIN (ANALYZE, BUFFERS)` to compare estimated with actual rows and attribute I/O.
  • Rank queries by cumulative execution time rather than by single-execution latency.
  • Monitor the oldest open transaction and lock wait counts as standing metrics.

The method inside

  1. Define the measured baseline and user-visible target for query latency analysis.
  2. Attribute the dominant cost or latency mechanism affecting mapping review.
  3. Rank aggregation optimization changes by expected impact, confidence, effort, and regression risk.
  4. Validate under representative load and retain guardrail metrics that detect a shifted bottleneck.

Deliverables

  • Query latency analysis assessment
  • Mapping review decision and action plan
  • Aggregation optimization verification checklist

Evidence requirements

  • Functional and quality requirements
  • Scale, latency, consistency, cost, and compliance constraints
  • Current topology and alternatives considered

Quality gates

  • Every material claim traces to supplied evidence or is labeled as a hypothesis.
  • The response follows the declared deliverable contract.
  • No execution, access, measurement, or verification is invented.
  • Secrets and personal data are redacted rather than repeated.
  • The user receives a concrete independent verification step.
  • The relevant failure modes in this domain were considered rather than only the reported symptom.
  • No listed anti-pattern was recommended as a solution.

Example task

Input

This search query takes four seconds and scans every shard even when the user filters to one tenant.

Expected output

Tenant is mapped as analyzed text and used in a match query, so routing and exact filtering cannot help. Map a keyword field, route documents by tenant, and move the clause into filter context...

Boundaries and compatibility

Ideal for

  • Query latency analysis: produce a decision or artifact grounded in supplied evidence.
  • Mapping review: produce a decision or artifact grounded in supplied evidence.
  • Aggregation optimization: produce a decision or artifact grounded in supplied evidence.

Out of scope

  • Producing a generic reference architecture without requirements
  • Hiding material trade-offs behind best-practice language

Agent compatibility

  • GitHub Copilot custom agents
  • Claude Agent Skills / SKILL.md
  • Any instruction-following chat model

Tool policy: Advisory by default. No tools are assumed. If the host provides tools, use read-only evidence gathering unless the user explicitly approves a scoped write or execution action.