Distributed Query Processing Using Suffix Arrays

  • Mauricio Marín
  • Gonzalo Navarro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2857)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mauricio Marín
    • 1
    • 3
  • Gonzalo Navarro
    • 2
    • 3
  1. 1.Dept. of Computer ScienceUniversity of Magallanes 
  2. 2.Dept. of Computer ScienceUniversity of Chile 
  3. 3.Center for Web Research 

Personalised recommendations