• Aucun résultat trouvé

SimplePARQL: a New Approach Using Keywords Over SPARQL to Query the Web of Data

N/A
N/A
Protected

Academic year: 2022

Partager "SimplePARQL: a New Approach Using Keywords Over SPARQL to Query the Web of Data"

Copied!
1
0
0

Texte intégral

(1)

SimplePARQL: a New Approach Using Keywords Over SPARQL to Query the Web of Data

Sonia Djebali

De Vinci Technology Lab – ESILV Pôle Universitaire Léonard De Vinci

Paris La Défense, France

sonia.djebali@devinci.fr

Thomas Raimbault

De Vinci Technology Lab – ESILV Pôle Universitaire Léonard De Vinci

Paris La Défense, France

thomas.raimbault@devinci.fr

ABSTRACT

The SimplePARQL is a new and intuitive approach to query the Web of Data through existing SPARQL endpoints by using keywords in addition to SPARQL elements. Thus, the user is able to write more expressive pseudo-SPARQL queries where knowing the ontology (classes and proper- ties) and resources’ identifiers from an RDF base are not required. Concretely, a SimplePARQL query is transformed intoN valid SPARQL queries that extend the initial query in order to reach the IRIs or literals in the RDF bases cor- responding to keywords. We implemented our approach on the platformuniversal-endpoint.com, where SimplePAR- QL queries can be written and executed on different RDF bases at the same time; SPARQL queries are accepted too.

The full paper is included in the ACM Proceed- ings of the Research and Innovation Track of the SE- MANTICS2015 Conference (ACM 978-1-4503-3462- 4/15/09, DOI:http://dx.doi.org/10.1145/2814864.2814893).

Categories and Subject Descriptors

I.2.4 [Knowledge Representation Formalisms & Meth- ods]; H.3.3 [Information Search and Retrieval]: Query formulation, Search process; H.5.2 [Information interface]

.

43

Références

Documents relatifs

une  éducation  thérapeutique  (Promrat  et  al.,  2010).  La  perte  de  poids  était  de  9,3 

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Using this gold standard, our experiments show that although features based on static characteristics of the query and statistics of changes in the data for individual predicates

While the IRIs returned by an edge label mapping are used as predicates of triples (see function e c,g in Definition 3.2 and, for instance, set G e in Example 3.2), a node label

SQCFrame- work is able to generate customized SPARQL containment benchmarks from real SPARQL query logs.. To this end, the framework makes use of different

In this paper, we propose Snob, an approach for executing SPARQL queries over a network of browsersWe assume that browsers are connected in an un- structured network based on

In order to illustrate our language of abstract queries, and show its expressive power, we show below the table query T for the complex use case (C) of Section 2. ) T 0 is the

Mapping SPARQL Query to temporal logic query based on NµSMV Model Checker to Query Semantic Graphs.. Mahdi Gueffaz, Sylvain Rampacek,