{
  "slug": "hyperdex",
  "term": "HyperDex",
  "aliases": [
    "HyperDex hyperspace hashing"
  ],
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Range predicates require an order-preserving coordinate mapping; arbitrary hashing does not preserve numeric order.",
      "citationIds": [
        "sigcomm12"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-16",
  "definition": "HyperDex is a distributed key-value store that uses secondary-attribute coordinates to place objects and route searches across servers.",
  "note": "The 2012 design divides attributes into low-dimensional subspaces. A search uses one subspace selected to minimize contacted servers. The implementation stores a complete object per subspace and adds f+1 replicas per region to tolerate f failures. Index copies and failure replicas are distinct costs. [sigcomm12]\n\nAn immutable key subspace anchors updates. Value-dependent chaining includes both old and new locations when an attribute change moves an object; the new copy is stored before the old one is removed. [sigcomm12]\n\nSingle-key get/put operations are linearizable, but search may return both the committed and concurrently updated versions of a matching object. That is not a single-version snapshot guarantee. Applications must distinguish key-operation consistency from search consistency. [sigcomm12]\n\nWarp's 2015 design extends HyperDex with acyclic transactions for multi-key serializability. Clients buffer writes and cache reads in a transaction context; the commit protocol validates reads and orders conflicting transactions. These are additional transaction mechanisms, not consequences of the base store's linearizable get/put operations. [warp15]",
  "related": [
    "serializability",
    "linearizability",
    "chain-replication"
  ],
  "citations": [
    {
      "id": "sigcomm12",
      "label": "HyperDex, SIGCOMM 2012",
      "title": "Escriva, Wong and Sirer. HyperDex: A Distributed, Searchable Key-Value Store. SIGCOMM 2012, pp. 25-36; sections 2.3, 3.2 and 4.",
      "url": "https://www.cs.cornell.edu/people/egs/papers/hyperdex-sigcomm.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "warp15",
      "label": "Warp, arXiv v1 (2015)",
      "title": "Escriva, Wong and Sirer. Warp: Lightweight Multi-Key Transactions for Key-Value Stores. arXiv:1509.07815v1, 2015; sections 2 and 2.1.",
      "url": "https://arxiv.org/abs/1509.07815v1",
      "accessed": "2026-11-16"
    }
  ],
  "provenance": [
    "Historical source review of the SIGCOMM 2012 design and Warp's 2015 preprint, not a benchmark replication.",
    "Research classification describes the designs reviewed here, not current maintenance or commercial availability."
  ]
}
