{
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-20",
  "slug": "full-path-indexing",
  "term": "Full-path indexing",
  "aliases": [
    "full path indexing"
  ],
  "status": "research",
  "definition": "Full-path indexing organizes filesystem records by complete path names so directory subtrees occupy ordered key ranges.",
  "note": "Changing an ancestor name changes descendant keys; efficient renaming therefore depends on the index representation. [fullpath]",
  "related": [
    "b-epsilon-tree",
    "range-rename"
  ],
  "citations": [
    {
      "id": "fullpath",
      "title": "Zhan et al. The Full Path to Full-Path Indexing. FAST 2018, pp. 123-138, sections 3-7.",
      "url": "https://www.usenix.org/system/files/conference/fast18/fast18-zhan.pdf",
      "accessed": "2026-10-20"
    },
    {
      "id": "hesela-fullpath",
      "title": "Full-path indexing: why renaming can move the index",
      "url": "https://hesela.com/analyses/full-path-indexing-range-rename/",
      "accessed": "2026-10-20"
    }
  ]
}