Paper Info
Title
Reverse Engineering SPARQL Queries.
Abstract
Semantic Web systems provide open interfaces for end-users to access data via a powerful high-level query language, SPARQL. But users unfamiliar with either the details of SPARQL or properties of the target dataset may find it easier to query by example -- give examples of the information they want (or examples of both what they want and what they do not want) and let the system reverse engineer the desired query from the examples. This approach has been heavily used in the setting of relational databases. We provide here an investigation of the reverse engineering problem in the context of SPARQL. We first provide a theoretical study, formalising variants of the reverse engineering problem and giving tight bounds on its complexity. We next explain an implementation of a reverse engineering tool for positive examples. An experimental analysis of the tool shows that it scales well in the data size, number of examples, and in the size of the smallest query that fits the data. We also give evidence that reverse engineering tools can provide benefits on real-life datasets.
Year
DOI
Venue
2016
10.1145/2872427.2882989
WWW
Field
DocType
Citations 
Data mining,Query language,World Wide Web,RDF query language,Relational database,Information retrieval,Computer science,Reverse engineering,SPARQL,Query by Example,Named graph,RDF
Conference
10
PageRank 
References 
Authors
0.61
14
3
Name
Order
Citations
PageRank
Marcelo Arenas12618193.91
Gonzalo I. Diaz2292.72
Egor V. Kostylev321826.04