Abstract

We present LSQ, an algorithm learning SPARQL queries from a subset of expected results. The algorithm leverages grouping, aggregates and inline values of SPARQL 1.1 in order to move most of the complex computations to a SPARQL endpoint. It operates by building and testing hypotheses expressed as SPARQL queries and uses active learning to collect a small number of learning examples from the user. We provide an open-source implementation and an on-line interface to test the algorithm. In the experimental evaluation, we use real queries posed in the past to the official DBpedia SPARQL endpoint, and we show that the algorithm is able to learn them, 82

Keywords

Cite this article

@article{cai-4212,
  author  = {Jedrzej Potoniec},
  title   = {Learning SPARQL Queries from Expected Results},
  journal = {Computing and Informatics},
  volume  = {38},
  number  = {3},
  pages   = {679--700},
  year    = {2019},
  issn    = {1335-9150},
  doi     = {10.31577/cai_2019_3_679}
}
Download .bib