24 citations · 59 across the 18 of their papers we have counts for
Showing 2021 · cs.DBShow all
2 papers · 2 filters
cs.DB2021★ 3 cited
VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality
Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya
Approximate subgraph matching, which is an important primitive for many applications like question answering, community detection, and motif discovery, often involves large labeled…
cs.DB2021
Computing and Maintaining Provenance of Query Result Probabilities in Uncertain Knowledge Graphs
Garima Gaur, Abhishek Dang, Arnab Bhattacharya +1
Knowledge graphs (KG) that model the relationships between entities as labeled edges (or facts) in a graph are mostly constructed using a suite of automated extractors, thereby inh…