Database Paper Browser

Back to papers

Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning

Summary: Semantic hash partitioning for scalable RDF; SHAPE uses direction-based triple groups and selective replication to exploit access locality. Locality-aware query planning and optimized execution minimize inter-node communication. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10675
Venue
VLDB
Year
2013
Pagerank
5.0801167e-05
Overall Rank
6,401 | 55.48%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4 Pregel: A System for Large-Scale Graph Processing 2010 SIGMOD 0.0019005923
582 Scalable SPARQL Querying of Large RDF Graphs 2011 VLDB 0.00019723083
Previous Page 1 / 1 Next

Semantically Similar Papers