Elsevier

Information Systems

Volume 18, Issue 8, December 1993, Pages 597-608
Information Systems

Adaptive hashing with signatures

https://doi.org/10.1016/0306-4379(93)90026-WGet rights and content

Abstract

Adaptive hashing with signatures combines the adaptive hashing file structure together with superimposed signatures and several new algorithms to produce a new order-preserving data structure. This new technique has excellent direct retrieval performance, localized index organizations, and improved file index balance. In keeping with the principle advantage of the original adaptive hashing technique, algorithms to improve both primary and secondary memory storage utilization are also discussed. Furthermore, the new data structure has a high degree of flexibility, allowing it to be tailored for the optimum performance vs storage utilization ratio for a given application.

References (14)

  • A Tharp et al.

    B+ trees, bounded disorder and adaptive hashing

    Information Systems

    (1991)
  • P Larson

    Linear hashing with separators—a dynamic hashing scheme using one probe

    ACM Trans. Database Syst.

    (1988)
  • G Gonnet et al.

    External hashing with limited internal storage

  • P Larson et al.

    File organization—implementation of a method guaranteeing retrieval in one access

    CACM

    (1984)
  • A Tharp

    File Organization and Processing

    (1988)
  • Y Chung et al.

    Dynamic signature hashing

  • F Cesarini et al.

    A dynamic hash method with signature

    ACM Trans. Database Syst.

    (1991)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1994 Published by Elsevier Ltd.