DBScholar

Back to papers

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)

Paper ID
4441
Venue
SIGMOD
Year
2011
Pagerank
5.3483178e-05
Overall Rank
8,935 | 38.70%
DOI
10.1145/1989323.1989341

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lian_sigmod11,
        title = {{Efficient Query Answering in Probabilistic RDF Graphs}},
        author = {Lian, Xiang and Chen, Lei},
        series = {{SIGMOD} '11},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1989323.1989341},
        url = {https://dl.acm.org/doi/10.1145/1989323.1989341},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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

Semantically Similar Papers