NDLI: Computational properties of metaquerying problems

Content Provider	ACM Digital Library
Author	Angiulli, Fabrizio Palopoli, Luigi Ben-eliyahu-zohary, Rachel Ianni, Giovambattista
Copyright Year	2003
Abstract	Metaquerying is a data mining technology by which hidden dependencies among several database relations can be discovered. This tool has already been successfully applied to several real-world applications, but only preliminary results about the complexity of metaquerying can be found in the literature. In this article, we define several variants of metaquerying that encompass, as far as we know, all the variants that have been 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 $\textit{P}$ = $\textit{NP}),$ lying sometimes quite high in the complexity hierarchies (as high as $NP^{PP}),$ depending on the characteristics of the plausibility index. Nevertheless, 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, it is within $TC^{0},$ but lies within $AC^{0}$ in some simpler cases. Finally, we discuss the implementation of metaqueries by providing algorithms that answer them.
Starting Page	149
Ending Page	180
Page Count	32
File Format	PDF
ISSN	15293785
e-ISSN	1557945X
DOI	10.1145/635499.635501
Volume Number	4
Issue Number	2
Journal	ACM Transactions on Computational Logic (TOCL)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computational complexity Data mining
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Logic Computational Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Computational Properties of Metaquerying Problems

Nonuniform Boolean constraint satisfaction problems with cardinality constraint

Context semantics, linear logic, and computational complexity

Complexity of conservative constraint satisfaction problems

Complexity of propositional proofs under a promise

Complexity Classifications for Logic-Based Argumentation

Complexity of Data Dependence Problems for Program Schemas with Concurrency

Complexities of Horn Description Logics

Complexity of Two-Variable Logic on Finite Trees

Computational properties of metaquerying problems

Similar Documents

Computational Properties of Metaquerying Problems

Nonuniform Boolean constraint satisfaction problems with cardinality constraint

Context semantics, linear logic, and computational complexity

Complexity of conservative constraint satisfaction problems

Complexity of propositional proofs under a promise

Complexity Classifications for Logic-Based Argumentation

Complexity of Data Dependence Problems for Program Schemas with Concurrency

Complexities of Horn Description Logics

Complexity of Two-Variable Logic on Finite Trees

Computational properties of metaquerying problems