On a Fuzzy Algebra for Querying Graph Databases

Abstract

International audienceThis paper proposes a notion of fuzzy graph database and describes a fuzzy query algebra that makes it possible to handle such database, which may be fuzzy or not, in a flexible way. The algebra, based on fuzzy set theory and the concept of a fuzzy graph, is composed of a set of operators that can be used to express preference queries on fuzzy graph databases. The preferences concern i) the content of the vertices of the graph and ii) the structure of the graph. In a similar way as relational algebra constitutes the basis of SQL, the fuzzy algebra proposed here underlies a user-oriented query language and an associated tool implementing this language that are also presented in the paper

Expression and efficient processing of fuzzy queries in a graph database context

“…In this section, we recall the main elements of the algebra that constitutes the foundations of the FUDGE language. The whole algebra is presented in detail in [32].…”

Fuzziness in database management systems: Half a century of developments and future prospects

“…Moreover, the case of more complex forms of data to be queried, e.g., graphs, will not be dealt with and details can be found in, e.g., Castelltort and Laurent [41,42] or Pivert et al [97,74,102].…”

Fuzzy quantified queries to fuzzy RDF databases

“…An example of such a statement is: "most of the recent papers of which x is a main author, have been published in a renowned database journal". We showed how this statement could be expressed in the language FUDGE (which is a flexible extension of the CYPHER query language) that we previously proposed [15].…”