Database Paper Browser

Back to papers

Efficient Exploration of Linked Data

Summary: eLinda: exploration of RDF graphs via bar-chart expansions (subclass, property, object) compiled to SPARQL. A worst-case-optimal join engine yields 1-2 orders of magnitude speedups over standard SPARQL, enabling practical exploration of Linked Data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5439
Venue
SIGMOD
Year
2018
Pagerank
4.1945683e-05
Overall Rank
11,701 | 18.60%
DOI
10.1145/3183713.3183719

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 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,557 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 0.00011392493
Previous Page 1 / 1 Next

Semantically Similar Papers