Computer Science – Databases
Scientific paper
2001-06-07
Computer Science
Databases
32 pages. Partial and preliminary version appeared in Proc. of 19th Symposium on Principles of Database Systems, 2000, Dallas,
Scientific paper
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 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), lying sometimes quite high in the complexity hierarchies (as high as NP^PP), depending on the characteristics of the plausibility index. However, we are able to single out some tractable and interesting metaquerying cases (whose combined complexity is LOGCFL-complete). As for the data complexity of metaquerying, we prove that, in general, this is in TC0, but lies within AC0 in some simpler cases. Finally, we discuss implementation of metaqueries, by providing algorithms to answer them.
Angiulli Fabrizio
Ben-Eliyahu-Zohary R.
Ianni Giovambattista
Palopoli Luigi
No associations
LandOfFree
Computational Properties of Metaquerying Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computational Properties of Metaquerying Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Properties of Metaquerying Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-459279