A Machine Learning Approach to SPARQL Query Performance Prediction
Authors:
- Rakebul HasanRHRakebul Hasan
- Fabien GandonFGFabien Gandon
- 1 August 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 266-273
Abstract
In this paper we address the problem of predicting SPARQL query performance. We use machine learning techniques to learn SPARQL query performance from previously executed queries. Traditional approaches for estimating SPARQL query cost are based on statistics about the underlying data. However, in many use-cases involving querying Linked Data, statistics about the underlying data are often missing. Our approach does not require any statistics about the underlying RDF data, which makes it ideal for the Linked Data scenario. We show how to model SPARQL queries as feature vectors, and use k-nearest neighbors regression and Support Vector Machine with the nu-SVR kernel to accurately predict SPARQL query execution time.Keywords
This publication has 20 references indexed in Scilit:
- A Novel Software Toolkit for Graph Edit Distance Computation2013
- Robust and scalable Linked Data reasoning incorporating provenance and trust annotationsJournal of Web Semantics, 2011
- LIBSVMACM Transactions on Intelligent Systems and Technology, 2011
- The WEKA data mining softwareACM SIGKDD Explorations Newsletter, 2009
- Approximate graph edit distance computation by means of bipartite graph matchingImage and Vision Computing, 2009
- RAL: An Algebra for Querying RDFWorld Wide Web, 2004
- Improvements to the SMO algorithm for SVM regressionIEEE Transactions on Neural Networks, 2000
- An Introduction to Kernel and Nearest-Neighbor Nonparametric RegressionThe American Statistician, 1992
- Instance-based learning algorithmsMachine Learning, 1991
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977