On the complexity of generating optimal left-deep processing trees with cross products-Reference-Cited by-同舟云学术

On the complexity of generating optimal left-deep processing trees with cross products

Published:1995 Issue: Volume: Page:54-67
ISSN:0302-9743
Container-title:Database Theory — ICDT '95
language:
Short-container-title:

Author:

Cluet Sophie,Moerkotte Guido

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58907-4_6.pdf

Reference6 articles.

1. Garey, J., Johnson, D.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

2. Ibaraki, T., Kameda, T.: Optimal Nesting for computing n-Relational Joins. ACM. Trans. on Database Systems, 9(3) (1984) 482–502

3. Krishnamurthy, R., Boral, H., Zaniolo, C.: Optimization of Nonrecursive Queries. Proc. Int. Conf. Very Large Databases (VLDB), (1986), 128–137

4. Monma, C., Sidney, J.: Sequencing with Series-Parallel Precedence Constraints. Math. Oper. Res,. 4 (1979), 215–224

5. Ono, K., Lohman, G.: Measuring the Complexity of Join Enumeration in Query Optimization. Proc. Int. Conf. Very Large Databases (VLDB), (1990), 314–325

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust Join Processing with Diamond Hardened Joins;Proceedings of the VLDB Endowment;2024-07

2. ROME: Robust Query Optimization via Parallel Multi-Plan Execution;Proceedings of the ACM on Management of Data;2024-05-29

3. Communication-Avoiding Recursive Aggregation;2023 IEEE International Conference on Cluster Computing (CLUSTER);2023-10-31

4. Efficiently Computing Join Orders with Heuristic Search;Proceedings of the ACM on Management of Data;2023-05-26

5. Join Ordering of SPARQL Property Path Queries;The Semantic Web;2023