1991Journal of Database ManagementRequires access

Direct Perfect Hashing Functions for External Files

M. Ramakrishna, Yuchi Bannai

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Dynamic perfect hashing, Linear hashing, Hash table, Hash function, Consistent hashing, Ideal (ethics), Table (database)

Related papers

Back to paper searchBrowse research topicsOriginal source