DBScholar

Back to papers

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)

Paper ID
1213
Venue
PODS
Year
2000
Pagerank
5.093636e-05
Overall Rank
12,878 | 11.65%
DOI
10.1145/335168.335227

Incoming Non-self Citations Over Time

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

Authors

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