Efficiently Enumerating Answers to Ontology-Mediated Queries
Summary: Defines two partial-answer notions for OMQs (guarded TGDs / ELI) that account for existentially generated nulls. Proves enumeration of complete and partial answers with linear-time preprocessing and constant delay for OMQs that are acyclic and free-connex acyclic, with matching lower bounds and acyclicity-based tractability borders. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Carsten Lutz (University of Leipzig)
- 2. Marcin Przybyłko (University of Leipzig)
BibTeX Citation
@inproceedings{lutz_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{Efficiently Enumerating Answers to Ontology-Mediated Queries}},
url = {https://dl.acm.org/doi/10.1145/3517804.3524166},
doi = {10.1145/3517804.3524166},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lutz, Carsten and Przybyłko, Marcin},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,301 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.9213518e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 40 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00046918506 |
| 134 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00030343737 |
| 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS | 8.5358494e-05 |
| 2,777 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 8.1352657e-05 |
| 3,463 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 7.3921264e-05 |
| 5,347 | Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP | 2013 | PODS | 6.2571376e-05 |
| 11,753 | The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 2020 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,747 | High-Level Why-Not Explanations using Ontologies | 2015 | PODS |
| 2 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 3 | 2,481 | A General Datalog-Based Framework for Tractable Query Answering over Ontologies | 2009 | PODS |
| 4 | 5,347 | Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP | 2013 | PODS |
| 5 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 6 | 11,893 | Containment for Rule-Based Ontology-Mediated Queries | 2018 | PODS |
| 7 | 11,969 | Dichotomies in Ontology-Mediated Querying with the Guarded Fragment | 2017 | PODS |
| 8 | 8,479 | Optimizing Query Answering under Ontological Constraints | 2011 | VLDB |
| 9 | 11,967 | The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries | 2017 | PODS |
| 10 | 11,753 | The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 2020 | PODS |