Lenguajes de consulta de bases de datos Web y bases de datos gráficas
URI permanente para esta colección:
Artículos en la categoría Lenguajes de consulta de bases de datos Web y bases de datos gráficas publicados en las Actas de las XXI Jornadas de Programación y Lenguajes (PROLE 2022).
Notificar un error en esta colección
Examinar
Envíos recientes
Artículo How can graph databases and reasoning be combined and integrated?Pasarella, Edelmira. Actas de las XXI Jornadas de Programación y Lenguajes (PROLE 2022), 2022-09-05.Nowadays the graph data model has been accepted as one of the most suitable data models to formalize relationships among entities of many domains. Deductive databases based on the Datalog language have been used to deduce new information from large amounts of data. Most of the attempts to combine logic and graph databases are based on translating knowledge in graph databases into Datalog and then use its inference engine. We aim to open the discussion about combining graph databases and a graph-oriented logic to define +IB0-native+IB0 deductive graph databases. This is, graph databases equipped with an inference mechanism based on graph based logic. To be concrete, we plan to use the recently introduced graph navigational logic.Artículo Introducing Fuzzy Quantifiers in FSA-SPARQLAlmendros-Jimenez, Jesus M.; Becerra-Teron, Antonio; Moreno, Gines. Actas de las XXI Jornadas de Programación y Lenguajes (PROLE 2022), 2022-09-05.Fuzzy quantification makes it possible to model quantifiers from the natural language (most of, at least half, few, around a dozen, etc). Absolute quantifiers refer to a number while relative ones refer to a proportion. In this paper we introduce fuzzy quantifiers in FSA-SPARQL, a fuzzy extension of the SPARQL query language developed by our group. We focus on relative quantifiers (most of, at least half, few etc) and propose a fuzzy operator called QUANT to model relative fuzzy quantifiers in FSA-SPARQL. As in previous works about FSA-SPARQL, we study a translation of FSA-SPARQL queries involving fuzzy quantifiers to crisp SPARQL. The proposed extension has been implemented and it can be tested from the FSA-SPARQL Web site.Artículo Towards a Logical Approach to Graph DatabasesPino, Elvira; Orejas, Fernando; Mylonakis, Nicos; Pasarella, Edelmira. Actas de las XXI Jornadas de Programación y Lenguajes (PROLE 2022), 2022-09-05.Graph databases are now playing an important role, not only because they allow us to overcome some limitations of relational databases, but also because they provide a good model for searching the web. In particular, graph databases differ from relational databases in that the topology of data is as important as the data itself. Thus, typical graph database queries are navigational, asking whether some nodes are connected by paths satisfying some specific properties. While relational databases were designed upon logical and algebraic foundations, the development of graph databases has been quite ad-hoc. In this sense, the aim of this paper is to provide them with some logical foundations. More precisely, in previous work we introduced a navigational logic, called +AFw-GNL+AFw (Graph Navigational Logic) that allows us to describe graph navigational properties. Moreover, this logic is equipped with a deductive tableau method that we proved to be sound and complete. In the current paper, we show how graph queries +AHsAXA-it +AOA la+AH0 Cypher can be expressed using a fragment of +AFw-GNL, defining for them a logical and an operational semantics. Moreover, we show that this operational semantics is sound and complete.