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
- 2. Marcin Przybyłko
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,992 | Evaluating Datalog over Semirings: A Grounding-based Approach | 2024 | PODS | 5.2415551e-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 |
|---|---|---|---|---|
| 38 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.00075110004 |
| 144 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00041462501 |
| 3,371 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS | 7.1696145e-05 |
| 3,387 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 7.1573735e-05 |
| 4,058 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 6.4866036e-05 |
| 6,143 | Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP | 2013 | PODS | 5.1889914e-05 |
| 11,556 | The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 2020 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next