Semantic Optimization of Conjunctive Queries

DOI10.1145/3424908MaRDI QIDQ5056448zbMATH OpenOpenAlexWikidataFDO

Authors Pablo Barceló, Diego Figueira, Georg Gottlob, Andreas Pieris

Publication date 8 December 2022

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

optimizationevaluationconjunctive queriesapproximationstuple-generating dependenciesequality-generating dependencieshyper-treewidth

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Logic in computer science (03B70)

Recommendations

• Semantic acyclicity for conjunctive queries: approximations and constraints
• Optimization of a subclass of conjunctive queries
• A more general theory of static approximations for conjunctive queries
• A more general theory of static approximations for conjunctive queries
• scientific article; zbMATH DE number 219223

Cited in

(13)

• Semantic representations and query languages for or-sets
• A formal model of trade-off between optimization and execution costs in semantic query optimization
• Linear Programs with Conjunctive Database Queries
• Answer counting under guarded TGDs
• Answer Counting under Guarded TGDs
• Combined-semantics equivalence of conjunctive queries: decidability and tractability results
• Semantic acyclicity on graph databases
• Optimization of quasiconjunctive queries
• A more general theory of static approximations for conjunctive queries
• Static analysis and optimization of semantic web queries
• Semantically Acyclic Conjunctive Queries under Functional Dependencies
• Semantic acyclicity for conjunctive queries: approximations and constraints
• Semantic query optimization in the presence of types

This page was built for publication: Semantic Optimization of Conjunctive Queries

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