Semantically Acyclic Conjunctive Queries under Functional Dependencies

DOI10.1145/2933575.2933580MaRDI QIDQ4635949zbMATH OpenOpenAlexWikidataFDO

Authors Diego Figueira

Publication date 23 April 2018

Published in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Recommendations

• Semantic acyclicity for conjunctive queries: approximations and constraints
• Computing supports of conjunctive queries on relational tables with functional dependencies
• Enumeration complexity of conjunctive queries with functional dependencies
• Enumeration complexity of conjunctive queries with functional dependencies
• Semantic Optimization of Conjunctive Queries
• A formal context for acyclic join dependencies
• Functional queries in datalog
• The complexity of acyclic conjunctive queries
• Semantic acyclicity on graph databases

Cited in

(8)

• Rewriting with Acyclic Queries: Mind Your Head
• scientific article; zbMATH DE number 7104937 (Why is no real title available?)
• Answer Counting under Guarded TGDs
• Semantic acyclicity on graph databases
• Enumeration complexity of conjunctive queries with functional dependencies
• Semantic acyclicity for conjunctive queries: approximations and constraints
• Combined tractability of query evaluation via tree automata and cycluits
• Comparison of functional and predicative query paradigms

This page was built for publication: Semantically Acyclic Conjunctive Queries under Functional Dependencies

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