Back to papers
Scalable Join Processing on Very Large RDF Graphs
Summary: Scalable join processing for large RDF graphs; introduces lightweight sideways information passing between joins to prune streams at runtime. Also refines join-order selectivity for large RDF graphs, yielding over an order-of-magnitude speedup on UniProt.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 4152
- Venue
- SIGMOD
- Year
- 2009
- Pagerank
- 8.8773796e-05
- Overall Rank
- 2,410 | 83.24%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,675 |
A Distributed Graph Engine for Web Scale RDF Data |
2013 |
VLDB |
0.00010947606 |
| 2,196 |
gStore: Answering SPARQL Queries via Subgraph Matching |
2011 |
VLDB |
9.3089621e-05 |
| 2,554 |
TripleBit: a Fast and Compact System for Large Scale RDF Data |
2013 |
VLDB |
8.549897e-05 |
| 2,803 |
TriAD: A Distributed Shared-Nothing RDF Engine based on Asynchronous Message Passing |
2014 |
SIGMOD |
8.0940362e-05 |
| 2,917 |
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases |
2010 |
VLDB |
7.9063089e-05 |
| 3,918 |
On Optimizing Operator Fusion Plans for Large-Scale Machine Learning in SystemML |
2018 |
VLDB |
6.6315176e-05 |
| 3,947 |
Unicorn: A System for Searching the Social Graph |
2013 |
VLDB |
6.5967528e-05 |
| 4,276 |
Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads |
2017 |
VLDB |
6.2976602e-05 |
| 4,729 |
Workload Matters: Why RDF Databases Need a New Design |
2014 |
VLDB |
5.9675136e-05 |
| 8,251 |
View Selection in Semantic Web Databases |
2012 |
VLDB |
4.5497619e-05 |
| 8,468 |
Inferray: fast in-memory RDF inference |
2016 |
VLDB |
4.504284e-05 |
| 8,600 |
Making RDBMSs Efficient on Graph Workloads Through Predefined Joins |
2022 |
VLDB |
4.4876776e-05 |
| 9,031 |
Extending SQL to Return a Subdatabase |
2025 |
SIGMOD |
4.4039656e-05 |
| 9,299 |
Engineering High-Performance Database Engines |
2014 |
VLDB |
4.3587894e-05 |
| 9,366 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
4.3493859e-05 |
| 10,404 |
Dynamic Pruning for Recursive Joins |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,920 |
Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins) |
2015 |
SIGMOD |
4.1945683e-05 |
| 11,984 |
An Effective Encoding Scheme for Spatial RDF Data |
2014 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 115 |
Eddies: Continuously Adaptive Query Processing |
2000 |
SIGMOD |
0.00046221215 |
| 417 |
Scalable Semantic Web Data Management Using Vertical Partitioning |
2007 |
VLDB |
0.00023794574 |
| 624 |
Hexastore: Sextuple Indexing for Semantic Web Data Management |
2008 |
VLDB |
0.00018988711 |
| 872 |
An Efficient SQL-based RDF Querying Scheme |
2005 |
VLDB |
0.00015759968 |
| 1,213 |
RDF-3X: a RISC-style Engine for RDF |
2008 |
VLDB |
0.0001325231 |
| 1,252 |
Principles of Dataspace Systems |
2006 |
PODS |
0.00013033186 |
| 1,313 |
Cost-Based Optimization for Magic: Algebra and Implementation |
1996 |
SIGMOD |
0.0001263831 |
| 1,706 |
Column-Store Support for RDF Data Management: not all swans are white |
2008 |
VLDB |
0.00010823026 |
| 1,826 |
Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products |
2006 |
VLDB |
0.00010400425 |
| 2,050 |
Optimal Top-Down Join Enumeration |
2007 |
SIGMOD |
9.6886663e-05 |
| 3,048 |
Fast, Randomized Join-Order Selection — Why Use Transformations? |
1994 |
VLDB |
7.6543116e-05 |
| 3,666 |
Bypassing Joins in Disjunctive Queries |
1995 |
VLDB |
6.8618006e-05 |
| 4,199 |
Implementation of Magic-sets in a Relational Database System |
1994 |
SIGMOD |
6.3662839e-05 |
Semantically Similar Papers