Abstract

This paper deals with fuzzy quantified queries in a graph database context. We study a particular type of structural quantified query and show how it can be expressed in an extension of the Neo4j Cypher query language. A processing strategy based on a compilation mechanism that derives regular (nonfuzzy) queries for accessing the relevant data is also described. Then, some experiments are performed that show the tractability of this approach.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call