HAT-trie: A cache-conscious trie-based data structure for strings

Conferences in Research and Practice in Information Technology Series

Volumn 62, Issue , 2007, Pages 97-105

  Askitis, Nikolas ^a   Sinha, Ranjan ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Cache; Hash table; Inmemory; String; Tree; Trie

Indexed keywords

CACHE; HASH TABLE; INMEMORY; STRING; TREE; TRIE;

COMPUTER SCIENCE; FORESTRY;

DATA STRUCTURES;

EID: 70849128693     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (47)

1. Acharya, A., Zhu, H. & Shen, K. (1999), Adaptive algorithms for cache-efficient trie search, in 'Proc. ALENEX Workshop on Algorithm Engineering and Experiments', Springer-Verlag, pp. 296-311.
2. Aggarwal, A. (2002), Software caching vs. prefetching, in 'Proc. Int. Symp. on Memory management', ACM Press, New York, pp. 157-162.
3. Agrawal, R. & Srikant, R. (1994), Fast algorithms for mining association rules, in 'Proc. VLDB Int. Conf. on Very Large Databases', Morgan Kaufmann, pp. 487-499.
4. Al-Suwaiyel, M. & Horowitz, E. (1984), 'Algorithms for trie compaction', ACM trans. on Database Systems 9(2), 243-263.
5. Aoe, J., Morimoto, K. & Sato, T. (1992), 'An efficient implementation of trie structures', Software- Practice and Experience 22(9), 695-721.
6. Arge, L., Bender, M. A., Demaine, E. D., Holland- Minkley, B. & Munro, J. I. (2002), Cacheoblivious priority queue and graph algorithm applications, in 'Proc. ACM Symp. on Theory of Computing', ACM Press, New York, pp. 268-276. (Pubitemid 35009386)
7. Arge, L., Bender, M. A., Demaine, E., Leiserson, C. & Mehlhorn, K. (2004), Abstracts collection, in 'Cache-Oblivious and Cache-Aware Algorithms', number 04301 in 'Dagstuhl Seminar Proceedings', IBFI, Germany.
8. Arge, L., Brodal, G. & Fagerberg, R. (2004), In handbook on data structures and applications, in 'Cache-oblivious Data Structures', CRC Press.
9. Askitis, N. & Zobel, J. (2005), Cache-conscious collision resolution for string hash tables, in 'Proc. SPIRE String Processing and Information Retrieval Symp.', Springer-Verlag, pp. 92-104.
10. Askitis, N. & Zobel, J. (2006), B-tries for disk-based string management. Manuscript in submission.
11. Badawy, A. A., Aggarwal, A., Yeung, D. & Tseng, C. (2001), Evaluating the impact of memory system performance on software prefetching and locality optimizations, in 'Proc. Int. Conference on Supercomputing', ACM Press, New York, pp. 486-500. (Pubitemid 32865341)
12. Bell, T. C., Cleary, J. G. & Witten, I. H. (1990), Text Compression, Prentice-Hall.
13. Bender, M. A., Demaine, E. D. & Farach-Colton, M. (2000), Cache-oblivious b-trees, in 'IEEE Symp. on the Foundations of Computer Science', IEEE Computer Society Press, pp. 399-409. (Pubitemid 32075909)
14. Bender, M. A., Demaine, E. D. & Farach-Colton, M. (2002), Efficient tree layout in a multilevel memory hierarchy, in 'Proc. European Symp. on Algorithms', Springer-Verlag, pp. 165-173.
15. Bender, M. A., Duan, Z., Iacono, J. & Wu, J. (2002), 'A locality-preserving cache-oblivious dynamic dictionary', Proc. ACM-SIAM Symp. on Discrete Algorithms 53(2), 29-38.
16. Bender, M., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & Lopez-Ortiz, A. (2003), The cost of cache-oblivious searching, in 'IEEE Symp. on the Foundations of Computer Science', IEEE Computer Society Press, pp. 271-282.
17. Bentley, J. & Sedgewick, R. (1997), Fast algorithms for sorting and searching strings, in 'Proc. ACMSIAM Symp. on Discrete Algorithms', Society for Industrial and Applied Mathematics, pp. 360-369.
18. Berg, S. G. (2002), Cache prefetching, in 'Tech Report UW-CSE', Uni. of Washington.
19. Brodal, G. S. & Fagerberg, R. (2006), Cache-oblivious string dictionaries, in 'Proc. ACM-SIAM Symp. on Discrete Algorithms', ACM Press, New York, pp. 581-590. (Pubitemid 43275279)
20. Brodal, G. S., Fagerberg, R. & Jacob, R. (2002), Cache oblivious search trees via binary trees of small height, in 'Proc. ACM-SIAM Symp. on Discrete Algorithms', ACM Press, New York, pp. 39-48.
21. Chilimbi, T. M., Hill, M. D. & Larus, J. R. (1999), Cache-conscious structure layout, in 'Proc. ACM SIGPLAN conf. on Programming Language Design and Implementation', ACM Press, New York, pp. 1-12. (Pubitemid 129686073)
22. Collins, J., Sair, S., Calder, B. & Tullsen, D. M. (2002), Pointer cache assisted prefetching, in 'Proc. Annual ACM/IEEE MICRO Int. Symp. on Microarchitecture', IEEE Computer Society Press, pp. 62-73.
23. Comer, D. (1979), 'Heuristics for trie index minimization', ACM trans. on Database Systems 4(3), 383-395.
24. Dongarra, J., London, K., Moore, S., Mucci, S. & Terpstra, D. (2001), Using papi for hardware performance monitoring on linux systems, in 'Proc. Conf. on Linux Clusters: The HPC Revolution', Urbana, Illinois, USA.
25. Flajolet, P. & Puech, C. (1986), 'Partial match retrieval of multimedia data', Jour. of the ACM 33(2), 371-407. (Pubitemid 16533228)
26. Fredkin, E. (1960), 'Trie memory', Communications of the ACM 3(9), 490-499.
27. Frigo, M., Leiserson, C. E., Prokop, H. & Ramachandran, S. (1999), Cache-oblivious algorithms, in 'IEEE Symp. on the Foundations of Computer Science', IEEE Computer Society Press, p. 285.
28. Fu, J. W. C., Patel, J. H. & Janssens, B. L. (1992), Stride directed prefetching in scalar processors, in 'Proc. Annual ACM/IEEE MICRO Int. Symp. on Microarchitecture', IEEE Computer Society Press, pp. 102-110.
29. nd Annual Workshop on Duplicating, Deconstructing, and Debunking'.
30. Harman, D. (1995), Overview of the second text retrieval conference (TREC-2), in 'Proc. Second Text Retrieval Conference', Pergamon Press, Inc., pp. 271-289.
31. Heinz, S., Zobel, J. & Williams, H. E. (2002), 'Burst tries: A fast, efficient data structure for string keys', ACM trans. on Information Systems 20(2), 192-223. (Pubitemid 44642302)
32. Knuth, D. E. (1998), The Art of Computer Programming: Sorting and Searching, Vol. 3, second edn, Addison-Wesley.
33. Kumar, P. (2002), Cache oblivious algorithms., in 'Algorithms for Memory Hierarchies', Vol. 2625 of Lecture Notes in Computer Science, Springer- Verlag, pp. 193-212. (Pubitemid 36571371)
34. Ladner, R. E., Fortna, R. & Nguyen, B. (2002), A comparison of cache aware and cache oblivious static search trees using program instrumentation, in 'Experimental algorithmics: from algorithm design to robust and efficient software', Springer-Verlag, pp. 78-92. (Pubitemid 36136923)
35. Maly, K. (1976), 'Compressed tries', Communications of the ACM 19(7), 409-415.
36. McCreight, E. M. (1976), 'A space-economical suffix tree construction algorithm', Jour. of the ACM 23(2), 262-271.
37. Meyer, U., Sanders, P. & Sibeyn, J. F., eds (2003), Algorithms for Memory Hierarchies, Vol. 2625 of Lecture Notes in Computer Science, Springer- Verlag.
38. Ramakrishna, M. V. & Zobel, J. (1997), Performance in practice of string hashing functions, in 'Proc. Int. Symp. on Database Systems for Advanced Applications', World Scientific Press, Melbourne, Australia, pp. 215-223.
39. Rao, J. & Ross, K. A. (1999), Cache conscious indexing for decision-support in main memory, in 'Proc. VLDB Int. Conf. on Very Large Databases', Morgan Kaufmann, pp. 78-89.
40. Rao, J. & Ross, K. A. (2000), Making b+-trees cache conscious in main memory, in 'Proc. ACM- SIGMOD Int. Conf. on the Management of Data', ACM Press, New York, pp. 475-486.
41. Roth, A. & Sohi, G. S. (1999), Effective jump-pointer prefetching for linked data structures, in 'Proc. Int. Symp. on Computer Architecture', IEEE Computer Society Press, pp. 111-121.
42. Sedgewick, R. (1998), Algorithms in C, Addison- Wesley.
43. Severance, D. G. (1974), 'Identifier search mechanisms: A survey and generalized model', Proc. ACM Computer Science Conf. 6(3), 175-194.
44. Sinha, R., Ring, D. & Zobel, J. (2006), 'Cacheefficient string sorting using copying', ACM Jour. of Exp. Algorithmics 11(1.2).
45. Sinha, R. & Zobel, J. (2004), 'Cache-conscious sorting of large sets of strings with dynamic tries', ACM Jour. of Exp. Algorithmics 9(1.5).
46. Yang, C., Lebeck, A. R., Tseng, H. & Lee, C. (2004), 'Tolerating memory latency through push prefetching for pointer-intensive applications', ACM Trans. Architecture Code Optimisation 1(4), 445-475.
47. Zobel, J., Williams, H. E. & Heinz, S. (2001), 'In-memory hash tables for accumulating text vocabularies', Information Processing Letters 80(6), 271-277. (Pubitemid 33018683)