DBScholar

Back to papers

Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning

Summary: Shape introduces semantic hash partitioning for RDF graphs, grouping and selectively replicating directional triples to exploit access locality. Locality-optimized plans and partitioning reduce cross-node communication, yielding scalable, efficient distributed SPARQL processing. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10863
Venue
VLDB
Year
2013
Pagerank
5.9725149e-05
Overall Rank
6,111 | 58.08%
DOI
10.14778/2556549.2556571

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lee_vldb13,
        title = {{Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning}},
        author = {Lee, Kisung and Liu, Ling},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {14},
        pages = {1894--1905},
        doi = {10.14778/2556549.2556571},
        url = {https://doi.org/10.14778/2556549.2556571},
        year = {2013}
}

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
3 Pregel: A System for Large-Scale Graph Processing 2010 SIGMOD 0.0012250108
500 Scalable SPARQL Querying of Large RDF Graphs 2011 VLDB 0.00017413839
Previous Page 1 / 1 Next

Semantically Similar Papers