DBScholar

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
7004
Venue
SIGMOD
Year
2024
Pagerank
5.1915905e-05
Overall Rank
9,948 | 31.75%
DOI
10.1145/3654982

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{yao_sigmod24,
        title = {{uBlade: Efficient Batch Processing for Uncertain Graph Queries}},
        author = {Yao, Siyuan and Li, Yuchen and Sun, Shixuan and Jiang, Jiaxin and He, Bingsheng},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3654982},
        url = {https://dl.acm.org/doi/10.1145/3654982},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers