Database Paper Browser

Back to papers

Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins)

Summary: LBR uses a graph of supernodes to model nested BGP/OPTIONAL patterns, enabling aggressive RDF pruning with compressed indexes. Novel optimizations exploit acyclicity, minimality, and nullification/best-match for left-outer-joins; UNIONs/FILTERs are handled by rewrite; on large RDFs, LBR attains up to 11× speedups over Virtuoso/MonetDB on 8 GB RAM. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5032
Venue
SIGMOD
Year
2015
Pagerank
4.1945683e-05
Overall Rank
11,920 | 17.08%
DOI
10.1145/2723372.2746483

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers