Generating SPARQL queries using templates

  • Authors:

  • Saeedeh Shekarpour;Sören Auer;Axel-Cyrille Ngonga Ngomo;Daniel Gerber;Sebastian Hellmann;Claus Stadler

  • Affiliations:

  • Universität Leipzig, Institut für Informatik, D-04103 Leipzig, Germany. E-mail: {shekarpour,auer,ngonga,gerber,hellmann,stadler}@informatik.uni-leipzig.de;Universität Leipzig, Institut für Informatik, D-04103 Leipzig, Germany. E-mail: {shekarpour,auer,ngonga,gerber,hellmann,stadler}@informatik.uni-leipzig.de;Universität Leipzig, Institut für Informatik, D-04103 Leipzig, Germany. E-mail: {shekarpour,auer,ngonga,gerber,hellmann,stadler}@informatik.uni-leipzig.de;Universität Leipzig, Institut für Informatik, D-04103 Leipzig, Germany. E-mail: {shekarpour,auer,ngonga,gerber,hellmann,stadler}@informatik.uni-leipzig.de;Universität Leipzig, Institut für Informatik, D-04103 Leipzig, Germany. E-mail: {shekarpour,auer,ngonga,gerber,hellmann,stadler}@informatik.uni-leipzig.de;Universität Leipzig, Institut für Informatik, D-04103 Leipzig, Germany. E-mail: {shekarpour,auer,ngonga,gerber,hellmann,stadler}@informatik.uni-leipzig.de

  • Venue:
  • Web Intelligence and Agent Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The search for information on the Web of Data is becoming increasingly difficult due to its considerable growth. Especially novice users need to acquire both knowledge about the underlying ontology structure and proficiency in formulating formal queries e.g. SPARQL queries to retrieve information from Linked Data sources. So as to simplify and automate the querying and retrieval of information from such sources, this paper presents an approach for constructing SPARQL queries based on user-supplied keywords. Our approach utilizes a set of predefined basic graph pattern templates for generating adequate interpretations of user queries. This is achieved by obtaining ranked lists of candidate resource identifiers for the supplied keywords and then injecting these identifiers into suitable positions in the graph pattern templates. The main advantages of our approach are that it is completely agnostic of the underlying knowledge base and ontology schema, that it scales to large knowledge bases and is simple to use. We evaluate all 17 possible valid graph pattern templates by measuring their precision and recall on 53 queries against DBpedia. Our results show that 8 of these basic graph pattern templates return results with a precision above 70%. Our approach is implemented as a Web search interface and performs sufficiently fast to provide answers within an acceptable time frame even when used on large knowledge bases.