Dynamic file organizations for partial match retrieval based on linear hashing

T. S. Yuen, H. C. Du

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

Two new file organizations based on Linear Hashing are proposed for partial match retrieval. The first organization introduces a load-balancing scheme whereby overflow records are stored temporarily in other primary buckets so that the allocation of overflow buckets are deferred. The second organization defers the physical splitting of underflow buckets, so that the records belonging to underflow buckets can be retrieved together. These two techniques are then combined together to form a new variation of Linear Hashing. Compared with the original scheme, the performance of these organizations for partial match retrieval are improved, both in terms of storage utilization and retrieval time.

Original languageEnglish (US)
Article number7266213
Pages (from-to)116-123
Number of pages8
JournalProceedings - International Conference on Data Engineering
Volume2015-January
DOIs
StatePublished - 1986
Event2nd IEEE International Conference on Data Engineering, COMPDEC 1986 - Los Angeles, United States
Duration: Feb 5 1986Feb 7 1986

Bibliographical note

Funding Information:
This work was supported in part by NSF Grant DCR-8405498.

Keywords

  • Database Management
  • File Organization
  • Information Storage and Retrieval
  • Physical Design

Fingerprint Dive into the research topics of 'Dynamic file organizations for partial match retrieval based on linear hashing'. Together they form a unique fingerprint.

Cite this