Efficient Processing Regular Queries In Shared-Nothing Parallel Database Systems Using Tree- And Structural Indexes

Download Now
Provided by: RWTH Aachen University
Format: PDF
In this paper, the authors introduce and study an efficient regular queries processing algorithm on a very large XML (eXtensible Markup Language) data set which is fragmented and stored on different machines. The machines are connected by the high speed interconnection. In this system the efficiency of a query processing algorithm depends on two main factors: the waiting time for the answer and the total query processing and communication cost over all machines of the system. In the partial processing approach, the query is sent to and partially evaluated at each server in parallel.
Download Now

Find By Topic