Abstract
Suffix arrays are more efficient than inverted files for solving complex queries in a number of applications related to text databases. Examples arise when dealing with biological or musical data or with texts written in oriental languages, and when searching for phrases, approximate patterns and, in general, regular expressions involving separators. In this paper we propose algorithms for processing in parallel batches of queries upon distributed text databases. We present efficient alternatives for speeding up query processing using distributed realizations of suffix arrays. Empirical results obtained from natural language text on a cluster of PCs show that the proposed algorithms are efficient in practice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
MacFarlane, A.A., McCann, J.A., Robertson, S.E.: Parallel search using partitioned inverted files. In: 7th International Symposium on String Processing and Information Retrieval, pp. 209–220 (2000)
Santos Badue, C., Baeza-Yates, R., Ribeiro-Neto, B., Ziviani, N.: Concurrent query processing using distributed inverted files. In: 8th International Symposium on String Processing and Information Retrieval, pp. 10–20 (2001)
Baeza, R., Ribeiro, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)
Chung, S.H., Kwon, H.C., Ryu, K.R., Jang, H.K., Kim, J.H., Choi, C.A.: Parallel information retrieval on a SCI-based PC-NOW. In: Workshop on Personal Computers based Networks of Workstations (PC-NOW 2000), Springer, Heidelberg (2000)
Ferragina, P., Luccio, F.: String search in coarse-grained parallel computers. Algorithmica 24, 177–194 (1999)
Kitajima, J., Navarro, G.: A fast distributed suffix array generation algorithm. In: 6th International Symposium on String Processing and Information Retrieval, pp. 97–104 (1999)
McColl, W.F.: General purpose parallel computing. In: Gibbons, A.M., Spirakis, P. (eds.) Lectures on Parallel Computation, pp. 337–391. Cambridge University Press, Cambridge (1993)
Navarro, G., Kitajima, J., Ribeiro, B., Ziviani, N.: Distributed generation of suffix arrays. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 102–115. Springer, Heidelberg (1997)
Ribeiro, B., Kitajima, J., Navarro, G., Santana, C., Ziviani, N.: Parallel generation of inverted lists for distributed text collections. In: XVIII Conference of the Chilean Computer Science Society, pp. 149–157 (1998)
Skillicorn, D.B., Hill, J.M.D., McColl, W.F.: Questions and answers about BSP. Technical Report PRG-TR-15-96, Computing Laboratory, Oxford University (1996); Also in Journal of Scientific Programming 6(3) (1997)
Skillicorn, D.B., Talia, D.: Models and languages for parallel computation. ACM Computing Surveys 20(2) (1998)
Valiant, L.G.: A bridging model for parallel computation. Comm. ACM 33, 103–111 (1990)
BSP World-wide Standard, http://www.bsp-worldwide.org
BSP PUB Library at Paderborn University, http://www.uni-paderborn.de/bsp
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marín, M., Navarro, G. (2003). Distributed Query Processing Using Suffix Arrays. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds) String Processing and Information Retrieval. SPIRE 2003. Lecture Notes in Computer Science, vol 2857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39984-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-39984-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20177-9
Online ISBN: 978-3-540-39984-1
eBook Packages: Springer Book Archive