Database Paper Browser

Back to papers

Reducing Multidatabase Query Response Time By Tree Balancing

Summary: Two-phase optimization for multidatabase queries: build an optimal left-deep join tree, then balance with simple transformations for lower latency. Balancing lowers response time and resource use for sort-merge/hash-join plans, with low overhead. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2808
Venue
SIGMOD
Year
1995
Pagerank
5.9717332e-05
Overall Rank
4,722 | 67.16%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
456 Cost-based Query Scrambling for Initial Delays 1998 SIGMOD 0.00022717134
4,202 Cost Models DO Matter: Providing Cost Information for Diverse Data Sources in a Federated System 1999 VLDB 6.36184e-05
4,511 Of Snowstorms and Bushy Trees 2014 VLDB 6.1247645e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers