Abstract
The execution time prediction for query tasks in graph database has become difficult and challenging due to the complexity of query plan and system. It is difficult for Database Administrators (DBA) or Database Management System (DBMS) to catch the accurate execution time during and before the execution of a query task. Before executing a query task, predicting its execution time can help the DBA or DBMS to efficiently management in the fields of load management, task scheduling, permission control, progress monitoring, system scale customization, etc. Therefore, accurately and efficiently predicting the execution time for query tasks is a key technology in these fields. In this paper, motivated by the combination of artificial intelligence technologies and graph database theories, we first propose a novel deep learning method to predict the execution time for query tasks in graph database. First, each query plan tree of tasks is encoded into an operation sequence. Second, top-20 features are selected from 68 candidate system features using random forest (RF), and the selected top-20 features are reduced to five principal components using principal component analysis (PCA). Finally, an accurate and efficient model based on the long short-term memory (LSTM) is designed and implemented to predict the execution time. The model can predict the execution time in advance before executing a query task in graph database. The experimental results from six kinds of benchmarks with the public data set Yelp show that the average accuracy of the proposed model can reach 81.34% with a high prediction efficiency rate, which proves the feasibility of the deep learning method. In particular, the proposed model can achieve the state-of-the-art prediction performance for query task execution time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.