{
  "slug": "adaptive-quotient-filter",
  "term": "Adaptive quotient filter",
  "aliases": [
    "AdaptiveQF",
    "AQF"
  ],
  "definition": "AdaptiveQF is an approximate-membership filter that extends colliding fingerprints after an exact backing-store check identifies a false positive.",
  "note": "Mapping: a minirun groups fingerprints sharing their original quotient and remainder; its ID and within-group rank locate the original key without tracking physical slot shifts. [adaptiveqf-paper]\n\nScope: the merged reverse-map/database layout sacrifices range queries; a separate map preserves the database's ordered access. Filter-only space and throughput exclude reverse-map costs. [adaptiveqf-paper]",
  "citations": [
    {
      "id": "adaptiveqf-paper",
      "title": "Wen et al. Adaptive Quotient Filters. arXiv:2405.10253v1 (2024), sections 3-4 and 6.3-6.4. DOI: 10.48550/arXiv.2405.10253.",
      "url": "https://arxiv.org/html/2405.10253v1",
      "accessed": "2026-11-10"
    },
    {
      "id": "hesela-adaptive",
      "title": "Hesela: AdaptiveQF reverse-map layout and query contract",
      "url": "https://hesela.com/analyses/bloom-filters-lsm-read-cost/#adaptiveqf-layout",
      "accessed": "2026-11-10"
    }
  ],
  "related": [
    "quotient-filter",
    "counting-quotient-filter",
    "telescoping-adaptive-filter",
    "cuckoo-filter"
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-10",
  "provenance": [
    "Source review of arXiv v1; no AdaptiveQF implementation, database benchmark or adoption survey executed."
  ]
}