An order searching algorithm of extensible hashing

References

• J , Aoe . 1991 . “ Computer Algorithms-Key Search Strategies ” . IEEE Comput. Society Press .
   Google Scholar
• G.H , Gonnet . 1984 . "Handbook of Algorithms and Data Structures" ” . 25 – 147 . Reading Mass : Addison-Wesley .
   Google Scholar
• J , Aoe . 1992 . "Static Hashing and Its Applications" . Journal of Information , 33 ( 11 ) : 1359 – 1366 .
   Google Scholar
• T , Ida . 1983 . "Hash methods" . Journal of Information Processing Society of Japan , 24 ( 4 ) : 391 – 395 .
   Google Scholar
• S , Nishihara . 1980 . "Hashing Techniques and their Applications" . Journal of Information Processing Society of Japan , 21 ( 9 ) : 980 – 991 .
   Google Scholar
• J , Aoe . 1992 . "Dynamic Hashing and Its Applications" . Journal of Information Processing Society of Japan , 33 ( 12 ) : 1465 – 1472 .
   Google Scholar
• R.J , Enbody and H.C , Du . 1988 . "Dynamic Hashing Schemes" . ACM Computing Surveys , 20 ( 2 ) : 85 – 113 .
   Web of Science ®Google Scholar
• R , Fagin , J , Nievergelt , N , Pippenger and H.R , Storing . 1979 . "Extensible Hashing-A Fast Access Method for Dynamic Files" . ACM Trans. Database Syst , 4 ( 3 ) : 315 – 344 .
   Google Scholar
• H , Mendelson . 1982 . "Analysis of Extensible Hashing" . IEEE Trans. Softw.Eng , 8 ( 6 ) : 611 – 619 .
   Web of Science ®Google Scholar
• M , Tamminen . 1981 . "Order Preserving Extensible Hashing and Bucket Tries" . BIT , 21 ( 4 ) : 419 – 435 .
   Google Scholar
• P.A , Larson . 1982 . "Performance Analysis of Linear Hashing with Partial Expansions" . ACM Trans. Database Syst , 7 ( 4 ) : 566 – 587 .
   Web of Science ®Google Scholar
• P.A , Larson . 1988 . "Linear Hashing with Separators-A Dynamic Hashing Scheme Achieving One-Access Retrieval" . ACM Trans. Database Syst , 13 ( 13 ) : 366 – 388 .
   Google Scholar
• K , Mehlhorn . 1979 . "Dynamic Binary Search Tree" . SIAM J. Comput , 8 ( 2 ) : 175 – 198 .
   Web of Science ®Google Scholar
• D , Comer . 1979 . "The Ubiquitous B-Tree" . Comput. Surveys , 11 ( 2 ) : 121 – 137 .
   Web of Science ®Google Scholar
• D.E , Knuth . 1973 . "The Art of Computer Programming" ” . 422 – 480 . Reading Mass : Addision-Wesley .
   Google Scholar
• 1980 . "Data Management in B-trees" . Journal of Information Processing Society of Japan: , 21 ( 7 ) : 769 – 776 .
   Google Scholar
• W.D , Jonge , A.S , Tanenbaum and R.P , Riet . 7 . "Two Access Methods Using Compact Binary Trees" . IEEE Trans. Softw. Eng , 21 ( 13 ) : 799 – 809 .
   Google Scholar