Optimal self-adjusting trees for dynamic string data in secondary storage

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

Volumn 4726 LNCS, Issue , 2007, Pages 184-194

  Ko, Pang ^a   Aluru, Srinivas ^a  

^a Iowa State University

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; PROBLEM SOLVING; QUERY LANGUAGES; SEARCH ENGINES;

BINARY SEARCH TREES; DYNAMIC STRING DATA; SECONDARY STORAGE;

OPTIMAL SYSTEMS;

EID: 38049048857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75530-2_17     Document Type: Conference Paper

References (13)

1. Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 24-35. Springer, Heidelberg (2006)
2. Bedathur, S., Haritsa, J.: Search-optimized suffix-tree storage for biological applications. In: Proc. 12th IEEE International Conference on High Performance Computing, pp. 29-39. IEEE Computer Society Press, Los Alamitos (2005)
3. Bell, J., 1 Gupta, G.: An evaluation of self-adjusting binary search tree techniques. Software - Practice and Experience 23(4), 369-382 (1993)
4. Brodai, G.S., Fagerberg, R.: Cache-oblivious string dictionaries. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 581-590. ACM Press, New York (2006)
5. Ciriani, V., Ferragina, P., Luccio, F., Muthukrishnan, S.: Static optimality theorem for external memory string access. In: Proc. 43rd Annual Symposium on Foundations of Computer Science, pp. 219-227 (2002)
6. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 383-391. ACM Press, New York (1996)
7. Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the ACM 47(6), 987-1011 (2000)
8. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 397-406. ACM Press, New York (2000)
9. Ko, P., Aluru, S.: Obtaining provably good performance from suffix trees in secondary storage. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 72-83. Springer, Heidelberg (2006)
10. Kurtz, S.: Reducing the space requirement of suffix trees. Software - Practice and Experience 29(13), 1149-1171 (1999)
11. Munro, J.I., Raman, V., Rao, S.S.: Space efficient suffix trees. J. Algorithms 39(2), 205-222 (2001)
12. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM 32(3), 652-686 (1985)
13. Williams, H.E., Zobel, J., Heinz, S.: Self-adjusting trees in practice for large text collections. Software - Practice and Experience 31(10), 925-939 (2001)