Computational properties of metaquerying problems

Authors:
F. Angiulli;R. Ben-Eliyahu-Zohary;L. Palopoli;G. B. Ianni
Affiliations:
DEIS, Università della Calabria, 87036 Rende (CS), Italy;Ben Gurion University of the Negev, Ber-Sheeva 84105, Israel;DEIS, Università della Calabria, 87036 Rende (CS), Italy;DEIS, Università della Calabria, 87036 Rende (CS), Italy
Venue:
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2000

Citing 12
Cited 2

On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Advances in knowledge discovery and data mining

Advances in knowledge discovery and data mining
Metaqueries for data mining

Advances in knowledge discovery and data mining
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Metapattern-Based Automated Discovery Loop for Integrated Data Mining-Unsupervised Learning of Relational Patterns

IEEE Transactions on Knowledge and Data Engineering
Towards Efficient Metaquerying

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Complexity of Acyclic Conjunctive Queries

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

Metaqueries: semantics, complexity, and efficient algorithms

Artificial Intelligence
Enumerating consistent metaquery instantiations

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Metaquerying is a datamining technology by which hidden dependencies among several database relations can be discovered. This tool has already been successfully applied to several real-world applications. Recent papers provide only very preliminary results about the complexity of metaquerying. In this paper we define several variants of metaquerying that encompass, as far as we know, all variants defined in the literature. We study both the combined complexity and the data complexity of these variants. We show that, under the combined complexity measure, metaquerying is generally intractable (unless P=NP), but we are able to single out some tractable interesting metaquerying cases (whose combined complexity is LOGCFL-complete). As for the data complexity of metaquerying, we prove that, in general, this is in P, but lies within AC0 in some interesting cases. Finally, we discuss the issue of equivalence between metaqueries, which is useful for optimization purposes.