Optimal Linear Hashing Files for Orthogonal Range Retrieval

Authors:
C. Y. Chen;C. C. Chang;R. C. T. Lee;D. C. Lin
Affiliations:
-;-;-;-
Venue:
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Year:
1996

Citing 8
Cited 0

Recursive linear hashing

ACM Transactions on Database Systems (TODS)
Partial match retrieval using recursive linear hashing

BIT
Optimal MMI file systems for orthogonal range retrieval

Information Systems
Performance analysis of linear hashing with partial expansions

ACM Transactions on Database Systems (TODS)
Dynamic File Organizations For Partial Match Retrieval Based on Linear Hashing

Proceedings of the Second International Conference on Data Engineering
Orthogonal Range Retrieval Using Bucket Address Hashing

Proceedings of the 4th International Working Conference SSDBM on Statistical and Scientific Database Management
Linear hashing: a new tool for file and table addressing

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Linear hashing with partial expansions

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We are concerned with the problem of designing optimal linear hashing files for orthogonal range retrieval. Through the study of performance expressions, we show that optimal basic linear hashing files and optimal recursive linear hashing files for orthogonal range retrieval can be produced, in certain cases, by a greedy method called the MMI (minimum marginal increase) method; and it is pointed out that optimal linear hashing files for partial match retrieval need not be optimal for orthogonal range retrieval.