Database Paper Browser

Back to papers

SPARQL Rewriting: Towards Desired Results

Summary: SPARQL Rewriting tunes results toward a target via query-restricting and query-relaxing on KGs. NP-hard for both; no PTAS for restricting, no constant-factor for relaxing; 1-1/e approx restricting and 2 heuristics for relaxing, tested on KGs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5911
Venue
SIGMOD
Year
2020
Pagerank
4.1905499e-05
Overall Rank
11,596 | 19.41%
DOI
10.1145/3318464.3389695

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

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

Rank Cited Paper Year Venue Pagerank
62 Freebase: A Collaboratively Created Graph Database For Structuring Human Knowledge 2008 SIGMOD 0.00064239035
491 Query by Output 2009 SIGMOD 0.00021960753
653 On the Provenance of Non-Answers to Queries over Extracted Data 2008 VLDB 0.00018616975
1,124 How to ConQueR Why-Not Questions 2010 SIGMOD 0.00013832959
1,502 Discovering Queries based on Example Tuples 2014 SIGMOD 0.00011614522
1,575 Reverse Engineering Complex Join Queries 2013 SIGMOD 0.00011288804
1,962 Exemplar Queries: Give me an Example of What You Need 2014 VLDB 9.9463687e-05
2,565 Explaining Missing Answers to SPJUA Queries 2010 VLDB 8.5307653e-05
2,577 S4: Top-k Spreadsheet-Style Search for Query Discovery 2015 SIGMOD 8.5066436e-05
3,100 Answering Why-not Questions on Reverse Top-k Queries 2015 VLDB 7.5625111e-05
Previous Page 1 / 1 Next

Semantically Similar Papers