Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
Full metadata record
|dc.identifier.citation||World Wide Web, 2018; 21(4):1015-1035||en|
|dc.description.abstract||One of the challenges of managing an RDF database is predicting performance of SPARQL queries before they are executed. Performance characteristics, such as the execution time and memory usage, can help data consumers identify unexpected long-running queries before they start and estimate the system workload for query scheduling. Extensive works address such performance prediction problem in traditional SQL queries but they are not directly applicable to SPARQL queries. In this paper, we adopt machine learning techniques to predict the performance of SPARQL queries. Our work focuses on modeling features of a SPARQL query to a vector representation. Our feature modeling method does not depend on the knowledge of underlying systems and the structure of the underlying data, but only on the nature of SPARQL queries. Then we use these features to train prediction models. We propose a two-step prediction process and consider performances in both cold and warm stages. Evaluations are performed on real world SPRAQL queries, whose execution time ranges from milliseconds to hours. The results demonstrate that the proposed approach can effectively predict SPARQL query performance and outperforms state-of-the-art approaches.||en|
|dc.description.statementofresponsibility||Wei Emma Zhang, Quan Z. Sheng, Yongrui Qin, Kerry Taylor, Lina Yao||en|
|dc.rights||© Springer Science+Business Media, LLC 2017||en|
|dc.subject||SPARQL; feature modelling; prediction; query performance||en|
|dc.title||Learning-based SPARQL query performance modeling and prediction||en|
|pubs.library.collection||Computer Science publications||en|
|dc.identifier.orcid||Zhang, W. [0000-0002-0406-5974]||en|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.