Approximate Evaluation of Label-Constrained Reachability Queries

Understand

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).