# Disk-Resident Graph Index

The page layout of a disk-resident graph vector index decides how many SSD pages a search reads, yet layouts such as Starling and MARGO are computed from the graph and the vectors and use no query logs. HyperPage treats the expanded-node sets logged in one finished Search-R1 agent run as the workload, builds layouts for the uncached records under a declared memory budget, then replays validation steps to pick a layout and the split of the budget between hot records and a page cache. Across seven cache budgets on 1M and 21M passage indexes it reads 5.2% to 21.2% fewer pages than MARGO, with the largest gain when the cache is small.

The page layout of a disk-resident graph vector index decides how many SSD pages a search reads, yet layouts such as Starling and MARGO are computed from the graph and the vectors and use no query logs. HyperPage treats the expanded-node sets logged in one finished Search-R1 agent run as the workload, builds layouts for the uncached records under a declared memory budget, then replays validation steps to pick a layout and the split of the budget between hot records and a page cache. Across seven cache budgets on 1M and 21M passage indexes it reads 5.2% to 21.2% fewer pages than MARGO, with the largest gain when the cache is small.