Perfect hash function: Difference between revisions

Revision as of 15:28, 18 September 2023

Revision as of 00:32, 6 October 2023

Line 96:

==Extensions==

===Memory address identity===

A trivial but pervasive example of perfect hashing is implicit in the (virtual) [[Virtual Memory|memory address space]] of a computer. Since each byte of virtual memory is a distinct, unique, directly addressable storage ___location, the value of the (starting) [[Pointer (computer programming)|starting address]] ofwhere any object]] is stored in memory can be considered a ''de facto'' perfect hash of that object into the entire memory address range.<ref>{{cite book|publisher=[[Springer Science+Business Media]]|url=https://books.google.com/books?id=66jBbZYOt-EC&pg=PA254|page=254|author1=Witold Litwin|author2=Tadeusz Morzy|author3=Gottfried Vossen|date=19 August 1998|isbn= 9783540649243|title=Advances in Databases and Information Systems}}</ref>

===Dynamic perfect hashing===