Dynamic file organizations for partial match retrieval based on linear hashing

T. S. Yuen; H. C. Du

doi:10.1109/ICDE.1986.7266213

Dynamic file organizations for partial match retrieval based on linear hashing

T. S. Yuen, H. C. Du

Computer Science and Engineering

Research output: Contribution to journal › Conference article › peer-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 language	English (US)
Article number	7266213
Pages (from-to)	116-123
Number of pages	8
Journal	Proceedings - International Conference on Data Engineering
Volume	2015-January
DOIs	https://doi.org/10.1109/ICDE.1986.7266213
State	Published - 1986
Event	2nd IEEE International Conference on Data Engineering, COMPDEC 1986 - Los Angeles, United States Duration: Feb 5 1986 → Feb 7 1986

Bibliographical note

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

Publisher Copyright:
© 1986 IEEE.

Keywords

Database Management
File Organization
Information Storage and Retrieval
Physical Design

Publisher link

10.1109/ICDE.1986.7266213

Find It

Find It at U of M Libraries

Cite this

@article{84d73b4bf09d4169afb83beda4165da9,

title = "Dynamic file organizations for partial match retrieval based on linear hashing",

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.",

keywords = "Database Management, File Organization, Information Storage and Retrieval, Physical Design",

author = "Yuen, {T. S.} and Du, {H. C.}",

note = "Funding Information: This work was supported in part by NSF Grant DCR-8405498. Publisher Copyright: {\textcopyright} 1986 IEEE.; 2nd IEEE International Conference on Data Engineering, COMPDEC 1986 ; Conference date: 05-02-1986 Through 07-02-1986",

year = "1986",

doi = "10.1109/ICDE.1986.7266213",

language = "English (US)",

volume = "2015-January",

pages = "116--123",

journal = "Proceedings - International Conference on Data Engineering",

issn = "1084-4627",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Dynamic file organizations for partial match retrieval based on linear hashing

AU - Yuen, T. S.

AU - Du, H. C.

PY - 1986

Y1 - 1986

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

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

KW - Database Management

KW - File Organization

KW - Information Storage and Retrieval

KW - Physical Design

UR - http://www.scopus.com/inward/record.url?scp=0022603638&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022603638&partnerID=8YFLogxK

U2 - 10.1109/ICDE.1986.7266213

DO - 10.1109/ICDE.1986.7266213

M3 - Conference article

AN - SCOPUS:0022603638

SN - 1084-4627

VL - 2015-January

SP - 116

EP - 123

JO - Proceedings - International Conference on Data Engineering

JF - Proceedings - International Conference on Data Engineering

M1 - 7266213

T2 - 2nd IEEE International Conference on Data Engineering, COMPDEC 1986

Y2 - 5 February 1986 through 7 February 1986

ER -

Dynamic file organizations for partial match retrieval based on linear hashing

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this