Resumen:
Flexible Aggregation in FSA-SPARQL

Fecha

2021-09-22

Editor

Sistedes

Publicado en

Actas de las XX Jornadas de Programación y Lenguajes (PROLE 2021)

Licencia

CC BY-NC-ND 4.0

Resumen

Aggregation is a very useful operation in database query languages. Through count, sum, min, max and avg operators database instances can be counted and summarized. Attached to such operators, group by and having clauses make it possible to define partitions on database instances as well as filter partitions according to Boolean conditions. In this paper, we define aggregation operators for the language FSA-SPARQL, which is a fuzzy extension of the Semantic Web query language SPARQL. We present the semantics of such operators with regard to fuzzy RDF triple patterns. We also provide mechanisms in FSA-SPARQL for the partition of fuzzy RDF triple patterns with regard to fuzzy sets, as well as for the filtering of partitions. The proposed extension has been implemented and it can be tested from the FSA-SPARQL Web site. Paper accepted in IEEE International Conf. on Fuzzy Systems 2021 https://attend.ieee.org/fuzzieee-2021/

Descripción

Acerca de Almendros-Jiménez, Jesus M.

Palabras clave

Fuzzy Logic, Semantic Web, SPARQL

Colecciones

Página completa del ítem
Notificar un error en este resumen
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX