https://pizza.rs/tags/suffix/Recent content in Suffix on INFINI PizzaHugoenhttps://pizza.rs/docs/references/search/term-level/suffix/Mon, 01 Jan 0001 00:00:00 +0000https://pizza.rs/docs/references/search/term-level/suffix/<h1 id="suffix-query"> Suffix query <a class="anchor" href="#suffix-query">#</a> </h1> <p>Returns documents that contain terms <strong>ending</strong> in the provided value. This is the mirror of the <a href="https://pizza.rs/docs/references/search/term-level/prefix/"><code>prefix</code></a> query; like a leading wildcard, it is more expensive than a prefix match.</p> <blockquote> <p><strong>Inside a <a href="https://pizza.rs/docs/references/search/relational/nested/"><code>nested</code></a> query:</strong> not supported yet — the clause is rejected with an HTTP 400 naming the offending clause.</p> </blockquote> <h2 id="how-it-works"> How it works <a class="anchor" href="#how-it-works">#</a> </h2> <p>A term dictionary is sorted by its <strong>beginnings</strong>, so a prefix can seek directly to its subtree — but a suffix cannot. The engine therefore walks the whole dictionary of the field and keeps the terms that end with the value, then unions their postings lists exactly like a <code>should</code> of <a href="https://pizza.rs/docs/references/search/term-level/term/"><code>term</code></a> queries. The cost is proportional to the number of distinct terms in the field, not to the number of matches, which is why the suffix query is marked more expensive than <a href="https://pizza.rs/docs/references/search/term-level/prefix/"><code>prefix</code></a>.</p>