Reducing Multidatabase Query Response Time by Tree Balancing.
Ming-Chien Shan
Umeshwar Dayal
Weimin Du
ACM SIGMOD Conference
1995
24
2
293
303
1122 KB
Execution of multidatabase queries differs from that of traditional queries in that sort merge and hash joins are more often favored, as nested loop join requires repeated accesses to external data sources. As a consequence, left deep join trees obtained
Information Systems, DATABASE MANAGEMENT, Systems, Query processing.
Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
Mathematics of Computing, NUMERICAL ANALYSIS, Optimization.
Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.
F.2.2
Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching.
G.1.6
Mathematics of Computing, NUMERICAL ANALYSIS, Optimization.
G.2.2
Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
H.2.4
Information Systems, DATABASE MANAGEMENT, Systems, Query processing.