Software implementation of a new method of combinatorial hashing.

Pierre Dubost, Jean Trousse · 1975

This is a study of the software implementation of a new method of searching with retrieval on secondary keys. A new family of partial match file designs is presented, the ''worst case'' is determined, a detailed algorithm and program are given and the average execution time is studied.

Read the paper · More papers on PaperTik