DocumentCode :
2053299
Title :
Optimal linear hashing files for orthogonal range retrieval
Author :
Chen, C.Y. ; Chang, C.C. ; Lee, R.C.T. ; Lin, D.C.
Author_Institution :
Dept. of Electron., Feng Chia Univ., Taichung, Taiwan
fYear :
1996
fDate :
21-23 Aug 1996
Firstpage :
406
Lastpage :
413
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
Keywords :
data structures; database management systems; information retrieval; MMI; greedy method; minimum marginal increase; optimal recursive linear hashing files; orthogonal range retrieval; partial match retrieval; performance expressions; Computer science; Databases; Performance analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Software and Applications Conference, 1996. COMPSAC '96., Proceedings of 20th International
Conference_Location :
Seoul
ISSN :
0730-3157
Print_ISBN :
0-8186-7579-9
Type :
conf
DOI :
10.1109/CMPSAC.1996.544601
Filename :
544601
Link To Document :
بازگشت