Performance comparison of extendible hashing and linear hashing techniques

Proceedings of the 1990 ACM SIGSMALL/PC Symposium on Small Systems, SIGSMALL 1990

Volumn , Issue , 1990, Pages 178-185

  Rathi, Ashok ^a   Lu, Huizhu ^a   Hedrick, G E ^a  

^a OKLAHOMA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATERIALS PROPERTIES; NANOSTRUCTURED MATERIALS;

AVERAGE BEHAVIOR; COMPARISON FACTORS; HASHING TECHNIQUES; LINEAR HASHING; PERFORMANCE COMPARISON; SEARCH COSTS; STORAGE UTILIZATION; SUCCESSFUL SEARCH;

COSTS;

EID: 84999377606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99412.99462     Document Type: Conference Paper

References (20)

1. [Bra86] Bradley, J. "Use of Mean Distance between Overflow Records of Compute Average Search Lengths in Hash Files with Open Addressing." Computer J 29 2(1986), pp. 167-170.
2. [Car79] Carter, J. L. and Wegman M. "Universal Class of Hash Functions", J. of Comp. & Svs. Sci., 18, 1(1979), pp. 143-154.
3. [Chu89] Chun, S. H., Hedrick, G. E., Lu, H., Fisher, D. D., "A Partitioning Method for Grid File Directories", will appear in Proc. of the IEEE Computer Society's 13th Annual International Computer Software and Applications Conference, Sept. 18-22, 1989 Orlando applications Conference, Sept. 18-22, 1989 Orlando
4. [E1182] Ellis, C. S. "Extendible Hashing for Concurren Operations and Distributed Data." ACM SIGMOD, 1982
5. [Fag79] Fagin, R., Nievergelt, J., Pippenger, N., and Strong, H. R. "Extendible Hashing - A Fast Access Method for Dynamic Files." ACM Transactions on Database Systems, 14, 3(Sept. 1979), pp. 315-344.
6. [Fre87] Freeston, M. "The BANG file." Proc. of ACM SIGMOD Conf., 16, 3(Dec. 1987), 260-269.
7. [Knu73] Knuth, D. The Art of Computer Programming, vol. III: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
8. [Lar78] Larson, P. "Dynamic Hashing." BIT, 18(1987), pp. 184-201.
9. [Lar82] Larson, P. "Performance Analysis of Linear Hashing with Partial Expansions." ACM Transactions on Database Systems, 7, 4(1982), pp. 566-587.
10. [Lar85] Larson, P. "Performance Analysis of a Singlefile Version of Linear Hashing." Computer J., 28, 3(1985), pp. 319-326.
11. [Lar88] Larson, P. "Dynamic Hash Tables." Communications of the ACM. 31, 4(April 1988), pp. 446457.
12. [Lia89] Lian, T., Fisher, D., Lu, H., "Implementation and Evaluation of Grid and Bang (Balanced and Nested Grid) File Structures", IEEE Proc. of Workshop on Applied Computing 1989, pp. 80-85.
13. [Lit80] Kitwin, W. "Linear Hashing: A New Tool for File and Table Addressing." Proc. of the 6th Conference on Very Large Databases, 1980, pp. 212-223.
14. [Mar77] Martin, J. Computer Data-Base Organization (2nd edition). Prentice-Hall, 1977.
15. [Mul85] Mullin, J. R. "Spiral Storage: An Efficient Dynamic Hashing with Constant Performance." Computer J., 28, 3(1985), pp. 330-334.
16. [Nie84] Nievergelt, J., Hinterberger, H., & Sevcik, K. C., The Grid File: An Adaptable, Symmetric Multikey File Structure", ACM Transactions on Database Systems, Vol. 9, No. 1, 1984, pp 38-71.
17. [Par88] Park, S. K. and Miller, K. W. "Random Number Generators: Good Ones Are Hard to Find." Communications of the ACM. 31, 10(October 1988), pp. 1192-1201.
18. [Ram82] Rammohanrao, K. and Lloyd, J. K. "Dynamic Hashing Schemes." Computer J., 25, 4(1982), pp. 478-485.
19. [Sch81] Scholl, M. "New File Organizations Based on Dynamic Hashing." ACM Transactions on Database, Systems, 6, 1(Mar. 1981), pp. 194-211.
20. [Ver87] Verma, V., & Lu, H., "A New Approach to Version Management for Databases", Proceedings of National Computer Conference (AFIP Conference) vol. 56, 1987, pp. 645-651.