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
- 4153
- Venue
- SIGMOD
- Year
- 2009
- Pagerank
- 8.8702781e-05
- Overall Rank
- 2,407 | 83.28%
- 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,676 |
A Distributed Graph Engine for Web Scale RDF Data |
2013 |
VLDB |
0.000109374 |
| 2,199 |
gStore: Answering SPARQL Queries via Subgraph Matching |
2011 |
VLDB |
9.3082437e-05 |
| 2,561 |
TripleBit: a Fast and Compact System for Large Scale RDF Data |
2013 |
VLDB |
8.5415562e-05 |
| 2,812 |
TriAD: A Distributed Shared-Nothing RDF Engine based on Asynchronous Message Passing |
2014 |
SIGMOD |
8.0825994e-05 |
| 2,920 |
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases |
2010 |
VLDB |
7.8999781e-05 |
| 3,920 |
On Optimizing Operator Fusion Plans for Large-Scale Machine Learning in SystemML |
2018 |
VLDB |
6.6246708e-05 |
| 3,948 |
Unicorn: A System for Searching the Social Graph |
2013 |
VLDB |
6.5968941e-05 |
| 4,272 |
Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads |
2017 |
VLDB |
6.2933353e-05 |
| 4,728 |
Workload Matters: Why RDF Databases Need a New Design |
2014 |
VLDB |
5.9617831e-05 |
| 8,248 |
View Selection in Semantic Web Databases |
2012 |
VLDB |
4.5453997e-05 |
| 8,465 |
Inferray: fast in-memory RDF inference |
2016 |
VLDB |
4.4999659e-05 |
| 8,487 |
Making RDBMSs Efficient on Graph Workloads Through Predefined Joins |
2022 |
VLDB |
4.4953604e-05 |
| 9,034 |
Extending SQL to Return a Subdatabase |
2025 |
SIGMOD |
4.3997447e-05 |
| 9,303 |
Engineering High-Performance Database Engines |
2014 |
VLDB |
4.3550373e-05 |
| 9,375 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
4.3452177e-05 |
| 10,415 |
Dynamic Pruning for Recursive Joins |
2025 |
SIGMOD |
4.1905499e-05 |
| 11,928 |
Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins) |
2015 |
SIGMOD |
4.1905499e-05 |
| 11,992 |
An Effective Encoding Scheme for Spatial RDF Data |
2014 |
VLDB |
4.1905499e-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 |
| 116 |
Eddies: Continuously Adaptive Query Processing |
2000 |
SIGMOD |
0.00046191288 |
| 415 |
Scalable Semantic Web Data Management Using Vertical Partitioning |
2007 |
VLDB |
0.00023774838 |
| 625 |
Hexastore: Sextuple Indexing for Semantic Web Data Management |
2008 |
VLDB |
0.00018963452 |
| 869 |
An Efficient SQL-based RDF Querying Scheme |
2005 |
VLDB |
0.00015734541 |
| 1,212 |
RDF-3X: a RISC-style Engine for RDF |
2008 |
VLDB |
0.00013255692 |
| 1,251 |
Principles of Dataspace Systems |
2006 |
PODS |
0.0001302453 |
| 1,313 |
Cost-Based Optimization for Magic: Algebra and Implementation |
1996 |
SIGMOD |
0.00012629432 |
| 1,705 |
Column-Store Support for RDF Data Management: not all swans are white |
2008 |
VLDB |
0.00010809258 |
| 1,825 |
Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products |
2006 |
VLDB |
0.00010392367 |
| 2,053 |
Optimal Top-Down Join Enumeration |
2007 |
SIGMOD |
9.682841e-05 |
| 3,053 |
Fast, Randomized Join-Order Selection — Why Use Transformations? |
1994 |
VLDB |
7.6482987e-05 |
| 3,667 |
Bypassing Joins in Disjunctive Queries |
1995 |
VLDB |
6.8587775e-05 |
| 4,198 |
Implementation of Magic-sets in a Relational Database System |
1994 |
SIGMOD |
6.361961e-05 |
Semantically Similar Papers