String Search in Coarse-Grained Parallel Computers

Algorithmica (New York)

Volumn 24, Issue 3, 1999, Pages 177-194

  Ferragina, P ^a   Luccio, F ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

BSP model; Computational complexity; Distributed data structures; Parallel computing; String matching

Indexed keywords

EID: 0004473087     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008259     Document Type: Article

References (28)

1. A. Amir and M. Farach. Adaptive dictionary matching. In Proc. of the 32nd IEEE Symposium on Foundations of Computer Science, pp. 760-766, 1991.
2. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words. NATO ASI Series F: Computer and System Sciences, Springer-Verlag, New York, 1985, pp. 85-96.
3. A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347-365, 1988.
4. L. Arge, P. Ferragina, R. Grossi and J. S. Vitter. On sorting strings in external memory. In Proc. of the 29th ACM Symposium on the Theory of Computing, pp. 540-548, 1997.
5. A. Bäumker, W. Dittrich and F. Meyer auf der Heide. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Proc. of the 3rd European Symposium on Algorithms, pp. 17-30. Lecture Notes in Computer Science 979, Springer-Verlag, Berlin, 1995.
6. A. Bäumker, W. Dittrich and A. Pietracaprina. The deterministic complexity of parallel multisearch. In Proc. of the 5th Scandinavian Workshop on Algorithmic Theory, pp. 404-415. Lecture Notes in Computer Science 1097, Springer-Verlag, Berlin, 1996.
7. R. Baeza-Yates, E. F. Barbosa and N. Ziviani. Hierarchies of indices for text searching. Information Systems, 21(6), 497-514, 1996.
8. D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proc. of the 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 383-391, 1996.
9. F. Dehne, W. Dittrich and D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. In Proc. of the 9th ACM Symposium on Parallel Algorithms and Architectures, pp. 106-115, 1997.
10. F. Dehne, A. Fabri and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379-400, 1996.
11. M. Farach. Optimal suffix tree construction with large alphabets. In Proc. of the 38th IEEE Symposium on Foundations of Computer Science, pp. 137-143, 1997.
12. P. Ferragina and R. Grossi. A fully-dynamic data structure for external substring search. In Proc. of the 21th ACM Symposium on the Theory of Computing, pp. 693-702, 1995. Full version available in http://www.di.unipi.it/~ferragin.
13. P. Ferragina and R. Grossi. Fast string searching in secondary storage: theoretical developments and experimental results. In Proc. of the 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 373-382, 1996. Full version available in http://www.di.unipi.it/~ferragin.
14. P. Ferragina and F. Luccio. Multi-string search in BSP. In Proc. of Compression and Complexity of Sequences 1997, pp. 240-252. IEEE Computer Society, Los Alamitos, CA, 1998.
15. A. E. Fox et al. Special issue on "Digital Libraries." Communications of the ACM, 38, 1995.
16. Z. Galil. A constant-time optimal parallel string-matching algorithm. Journal of the ACM, 42(4):908-918, 1995.
17. A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):251-267, 1994.
18. T. Goodrich. Communication-efficient parallel sorting. In Proc. of the 28th ACM Symposium on the Theory of Computing, pp. 247-256, 1996.
19. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
20. J. JáJá and K. W. Ryu. The block distributed memory model. IEEE Transactions on Parallel and Distributed Systems, 7(8):830-840, 1996.
21. R. Karp, R. Miller and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. In Proc. of the 4th ACM Symposium on the Theory of Computing, pp. 125-136, 1972.
22. D. E. Knuth. The Art of Computer Programming: Sorting and Searching, Vol. 3. Addison-Wesley, Reading, MA, 1969.
23. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993
24. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976.
25. S. Muthukrishnan and K. Palem. Highly efficient dictionary matching in parallel. In Proc. of the 5th ACM Symposium on Parallel Algorithms and Architectures, pp. 69-78, 1993.
26. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, New York, 1983.
27. L. G. Valiant. A bridging model for parallel computing. Communications of the ACM, 33:103-111, 1990.
28. J. S. Vitter and E. A. Shriver. Algorithms for parallel memory, I: Two-level memories. Algorithmica 12:110-147, 1994.