Expressive and Scalable Query-Based Faceted Search over SPARQL Endpoints - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Expressive and Scalable Query-Based Faceted Search over SPARQL Endpoints

(1)
1

Abstract

Linked data is increasingly available through SPARQL endpoints, but exploration and question answering by regular Web users largely remain an open challenge. Users have to choose between the expressivity of formal languages such as SPARQL, and the usability of tools based on navigation and visualization. In a previous work, we have proposed Query-based Faceted Search (QFS) as a way to reconcile the expressivity of formal languages and the usability of faceted search. In this paper, we further reconcile QFS with scalability and portability by building QFS over SPARQL endpoints. We also improve expressivity and readability. Many SPARQL features are now covered: multidimensional queries, union, negation, optional, filters, aggregations, ordering. Queries are now verbalized in English, so that no knowledge of SPARQL is ever necessary. All of this is implemented in a portable Web application, Sparklis 1.1 , and has been evaluated on many endpoints and questions.
Fichier principal
Vignette du fichier
main.pdf (372.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01100313 , version 1 (06-01-2015)

Identifiers

Cite

Sébastien Ferré. Expressive and Scalable Query-Based Faceted Search over SPARQL Endpoints. Semantic Web (ISWC), Oct 2014, Riva del Garda, Italy. pp.438 - 453, ⟨10.1007/978-3-319-11915-1_28⟩. ⟨hal-01100313⟩
317 View
405 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More