Direct Perfect Hashing Functions for External Files
M. Ramakrishna, Yuchi Bannai
Abstract
M. Ramakrishna, Yuchi Bannai
Abstract
A file organization scheme based on composite perfect hashing, which guarantees single access retrieval from external files has been proposed recently. The ideal retrieval performance is achieved by using an auxiliary internal table and direct perfect hashing. In this paper, we explore systematic methods of finding direct perfect hashing functions. Experimental results indicate that the proposed methods are practical.Request access from your librarian to read this article's full text.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A file organization scheme based on composite perfect hashing, which guarantees single access retrieval from external files has been proposed recently. The ideal retrieval performance is achieved by using an auxiliary internal table and direct perfect hashing. In this paper, we explore systematic methods of finding direct perfect hashing functions. Experimental results indicate that the proposed methods are practical.Request access from your librarian to read this article's full text.
Key concepts: Computer science, Dynamic perfect hashing, Linear hashing, Hash table, Hash function, Consistent hashing, Ideal (ethics), Table (database)