Database Paper Browser

Back to papers

Adaptively Parallelizing Distributed Range Queries

Summary: Adaptive parallelism for distributed range queries tunes per-query parallelism and assignment to minimize disk contention. Query selectivity, client load, and bandwidth guide per-query optimum, with tunable policies (short/long, high/low) in PNUTS. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9854
Venue
VLDB
Year
2009
Pagerank
4.1945683e-05
Overall Rank
12,330 | 14.23%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,574 PNUTS to Sherpa: Lessons from Yahoo!'s Cloud Database 2019 VLDB 4.3252874e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
21 C-Store: A Column-oriented DBMS 2005 VLDB 0.00086087497
53 PNUTS: Yahoo!'s Hosted Data Serving Platform 2008 VLDB 0.00066144767
236 High-Performance Sorting on Networks of Workstations 1997 SIGMOD 0.00031779642
1,347 Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems 2004 VLDB 0.00012456657
1,857 An Overview of DB2 Parallel Edition 1995 SIGMOD 0.00010304962
6,516 (Almost) Optimal Parallel Block Access for Range Queries 2000 PODS 5.0321577e-05
Previous Page 1 / 1 Next

Semantically Similar Papers