Computational Properties of Metaquerying Problems
Summary: Formalizes common metaquerying variants and maps their complexity: combined complexity is mostly intractable (unless P=NP) but identifies natural LOGCFL-complete tractable fragments. Data complexity is polynomial in general with some cases in AC^0; also analyzes metaquery equivalence for optimization. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. F. Angiulli (University of Calabria)
- 2. R. Ben-Eliyahu-Zohary (Ben Gurion University)
- 3. G.B. Ianni (University of Calabria)
- 4. L. Palopoli (University of Calabria)
BibTeX Citation
@inproceedings{angiulli_pods00,
address = {New York, NY, USA},
series = {{PODS} '00},
title = {{Computational Properties of Metaquerying Problems}},
url = {https://dl.acm.org/doi/10.1145/335168.335227},
doi = {10.1145/335168.335227},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Angiulli, F. and Ben-Eliyahu-Zohary, R. and Ianni, G.B. and Palopoli, L.},
year = {2000}
}
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 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0006567919 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,858 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS |
| 2 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 3 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 4 | 11,140 | Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity | 2024 | PODS |
| 5 | 3,268 | Efficient and Provable Multi-Query Optimization | 2017 | PODS |
| 6 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 7 | 3,572 | Summary Graphs for Relational Database Schemas | 2011 | VLDB |
| 8 | 644 | The Complexity of Query Reliability | 1998 | PODS |
| 9 | 9,865 | Containment of Conjunctive Object Meta-Queries | 2006 | VLDB |
| 10 | 10,296 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |