Efficient Query Answering in Probabilistic RDF Graphs
Summary: Efficient query answering on probabilistic RDF graphs via search over high-probability subgraphs. Introduces synopses-based structural pruning for vertex/edge labels, a cost-model-driven probabilistic pruning to bound answers, and an integrated index combining synopses and statistics, with extensive experiments. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiang Lian
- 2. Lei Chen
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.6779082e-05 |
| 6,393 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0837624e-05 |
| 6,441 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB | 5.0603113e-05 |
| 11,264 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1945683e-05 |
| 11,769 | Efficient Ad-Hoc Graph Inference and Matching in Biological Databases | 2017 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next