DBScholar

Back to papers

How Can Reasoners Simplify Database Querying (And Why Haven’t They Done It Yet)?

Summary: Surveys reasoning-based rewriting and simplification of relational queries, spanning theory, algorithms, tools, standards, and benchmarks. Exposes the gap between elegant results and practical adoption, while outlining open problems and implementation barriers. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
1771
Venue
PODS
Year
2018
Pagerank
5.093636e-05
Overall Rank
11,901 | 18.35%
DOI
10.1145/3196959.3196989

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{benedikt_pods18,
        address = {New York, NY, USA},
        series = {{PODS} '18},
        title = {{How Can Reasoners Simplify Database Querying (And Why Haven’t They Done It Yet)?}},
        url = {https://dl.acm.org/doi/10.1145/3196959.3196989},
        doi = {10.1145/3196959.3196989},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Benedikt, Michael},
        year = {2018}
}

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

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

Rank Cited Paper Year Venue Pagerank
22 Data Integration: A Theoretical Perspective 2002 PODS 0.00056204792
40 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00046918506
69 Answering Queries Using Views (Extended Abstract) 1995 PODS 0.00038090878
134 Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) 1982 PODS 0.00030343737
309 Optimization of Real Conjunctive Queries 1993 PODS 0.00021768596
313 OPTIMIZING DATALOG PROGRAMS (Extended Abstract) 1987 PODS 0.0002168869
869 Rewriting Aggregate Queries Using Views 1999 PODS 0.00013503594
874 On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases 2003 PODS 0.00013481551
910 Cosette: An Automated Prover for SQL 2017 CIDR 0.00013285905
1,621 Orca: A Modular Query Optimizer Architecture for Big Data 2014 SIGMOD 0.00010203114
1,652 The iBench Integration Metadata Generator 2016 VLDB 0.00010109142
1,991 Views and Queries: Determinacy and Rewriting 2005 PODS 9.344653e-05
2,544 Advanced Processing for Ontological Queries 2010 VLDB 8.4444438e-05
2,634 Benchmarking the Chase 2017 PODS 8.3210907e-05
2,947 Querying with Access Patterns and Integrity Constraints 2015 VLDB 7.9325276e-05
3,245 On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs 1994 PODS 7.60327e-05
3,392 Complete Yet Practical Search for Minimal Query Reformulations Under Constraints 2014 SIGMOD 7.4515019e-05
4,163 Queries with Guarded Negation 2012 VLDB 6.8603553e-05
4,418 On the Correct and Complete Enumeration of the Core Search Space 2013 SIGMOD 6.7137462e-05
4,750 That's All Folks! LLUNATIC Goes Open Source 2014 VLDB 6.5247192e-05
5,271 Incomplete Data: What Went Wrong, and How to Fix It 2014 PODS 6.2907571e-05
6,623 Teaching an RDBMS about ontological constraints 2016 VLDB 5.8206367e-05
8,236 PDQ: Proof-driven Query Answering over Web-based Data 2014 VLDB 5.460452e-05
8,994 Reformulation-based query answering in RDF: alternatives and performance 2015 VLDB 5.3369986e-05
9,181 Expressive Languages for Querying the Semantic Web 2014 PODS 5.3064263e-05
9,933 Semantic Acyclicity Under Constraints 2016 PODS 5.1955087e-05
Previous Page 1 / 1 Next

Semantically Similar Papers