Suffix arrays are more efficient than inverted flies 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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Marín, M., & Navarro, G. (2003). Distributed query processing using suffix arrays. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2857, 311–325. https://doi.org/10.1007/978-3-540-39984-1_24
Mendeley helps you to discover research relevant for your work.