A novel query execution time prediction approach based on operator iterate-aware of the execution plan on the graph database

Query execution time prediction is essential for database query optimization tasks, such as query scheduling, progress monitoring, and resource allocation. In the query execution time prediction tasks, the query plan is often used as the modeling object of a prediction model. Although the learning-based prediction models have been proposed to capture plan features, there are two limitations need to be considered more. First, the parent-child dependencies between plan operators can be captured, but the operator's branch independence cannot be distinguished. Second, each operator's output row is its following operator input, but the data iterate transfer operations between operators are ignored. In this study, we propose a graph query execution time prediction model containing a plan module, a query module, a plan-query module, and a prediction module to improve prediction effectiveness. Specifically, the plan module is used to capture the data iterate transfer operations and distinguish independent of branch operators; the query module is used to learn features of query terms that have an influence on the composition of operators; the plan-query interaction module is used to learn the logical correlations of plan and query. The experiment on datasets proves the effectiveness of the operator iterate-aware and query-plan interaction method in our proposed graph query execution prediction model.