Distributed Query Optimization
Distributed Query Optimization is a query optimization technique that determines the most efficient execution plan for queries accessing data across multiple geographically dispersed nodes in a distributed database system, distinguishing itself by accounting for inter-node communication costs, data fragmentation, and network latency in addition to local processing costs.
185
Publications
10.2K
Citations
484
Authors
179
Institutions
Publications per year
2017–2026
16
Parents
185
The design of an acquisitional query processor for sensor networks
Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein et al. · 2003 · 937 citations
Cost-based query scrambling for initial delays
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg · 1998 · 213 citations
1–5 of 185
484
6
h-index
6
h-index
6
h-index
5
h-index
4
h-index
1–5 of 484
179
University of Maryland, College Park
College Park, United States
10 h-index
22 publications
1.6K citations
University of California, Berkeley
Berkeley, United States
9 h-index
22 publications
8.6K citations
University of Illinois Chicago
Chicago, United States
6 h-index
10 publications
294 citations
University of California, Riverside
Riverside, United States
5 h-index
12 publications
477 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
5 h-index
10 publications
753 citations
Aalborg University
Aalborg, Denmark
5 h-index
7 publications
322 citations
Honeywell (United States)
Charlotte, United States
4 h-index
6 publications
114 citations
Intel (United States)
Santa Clara, United States
4 h-index
4 publications
2.9K citations
1–8 of 179
TODS · 7 publications · 2.6K citations
7
h-index
PVLDB · 4 publications · 258 citations
4
h-index
TSE · 4 publications · 372 citations
4
h-index
3 publications · 200 citations
3
h-index
TKDE · 3 publications · 163 citations
3
h-index
1–5