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. To the best of our knowledge, this form of query processing has not been investigated so far. Empirical results obtained from natural language text on a cluster of PCs show that the proposed algorithms are efficient in practice. The model of computing we have adopted make those algorithms suitable for any other parallel architecture.