Answering Why Empty? and Why So Many? queries in graph databases
TLDR
Subgraph-based solutions for graph queries "Why Empty?" and "Why So Many?" that give an answer about which part of a graph query is responsible for an unexpected result are introduced.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2016-02-01 and is currently open access. It has received 20 citations till now. The article focuses on the topics: Graph database & Spanning tree.read more
Citations
More filters
Journal ArticleDOI
Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data
Proceedings ArticleDOI
Answering Why-Questions for Subgraph Queries in Multi-attributed Graphs
TL;DR: While computing optimal query rewrite is intractable for Why-questions, feasible algorithms are developed, and query rewrites with (near) optimality guarantees whenever possible are provided, for both Why and Why-not questions.
Proceedings ArticleDOI
Answering Why-questions by Exemplars in Attributed Graphs
TL;DR: These algorithms implement Q-Chase by detecting picky operators at run time, which discriminately enforce $\E$ to retain answers that are closer to exemplars, and effectively prune both operators and irrelevant matches by consulting a cache of star patterns.
Journal ArticleDOI
Graph pattern matching with counting quantifiers and label-repetition constraints
TL;DR: This article proposes a simulation-based graph pattern matching approach that supports CQs on edges of graph patterns and shows that the approach is in ptime as earlier extensions of graph simulation by providing a cubic-time quantified matching algorithm, i.e., an algorithm for matching graph patterns that contain CQS.
Proceedings ArticleDOI
Graph Exploration: From Users to Large Graphs
Davide Mottin,Emmanuel Müller +1 more
TL;DR: This tutorial will provide a generalized definition of graph exploration in which the user interacts directly with the system either providing feedback or a partial query, and discuss common, diverse, and missing properties ofgraph exploration techniques based on this definition, the authors' taxonomy, and multiple applications for graph exploration.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
An Algorithm for Subgraph Isomorphism
TL;DR: A new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search by means of a brute-force tree-search enumeration procedure and a parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is described.
Journal ArticleDOI
A survey of graph edit distance
TL;DR: The research advance of G ED is surveyed in order to provide a review of the existing literatures and offer some insights into the studies of GED.
Journal ArticleDOI
Provenance in Databases: Why, How, and Where
TL;DR: Why, how, and where provenance is reviewed, the relationships among these notions of provenance are described, and some of their applications in confidence computation, maintenance and update, debugging, and annotation propagation are described.