We describe a variant of linear probing hash tables that never moves elements and thus supports referential integrity, i.e., pointers to elements remain valid while this element is in the hash table. This is achieved by the folklore method of marking some table entries as formerly occupied (tombstones). The innovation is that the number of tombstones is minimized. Experiments indicate that this allows an unbounded number of operations with bounded overhead compared to linear probing without tombstones (and without referential integrity).
@article{arxiv.1808.04602,
title = {Hashing with Linear Probing and Referential Integrity},
author = {Peter Sanders},
journal= {arXiv preprint arXiv:1808.04602},
year = {2018}
}