Why-query support in graph databases
Elena Vasilyeva · 2016
Graph databases implementing a property graph model allow storing of heterogeneous information in the form of a graph and support complex graph-specific queries like shortest path, pattern matching, etc. Their flexibility and a rich spectrum of supported queries make it difficult for a user to create correct queries. As a consequence, a user can get unexpected results like too many, too few, or even empty answers. This research aims at providing a basic debugging functionality to a user in order to discover the reasons of a failure and to fix a query. The main goals of this thesis include (1) studying the reasons of a failure in terms of a graph with the focus on cardinality-based problems like too few, too many, and empty results; (2) developing methods for query refinement in order to derive expected answers with considering specifics of a property graph model, and (3) proposing a set of strategies for integrating user intention into the debugging process.