A fast distributed suffix array generation algorithm

String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

Volumn , Issue , 1999, Pages 97-104

  Kitajima, Joao Paulo ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; INFORMATION RETRIEVAL;

EXPERIMENTAL EVIDENCE; HIGH-BANDWIDTH NETWORKS; SEQUENTIAL ALGORITHM; SUFFIX ARRAYS;

GROUPWARE;

EID: 35048898252     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1999.796583     Document Type: Conference Paper

References (16)

1. A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347 365, 1988.
2. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.
3. G. H. Gonnet, R. A. Baeza-Yates, and T. Snider. New indices for text: Pxi trees and PXI arrays. In Information Retrieval Data Structures 1 AlyOithifls, pages 66 82. Prentice-Hall, 1992.
4. D. Gusfield. Algorithms on Strings, Trees, and Sequences-Computer Science and Computaional Biology. Cambridge University Press, 1997.
5. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 2nd edition, 1996.
6. J. Jájá, K. W. Ryu, and U. Vishkin. Sorting strings and constructing digital search trees in parallel. Theor. Comp. Sci., 154(2):225 245, 1996.
7. J. Kitajima, G. Navarro, B. Ribeiro, and N. Ziviani. Distributed generation of suffix arrays: A quicksort-based approach. In Proc. WSP'9'7, pages 53 69. Carleton University Press, 1997.
8. J. Kitajima, B. Ribeiro, and N. Ziviani. Network and memory analysis in distributed parallel generation of PAT arrays. In Proc. 8th Brazilian Symp. on Comp. Arch.-High-Performance Processing, pages 193 202. Brazilian Comp. Soc., 1996.
9. D. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973.
10. U. Manber and E. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, pages 935 948, Oct. 1993.
11. G. Navarro, J. Kitajima, B. Ribeiro, and N. Ziviani. Distributed generation of suffix arrays. In Proc. CPM'9'7, LNCS 1264, pages 102 115, 1997.
12. B. Ribeiro, J. Kitajima, G. Navarro, C. SantAna, and N. Ziviani. Parallel generation of inverted lists for distributed text collections. In Proc. SCCC'98, pages 149 157. IEEE CS Press, 1998.
13. K. Sadakane. A fast algorithm for making suffix arrays and for burrows-wheeler transformation. In Proc. DCC'98, pages 129 138, 1998.
14. W. Szpankowski. Probabilistic analysis of generalized suffix trees. In Proc. CPM'92, pages 1 14, 1992. LNCS 644.
15. T. Tabe, J. Hardwick, and Q. Stout. Statistical analysis of communication time on the IBM 5P2. Comp. Sci. and Statistics, 27:347 351, 1995.
16. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes. Van Nostrand Reinhold, New York, 1994.