Approximate Evaluation of Label-Constrained Reachability Queries

11/28/2018
by   Stefania Dumbrava, et al.
0

The current surge of interest in graph-based data models mirrors the usage of increasingly complex reachability queries, as witnessed by recent analytical studies on real-world graph query logs. Despite the maturity of graph DBMS capabilities, complex label-constrained reachability queries, along with their corresponding aggregate versions, remain difficult to evaluate. In this paper, we focus on the approximate evaluation of counting label-constrained reachability queries. We offer a human-explainable solution to graph Approximate Query Processing (AQP). This consists of a summarization algorithm (GRASP), as well as of a custom visualization plug-in, which allows users to explore the obtained summaries. We prove that the problem of node group minimization, associated to the creation of GRASP summaries, is NP-complete. Nonetheless, our GRASP summaries are reasonably small in practice, even for large graph instances, and guarantee approximate graph query answering, paired with controllable error estimates. We experimentally gauge the scalability and efficiency of our GRASP algorithm, and verify the accuracy and error estimation of the graph AQP module. To the best of our knowledge, ours is the first system capable of handling visualization-driven approximate graph analytics for complex label-constrained reachability queries.

READ FULL TEXT
research
03/16/2022

A Reachability Index for Recursive Label-Concatenated Graph Queries

Reachability queries checking the existence of a path from a source node...
research
07/23/2020

Reachability Queries with Label and Substructure Constraints on Knowledge Graphs

Since knowledge graphs (KGs) describe and model the relationships betwee...
research
01/23/2021

DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version)

Reachability query is a fundamental problem on graphs, which has been ex...
research
03/08/2022

Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware Sampling

A knowledge graph (KG) manages large-scale and real-world facts as a big...
research
02/12/2020

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete

For a given labelled transition system (LTS), synthesis is the task to f...
research
03/05/2022

Efficient Reachability Ratio Computation for 2-hop Labeling Scheme

As one of the fundamental graph operations, reachability queries process...
research
05/18/2021

Reachability and Top-k Reachability Queries with Transfer Decay

The prevalence of location tracking systems has resulted in large volume...

Please sign up or login with your details

Forgot password? Click here to reset