Rapid bushy join-order optimization with Cartesian products
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Iterative dynamic programming: a new class of query optimization algorithms
ACM Transactions on Database Systems (TODS)
Measuring the Complexity of Join Enumeration in Query Optimization
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Join Enumeration in a Memory-Constrained Environment
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Optimizing complex queries based on similarities of subqueries
Knowledge and Information Systems
Dynamic programming strikes back
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A direct algorithm to find a largest common connected induced subgraph of two graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
| Hi-index | 0.00 |
In this paper, we revisit the problem of query optimization in relational DBMS. We propose a scheme to reduce the search space of Dynamic Programming based on reuse of query plans among similar subqueries. The method generates the cover set of similar subgraphs present in the query graph and allows their corresponding subqueries to share query plans among themselves in the search space. Numerous variants to this scheme have been developed for enhanced memory efficiency. Our implementation and experimental study in PostgreSQL show that one of the schemes is better suited to improve the performance of (Iterative) Dynamic Programming.