# Fast Processing of SPARQL Queries on RDF Quadruples

arXiv: https://arxiv.org/abs/1506.01333 · HTML: https://mlsanity.com/paper/1506.01333/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Jun 2015.

## Built on by (most cited first, 2 of 2)

- [Scalable Knowledge Graph Construction and Inference on Human Genome Variants](https://mlsanity.com/paper/2312.04423/) (2023)
- [A Scalable Tool For Analyzing Genomic Variants Of Humans Using Knowledge Graphs and Machine Learning](https://mlsanity.com/paper/2407.20879/) (2024)

## Abstract (arXiv)

In this paper, we propose a new approach for fast processing of SPARQL queries on large RDF datasets containing RDF quadruples (or quads). Our approach called RIQ employs a decrease-and-conquer strategy: Rather than indexing the entire RDF dataset, RIQ identifies groups of similar RDF graphs and indexes each group separately. During query processing, RIQ uses a novel filtering index to first identify candidate groups that may contain matches for the query. On these candidates, it executes optimized queries using a conventional SPARQL processor to produce the final results. Our initial performance evaluation results are promising: Using a synthetic and a real dataset, each containing about 1.4 billion quads, we show that RIQ outperforms RDF-3X and Jena TDB on a variety of SPARQL queries.