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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xun Jian (Hong Kong University of Science and Technology)
- 2. Yue Wang (Shenzhen University)
- 3. Xiayu Lei (Hong Kong University of Science and Technology)
- 4. Libin Zheng (Hong Kong University of Science and Technology)
- 5. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{jian_sigmod20,
title = {{SPARQL Rewriting: Towards Desired Results}},
author = {Jian, Xun and Wang, Yue and Lei, Xiayu and Zheng, Libin and Chen, Lei},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3389695},
url = {https://dl.acm.org/doi/10.1145/3318464.3389695},
year = {2020}
}
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 |
|---|---|---|---|---|
| 65 | Freebase: A Collaboratively Created Graph Database For Structuring Human Knowledge | 2008 | SIGMOD | 0.00038222149 |
| 518 | Query by Output | 2009 | SIGMOD | 0.00016944862 |
| 622 | On the Provenance of Non-Answers to Queries over Extracted Data | 2008 | VLDB | 0.00015484312 |
| 791 | How to ConQueR Why-Not Questions | 2010 | SIGMOD | 0.00013976192 |
| 1,272 | Discovering Queries based on Example Tuples | 2014 | SIGMOD | 0.00011248674 |
| 1,345 | Reverse Engineering Complex Join Queries | 2013 | SIGMOD | 0.00010953079 |
| 1,954 | Exemplar Queries: Give me an Example of What You Need | 2014 | VLDB | 9.31794e-05 |
| 2,067 | Explaining Missing Answers to SPJUA Queries | 2010 | VLDB | 9.0924963e-05 |
| 2,412 | S4: Top-k Spreadsheet-Style Search for Query Discovery | 2015 | SIGMOD | 8.5101348e-05 |
| 2,955 | Answering Why-not Questions on Reverse Top-k Queries | 2015 | VLDB | 7.8102237e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,646 | Optimizing Query Answering under Ontological Constraints | 2011 | VLDB |
| 2 | 5,844 | Graph-Aware, Workload-Adaptive SPARQL Query Caching | 2015 | SIGMOD |
| 3 | 9,156 | Reformulation-based query answering in RDF: alternatives and performance | 2015 | VLDB |
| 4 | 8,330 | Computing How-Provenance for SPARQL Queries via Query Rewriting | 2021 | VLDB |
| 5 | 8,270 | Designing a Query Language for RDF: Marrying Open and Closed Worlds | 2016 | PODS |
| 6 | 11,561 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 7 | 5,948 | Containment and Equivalence of Well-Designed SPARQL | 2014 | PODS |
| 8 | 6,224 | Scalable Query Rewriting: A Graph-Based Approach | 2011 | SIGMOD |
| 9 | 3,633 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS |
| 10 | 12,195 | The Tractability Frontier of Well-designed SPARQL Queries | 2018 | PODS |