Database Paper Browser

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
4379
Venue
SIGMOD
Year
2011
Pagerank
4.456315e-05
Overall Rank
8,765 | 39.03%
DOI
-

Incoming Non-self Citations Over Time

Authors

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