DocumentCode
3255044
Title
Parallel reduction of a chain query in distributed databases
Author
Zhang, Yanchun ; Orlowska, Maria E.
Author_Institution
Dept. of Comput. Sci., Queensland Univ., Brisbane, Qld., Australia
fYear
1992
fDate
28-30 May 1992
Firstpage
453
Lastpage
456
Abstract
This paper extends the results of P.A. Bernstein and D.W. Chiu (1981), P.A. Bernstein and N. Goodman (1981), and J.D. Ullman (1988), by constructing a parallel algorithm for a subset of tree queries called chain queries. An efficient parallel algorithm for a construction of full reducers for chain queries is presented and analyzed. The authors claim that the full reduction of a chain query can be done in parallel by executing only 2n-2 semijoins in the time required for an n-1 semijoins evaluation
Keywords
distributed databases; parallel algorithms; query processing; chain query; distributed databases; full reducers; parallel algorithm; parallel reduction; tree queries; Algorithm design and analysis; Australia; Computational efficiency; Computer science; Distributed databases; Distributed information systems; Parallel algorithms; Query processing; Relational databases; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Conference_Location
Toronto, Ont.
Print_ISBN
0-8186-2812-X
Type
conf
DOI
10.1109/ICCI.1992.227614
Filename
227614
Link To Document