A graph-based decomposition approach for recursive query processing

DOI10.1007/3-540-50728-0_40MaRDI QIDQ6199460zbMATH OpenFDO

Authors Dietmar Seipel

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-50728-0_40

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4106311
• Efficient evaluation for a subset of recursive queries
• Transitive closure algorithms for very large databases
• scientific article; zbMATH DE number 4092827
• Fixpoint strategies for deductive databases

Cites work

• scientific article; zbMATH DE number 3874667 (Why is no real title available?)
• scientific article; zbMATH DE number 4049156 (Why is no real title available?)
• scientific article; zbMATH DE number 4049158 (Why is no real title available?)
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases

Cited in

(1)

• Transitive closure algorithms for very large databases

This page was built for publication: A graph-based decomposition approach for recursive query processing

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