Back to papers
uBlade: Efficient Batch Processing for Uncertain Graph Queries
Summary: uBlade: batch processing for uncertain-graph queries on multicore CPUs, combining work-efficient parallel traversal with Quasi-Sampling to cut RNG cost by ~B and a possible-world reordering strategy to reduce extra sampling load. Yields up to 100x speedups over prior CPU/GPU systems.
(summarized by gpt-5.4-mini on May 24 2026)
- Paper ID
- 6943
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.2777144e-05
- Overall Rank
- 9,796 | 31.92%
- DOI
-
10.1145/3654982
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 1,159 |
k-Nearest Neighbors in Uncertain Graphs |
2010 |
VLDB |
0.00013584223 |
| 1,448 |
Distance-Constraint Reachability Computation in Uncertain Graphs |
2011 |
VLDB |
0.00011928845 |
| 1,612 |
A Unified Approach to Ranking in Probabilistic Databases |
2009 |
VLDB |
0.00011142757 |
| 1,665 |
The More the Merrier: Efficient Multi-Source Graph Traversal |
2015 |
VLDB |
0.00010958779 |
| 1,857 |
Real-time Targeted Influence Maximization for Online Advertisements |
2015 |
VLDB |
0.00010318371 |
| 3,106 |
Injecting Uncertainty in Graphs for Identity Obfuscation |
2012 |
VLDB |
7.5550946e-05 |
| 3,235 |
iBFS: Concurrent Breadth-First Search on GPUs |
2016 |
SIGMOD |
7.3298263e-05 |
| 4,165 |
The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs |
2014 |
SIGMOD |
6.3843974e-05 |
| 5,966 |
Cache-Efficient Fork-Processing Patterns on Large Graphs |
2021 |
SIGMOD |
5.2471834e-05 |
| 6,063 |
ThunderRW: An In-Memory Graph Random Walk Engine |
2021 |
VLDB |
5.2259989e-05 |
| 6,164 |
Shortest Paths and Centrality in Uncertain Networks |
2021 |
VLDB |
5.1731827e-05 |
| 6,165 |
An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs |
2019 |
VLDB |
5.1731827e-05 |
| 6,373 |
On Uncertain Graphs Modeling and Queries |
2015 |
VLDB |
5.0875991e-05 |
| 9,135 |
Sage: A System for Uncertain Network Analysis |
2022 |
VLDB |
4.3846727e-05 |
| 10,951 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
4.1905499e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,811 |
CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor |
2024 |
VLDB |
5.3168243e-05 |
| 4,158 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3898204e-05 |
| 6,522 |
Clustering Uncertain Graphs |
2018 |
VLDB |
5.0230003e-05 |
| 8,371 |
URank: Formulation and Efficient Evaluation of Top-k Queries in Uncertain Databases |
2007 |
SIGMOD |
4.5286495e-05 |
| 8,723 |
GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases |
2010 |
SIGMOD |
4.4546285e-05 |
| 6,373 |
On Uncertain Graphs Modeling and Queries |
2015 |
VLDB |
5.0875991e-05 |
| 3,873 |
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases |
2012 |
VLDB |
6.673504e-05 |
| 6,313 |
QUBLE: Blending Visual Subgraph Query Formulation with Query Processing on Large Networks |
2013 |
SIGMOD |
5.1108902e-05 |
| 10,951 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
4.1905499e-05 |
| 4,959 |
Efficient Subgraph Search over Large Uncertain Graphs |
2011 |
VLDB |
5.7992713e-05 |