Parallel Query Processing
Parallel Query Processing is a method in database systems that enables the simultaneous execution of query operations across multiple processors or nodes to improve performance and scalability by dividing and distributing query tasks.
501
Publications
25.8K
Citations
1.3K
Authors
367
Institutions
Publications per year
2017–2026
71
501
Web search for a planet: the google cluster architecture
Luiz André Barroso, Jay B. Dean, Urs Hölzle · IEEE Micro · 2003 · 1K citations
Sameer Agarwal, Barzan Mozafari, Aurojit Panda et al. · 2013 · 709 citations
Interpreting the Data: Parallel Analysis with Sawzall
Rob Pike, Sean Dorward, Robert Griesemer et al. · Scientific Programming · 2005 · 616 citations · Full text
1–5 of 501
1.3K
15
h-index
Institut national de recherche en sciences et technologies du numérique, France
13 publications · 823 citations
12
h-index
10
h-index
10
h-index
9
h-index
1–5 of 1.3K
367
University of Wisconsin–Madison
Madison, United States
20 h-index
68 publications
8.8K citations
IBM (United States)
Armonk, United States
20 h-index
78 publications
7.5K citations
Microsoft (United States)
Redmond, United States
14 h-index
40 publications
2.3K citations
University of California, Berkeley
Berkeley, United States
14 h-index
26 publications
4.9K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
14 h-index
30 publications
1.6K citations
University of Washington
Seattle, United States
13 h-index
37 publications
3.1K citations
IBM Research - Almaden
San Jose, United States
12 h-index
23 publications
970 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
11 h-index
35 publications
2.1K citations
1–8 of 367
PVLDB · 42 publications · 2.4K citations
27
h-index
19 publications · 693 citations
14
h-index
TKDE · 14 publications · 1.5K citations
12
h-index
TPDS · 11 publications · 217 citations
11
h-index
TODS · 10 publications · 545 citations
10
h-index
1–5