Computational properties of metaquerying problems

DOI10.1145/635499.635501zbMATH Open1365.68195OpenAlexW2076491023MaRDI QIDQ5267427FDOQ5267427

Authors: Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Giovambattista Ianni, Luigi Palopoli 

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/635499.635501

Recommendations

• scientific article; zbMATH DE number 2218055
• Metaqueries: Semantics, complexity, and efficient algorithms
• Computational complexity of queries based on itemsets
• The complexity of evaluating relational queries
• Publication:4943319

zbMATH Keywords

computational complexitydata mining

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Cited In (6)

• Outlier detection using default reasoning
• Asking the Metaquestions in Constraint Tractability
• Metamodeling and metaquerying in \texttt{OWL 2 QL}
• Title not available (Why is that?)
• Restricted default theories: expressive power and outlier detection tasks
• Metaqueries: Semantics, complexity, and efficient algorithms

This page was built for publication: Computational properties of metaquerying problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267427)