Cache-conscious collision resolution in string hash tables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 91-102

  Askitis, Nikolas ^a   Zobel, Justin ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; DATA STRUCTURES; INFORMATION RETRIEVAL SYSTEMS; TREES (MATHEMATICS);

BINARY TREES; CACHE-CONSCIOUS COLLISION RESOLUTION; STRING HASH TABLES;

DECISION TABLES;

EID: 33646742764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_11     Document Type: Conference Paper

References (27)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, January 1974.
2. J. Baer and T. Chen. Effective hardware-based data prefetching for high-performance processors. IEEE Transactions on Computers, 44(5): 609-623, 1995.
3. D. Callahan, K. Kennedy, and A. Porterfield. Software prefetching. In Proc. ASPLOS Int. Conf. on Architectural Support for Programming Languages and Operating Systems, pages 40-52. ACM Press, New York, 1991.
4. T. M. Chilimbi, M. D. Hill, and J. R. Larus. Cache-conscious structure layout. In Proc. ACM SIGPLANconf. on Programming Language Design and Implementation, pages 1-12, ACM Press, New York, 1999.
5. J. Collins, S. Sair, B. Calder, and D. M. Tullsen. Pointer cache assisted prefetching. In Proc. Annual ACM/IEEE MICRO Int. Symp. on Microarchitecture, pages 62-73. IEEE Computer Society Press, 2002.
6. J. W. C. Pu, J. H. Patel, and B. L. Janssens. Stride directed prefetching in scalar processors. SIGMICRO Newsletter, 23(1-2): 102-110, 1992.
7. C. Halatsis and G. Philokyprou. Pseudochaining in hash tables. Communications of the ACM, 21(7):554-557, 1978.
8. D. Harman, Overview of the second text retrieval conference (TREC-2). In Information Processing & Management, pages 271-289. Pergamon Press, Inc., 1995.
9. G. L. Heileman and W. Luo. How caching affects hashing, In Proc. ALENEX Workshop on Algorithm Engineering and Experiments, January 2005.
10. S. Heinz, J. Zobel, and H. E. Williams. Self-adjusting trees in practice for large text collections. Software -Practice and Experience, 31(10):925-939, 2001.
11. M. Karlsson, F. Dahlgren, and P. Stenstrom. A prefetching technique for irregular accesses to linked data structures. In Proc. Symp. on High-Performance Computer Architecture, pages 206-217, January 2000.
12. D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. AddisonWesley Longman, second edition, 1998.
13. P. Larson. Performance analysis of linear hashing with partial expansions. ACM Transactions on Database Systems, 7(4):566-587, 1982.
14. A. R. Lebeck, Cache conscious programming in undergraduate computer science. In Proc. SIGCSE Technical Symp. on Computer Science Education, pages 247-251. ACM Press, New York, 1999.
15. J. McCabe. On serial files with relocatable records. Operations Research, 13:609-618,1965.
16. J. I. Munro and P. Celis. Techniques for collision resolution in hash tables with open addressing. In Proc. ACM Fall Joint Computer Conf., pages 601-610. IEEE Computer Society Press, 1986.
17. W. W. Peterson. Open addressing. IBM J. Research & Development, 1:130-146, 1957.
18. M. V. Ramakrishna and J. Zobel. Performance in practice of string hashing functions. In Proc. DASFAA Symp. on Databases Systems for Advanced Applications, volume 6, pages 215-224. World Scientific, April 1997.
19. A. Rathi, H. Lu, and G. E. Hedrick, Performance comparison of extendible hashing and linear hashing techniques, In Proc. ACM SIGSMALL/PC Symp. on Small Systems, pages 178-185. ACM Press, New York, 1990.
20. A. L. Rosenberg and L. J. Stockmeyer, Hashing schemes for extendible arrays. Jour, of the ACM, 24(2): 199-221, 1977.
21. A. Roth and G. S. Sohi. Effective jump-pointer prefetching for linked data structures. In Proc. Int. Symp. on Computer Architecture, pages 111-121, IEEE Computer Society Press, 1999.
22. D. V. Sarwate. A note on universal classes of hash functions, Information Processing Letters, 10(1):41-45, 1980.
23. R. Sinha, D. Ring, and J. Zobel. Cache-efficient string sorting using copying. In submission.
24. R. Sinha and J. Zobel. Cache-conscious sorting of large sets of strings with dynamic tries. ACM Jour. of Exp. Algorithmes, 9, 2005.
25. J. S. Vitter. Analysis of the search performance of coalesced hashing. Jour, of the ACM, 30(2):231-258, 1983.
26. C. Yang, A. R. Lebeck, H. Tseng, and C. Lee. Tolerating memory latency through push prefetching for pointer-intensive applications, ACM Trans. Architecture Code Optimisation, 1(4):445-475, 2004.
27. J. Zobel, H. E. Williams, and S. Heinz. In-memory hash tables for accumulating text vocabularies. Information Processing Letters, 80(6):271-277, December 2001.