Efficient enumeration for conjunctive queries over X-underbar structures

DOI10.1007/978-3-642-15205-4_10MaRDI QIDQ3586035zbMATH OpenOpenAlexFDO

Authors Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin

Publication date 3 September 2010

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15205-4_10

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Conjunctive queries over trees
• Enumeration complexity of conjunctive queries with functional dependencies
• Enumeration complexity of conjunctive queries with functional dependencies
• A glimpse on constant delay enumeration (invited talk)

Cited in

(6)

• Enumeration complexity of conjunctive queries with functional dependencies
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• scientific article; zbMATH DE number 7561584 (Why is no real title available?)
• On the complexity of enumerating the answers to well-designed pattern trees
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
• Bi-arc digraphs: recognition algorithm and applications

This page was built for publication: Efficient enumeration for conjunctive queries over X-underbar structures

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