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
h54c27f5073355019
Venue
PODS
Year
2018
Pagerank
4.9793485e-05
Overall Rank
12,201 | 17.97%
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
24 Data Integration: A Theoretical Perspective 2002 PODS 0.00055043581
41 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00045899672
72 Answering Queries Using Views (Extended Abstract) 1995 PODS 0.00037549176
136 Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) 1982 PODS 0.00029740459
310 Optimization of Real Conjunctive Queries 1993 PODS 0.00021374145
317 OPTIMIZING DATALOG PROGRAMS (Extended Abstract) 1987 PODS 0.00021220438
790 Cosette: An Automated Prover for SQL 2017 CIDR 0.00013976438
880 Rewriting Aggregate Queries Using Views 1999 PODS 0.00013280642
897 On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases 2003 PODS 0.00013204612
1,276 Orca: A Modular Query Optimizer Architecture for Big Data 2014 SIGMOD 0.00011239266
1,681 The iBench Integration Metadata Generator 2016 VLDB 9.8851118e-05
2,044 Views and Queries: Determinacy and Rewriting 2005 PODS 9.137464e-05
2,584 Advanced Processing for Ontological Queries 2010 VLDB 8.2585389e-05
2,674 Benchmarking the Chase 2017 PODS 8.1480823e-05
3,000 Querying with Access Patterns and Integrity Constraints 2015 VLDB 7.7669839e-05
3,315 On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs 1994 PODS 7.4376793e-05
3,447 Complete Yet Practical Search for Minimal Query Reformulations Under Constraints 2014 SIGMOD 7.2941472e-05
4,245 Queries with Guarded Negation 2012 VLDB 6.7064418e-05
4,464 On the Correct and Complete Enumeration of the Core Search Space 2013 SIGMOD 6.5877622e-05
4,861 That's All Folks! LLUNATIC Goes Open Source 2014 VLDB 6.3787474e-05
5,392 Incomplete Data: What Went Wrong, and How to Fix It 2014 PODS 6.1502284e-05
6,757 Teaching an RDBMS about ontological constraints 2016 VLDB 5.6900373e-05
8,405 PDQ: Proof-driven Query Answering over Web-based Data 2014 VLDB 5.3379341e-05
9,156 Reformulation-based query answering in RDF: alternatives and performance 2015 VLDB 5.2172507e-05
9,357 Expressive Languages for Querying the Semantic Web 2014 PODS 5.1873819e-05
10,115 Semantic Acyclicity Under Constraints 2016 PODS 5.0789354e-05
Previous Page 1 / 1 Next

Semantically Similar Papers