Suffix tree construction algorithms on modern hardware

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 263-274

  Tsirogiannis, Dimitris ^a   Koudas, Nick ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Multi core; Suffix tree

Indexed keywords

CACHE PARTITIONING; CACHE PERFORMANCE; CACHE-CONSCIOUS; COMPRESSION TECHNIQUES; DIFFERENT DOMAINS; EXPERIMENTAL EVALUATION; INDEXING STRUCTURES; MULTI CORE; ON-CHIP PARALLELISM; PROCESSING ELEMENTS; STRING PROCESSING ALGORITHMS; SUFFIX-TREES; TEXT DATA; TRADE SPACE;

DATABASE SYSTEMS; INDEXING (MATERIALS WORKING); TECHNOLOGY;

ALGORITHMS;

EID: 77952285612     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739075     Document Type: Conference Paper

References (29)

1. A. Apostolico and W. Szpankowski. Self-alignment in words and their applications. J. Algorithms, 13:446-467, 1992.
2. S. J. Bedathur and J. R. Haritsa. Engineering a fast online persistent suffix tree construction. In ICDE, page 720, 2004.
3. P. Bieganski. Genetic sequence data retrieval and manipulation based on generalized suffix trees. PhD thesis, University of Minnesota, 1995.
4. A. M. Carvalho, A. L. Oliveira, A. T. Freitas, and M.-F. Sagot. A parallel algorithm for the extraction of structured motifs. In SAC, pages 147-153, 2004.
5. C. Chen and B. Schmidt. Constructing large suffix trees on a computational grid. Journal of Parallel and Distributed Computing, 66(12):1512-1523, 2006.
6. S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Inspector joins. In VLDB, pages 817-828, 2005.
7. C.-F. Cheung, J. X. Yu, and H. Lu. Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE TKDE, 17(1):90-105, 2005.
8. J. Cieslewicz and K. A. Ross. Adaptive aggregation on chip multiprocessors. In VLDB, pages 339-350, 2007.
9. I. Coorporation. Intel 64 and IA-32 architectures optimization reference manual, May 2009.
10. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. On the sorting-complexity of suffix tree construction. J. ACM, 47(6):987-1011, 2000.
11. B. Gedik, R. R. Bordawekar, and P. S. Yu. Cellsort: high performance sorting on the cell processor. In VLDB, pages 1286-1297, 2007.
12. A. Ghoting and K. Makarychev. Serial and parallel methods for I/O efficient suffix tree construction. In SIGMOD '09, pages 827-840, 2009.
13. R. Giegerich, S. Kurtz, and J. Stoye. Efficient implementation of lazy suffix trees. Software - Practice and Experience, 33:1035-1049, 2003.
14. D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, 1997.
15. R. Hariharan. Optimal parallel suffix tree construction. In STOC, pages 290-299, 1994.
16. E. Hunt, M. P. Atkinson, and R. W. Irving. A database index to large biological sequences. In VLDB, pages 139-148, 2001.
17. J. Kärkkäinen and E. Ukkonen. Sparse suffix trees. In COCOON, pages 219-230, 1996.
18. A. Konig, K. Church, and M. Markov. A data structure for sponsored search. In ICDE, pages 90-101, 2009.
19. S. Kurtz. Reducing the space requirement of suffix trees. Softw. Pract. Exper., 29(13):1149-1171, 1999.
20. G. Landau, B. Schiever, and U. Vishkin. Parallel construction of a suffix tree. Lecture Notes in Computer Science, 267:314-325, 1987.
21. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262-272, 1976.
22. B. Phoophakdee and M. J. Zaki. Genome-scale disk-based suffix tree indexing. In SIGMOD, pages 833-844, 2007.
23. J. Rao and K. A. Ross. Making B+- trees cache conscious in main memory. SIGMOD Rec., 29(2):475-486, 2000.
24. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization (extended summary). pages 111-123, 1988.
25. A. Shatdal, C. Kant, and J. F. Naughton. Cache conscious algorithms for relational query processing. In VLDB, pages 510-521, 1994.
26. Y. Tian, S. Tata, R. A. Hankins, and J. M. Patel. Practical methods for constructing suffix trees. The VLDB Journal, 14(3):281-299, 2005.
27. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
28. P. Weiner. Linear pattern matching algorithms. In In Proceedings of the 14th Annual Symposium on Switching and Automata Theory, IEEE, 1973.
29. M. Yue. A simple proof of the inequality ffd(1) < (11/9)opt(1) + 1, for all l, for the ffd bin-packing algorithm. Acta Mathematicae Applicatae Sinica, 7:321-331, 1991.