BHare1985 / OPMPHF Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

C# implementation of an acyclic graph algorithm for constructing an Order Preserving Minimal Perfect Hash Function (OPMPHF) given a set of keys.

2 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
OPMPHF.Tests		OPMPHF.Tests
OPMPHF		OPMPHF
.gitattributes		.gitattributes
.gitignore		.gitignore
LICENSE		LICENSE
OPMPHF.sln		OPMPHF.sln
README.md		README.md

Repository files navigation

OPMPHF

C# implementation of an acyclic graph algorithm ¹ for constructing an Order Preserving Minimal Perfect Hash Function (OPMPHF) given a set of keys.

Ferragina, P. (2023). The Dictionary Problem. In Pearls of Algorithm Engineering (pp. 96-127). Cambridge: Cambridge University Press. doi:10.1017/9781009128933.009 ↩

About

C# implementation of an acyclic graph algorithm for constructing an Order Preserving Minimal Perfect Hash Function (OPMPHF) given a set of keys.

minimal perfect hash mphf opmphf order-preserving order-preserving-hash

Report repository

Releases

No releases published

Packages

No packages published

Languages

C# 100.0%