DBScholar

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
h57c19aef9f25e29e
Venue
SIGMOD
Year
1995
Pagerank
6.316759e-05
Overall Rank
5,008 | 66.33%
DOI
10.1145/223784.223846

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{du_sigmod95,
        title = {{Reducing Multidatabase Query Response Time By Tree Balancing}},
        author = {Du, Weimin and Shan, Ming-Chien and Dayal, Umeshwar},
        series = {{SIGMOD} '95},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/223784.223846},
        url = {https://dl.acm.org/doi/10.1145/223784.223846},
        year = {1995}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
424 Cost-based Query Scrambling for Initial Delays 1998 SIGMOD 0.0001848836
4,052 Of Snowstorms and Bushy Trees 2014 VLDB 6.8283077e-05
4,773 Cost Models DO Matter: Providing Cost Information for Diverse Data Sources in a Federated System 1999 VLDB 6.4212044e-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