{
  "definition": "A dynamic-pruning query-evaluation method that uses upper bounds on potential scores to avoid fully evaluating candidates that cannot enter the current top-k result set.",
  "derivedRelations": [
    {
      "target": "dynamic-pruning",
      "type": "related"
    }
  ],
  "id": "wand",
  "kind": "Method",
  "license": "https://creativecommons.org/publicdomain/zero/1.0/",
  "links": [
    {
      "label": "WAND paper",
      "type": "definingReference",
      "url": "https://doi.org/10.1145/1571941.1572114"
    }
  ],
  "modifiedAt": "2026-09-12T21:39:00Z",
  "prefLabel": "WAND",
  "publisher": {
    "name": "Searchplex",
    "url": "https://searchplex.net/"
  },
  "relations": [
    {
      "target": "dynamic-pruning",
      "type": "broader"
    },
    {
      "note": "WAND is an algorithmic dynamic-pruning method; weakAnd is a product-specific Vespa query operator.",
      "target": "weakand",
      "type": "notEquivalentTo"
    },
    {
      "target": "block-max-wand",
      "type": "related"
    },
    {
      "target": "weakand",
      "type": "related"
    }
  ],
  "representations": {
    "html": "https://id.searchplex.net/wand/",
    "json": "https://id.searchplex.net/wand.json",
    "jsonld": "https://id.searchplex.net/wand.jsonld"
  },
  "scheme": "https://id.searchplex.net/scheme/",
  "scopeNote": "WAND is an algorithmic concept. Product operators named after WAND may implement specific variants or expose different guarantees.",
  "status": "published",
  "uri": "https://id.searchplex.net/wand/"
}