Gonnet, G., H. Handbook of ALGORITHMS and DATA STRUCTURES. Addison-Wesley, 1984. Google Scholar
Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, 1973. Google Scholar
Krishnamurty, R., Morgan S., P. Query Processing on Personal Computers — A Pragmatic Approach. VLDB-84, Singapore (Aug. 1984), 26–29. Google Scholar
de Jonge, W., Tanenbaum, A., S., Van de Riet R. A Fast, Tree-based Access Method for Dynamic Files. Rapp IR-70, Vrije Univ. Amsterdam, (Jul 1981), 20. Google Scholar
Larson, P., A. Dynamic hashing. BIT 18 (1978), 184–201. Google Scholar
Larson, P.,, A. A single file version of linear hashing with partial expansions. VLDB 82, ACM, (Sep 1982), 300–309. Google Scholar
Litwin, W. Virtual hashing: a dynamically changing hashing. VLDB 78, ACM, (Sep 1978), 517–523. Google Scholar
Litwin, W. Linear hashing: A new tool for files and tables addressing. VLDB 80, ACM, (Sep 1980), 212–223. Google Scholar
Litwin, W. Trie hashing. SIGMOD 81. ACM, (May 1981), 19–29. Google Scholar
Litwin, W. Data Access Methods and Structures to Enhance Performance. Database performance, State of the Art Report 12:4. Pergamon Infotech, 1984, 93–108. Google Scholar
Litwin, Witold. Trie hashing: Further properties and performances. Int. Conf. on Foundation of Data Organisation. Kyoto, May 1985. Plenum Press. Google Scholar
Litwin, W., Lomet, D. Bounded Disorder Access Method. 2-nd Int. Conf. on Data Eng. IEEE, Los Angeles, (Feb. 1986). Google Scholar
Lomet, D., B. Multi-table search for B-tree files. ACM-SIGMOD, 1979, 35–42. Google Scholar
Lomet, D. Digital B-trees. VLDB 81. ACM, (Sep 1981), 333–344. Google Scholar
Lomet, D. Bounded Index Exponential Hashing. ACM TODS, 8, 1, (Mar 1983), 136–165. Google Scholar
Mullin, J., K. Tightly controlled linear hashing without separate overflow storage. BIT, 21, 4, (1891), 389–400. Google Scholar
Nievergelt, J., Hinterberger, H., Sevcik, K., C. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM TODS, (March 1984). Google Scholar
Orenstein, J. A Dynamic Hash File for Random and Sequential Accessing. VLDB 83, (Nov 1983), 132–141. Google Scholar
Ouksel, M. Scheuerman, P. Storage Mapping for Multidimensional Linear Dynamic Hashing. PODS 83. ACM, (March 1983), 90–105. Google Scholar
Ramamonohanarao, K., Sacks-Davis, R. Recursive Linear Hashing. ACM-TODS, 9, 3, (Sep. 1984). Google Scholar
Regnier, M. Linear hashing with groups of reorganization. An algorithm for files without history. In Sheuermann P. (ed): Improving Database Usability and Responsiveness, Academic Press, (1982), 257–272. Google Scholar
Rosenberg, A.,, L., Snyder, L. Time and space optimality in B-trees. ACM-TODS, 6,1 (1981), 174–193. Google Scholar
Samet, H. The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16, 2 (June 1984), 187–260. Article Google Scholar
Scholl, M. New File Organizations Based on Dynamic Hashing. ACM TODS, 6, 1, (March 1981), 194–211. Google Scholar
Shou-Hsuan Stephen Huang. Height-Balanced Trees. ACM TODS, 10, 2 (1985), 261–284. Google Scholar
Tamminen, M. Extendible hashing with overflow. Inf. Proc. Lett. 15, 5, 1982, 227–232. Google Scholar
Torenvliet, L., Van Emde Boas, P. The Reconstructive and Optimization of Trie Hashing Functions. VLDB 83, (Nov. 1983), 142–157. Google Scholar
Tremblay, J-P., Sorenson, P., G. An Introduction to Data Structures. 2-nd ed., McGraw-Hill, 1984, 861. Google Scholar
Tropf, H., Herzog, H. Multidimensional range search in dynamically balanced trees. Agnew. Inf. 2, 71–77. Google Scholar
Wiederhold, G. Database design. McGraw-hill Book Company, 1983. Google Scholar
Yao, A.,, C. On random 2–3 trees. Acta Inf. 18, (1983), 159–170. Google Scholar
Zegour, D. Implementation du hachage digital multiniveaux. Techn. Rep., (Sep. 1986), INRIA. Google Scholar