Making linked-data accessible: A review

Linked-Data (LD) is a paradigm that utilises the RDF triplestore to describe numerous pieces of knowledge linked together. When an entity is retrieved in LD, its associated data becomes instantly obtainable. SPARQL is the query language that allows users to access LD. On the other hand, SPARQL has a complicated syntax that necessitates previous knowledge. Thus, in order to encourage the end-users to use LD, it is crucial to allow them to obtain the data efficiently, in addition to improving their overall experience. Instead of manually constructing SPARQL queries, this paper investigates and reviews existing methods in which LD can be accessed using various tools and techniques, including query builders, visualisation approaches, and several LD applications. We then identify gaps within the literature and highlight future research directions

The SPARQLING system for SPARQL queries over GRAPHOL ontologies

In this demo we present the SPARQLING system for SPARQL query building based on the GRAPHOL visual language for ontologies. The characterizing feature of SPARQLING is the idea to preserve and take advantage of the native diagrammatic representation of GRAPHOL ontologies, allowing the user to navigate it, and to construct a graph-based representation of the query over it through a simple point-and-click mechanism. The system then automatically transforms the graphical query into the SPARQL syntax