Memory-saving evaluation plans for Datalog

DOI10.1007/978-3-030-19570-0_29MaRDI QIDQ2296730zbMATH OpenOpenAlexFDO

Authors Carlo Allocca, Roberta Costabile, Alessio Fiorentino, Simona Perri, Jessica Zangari

Publication date 18 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-19570-0_29

zbMATH Keywords

data indexingDatalogontologiesquery answeringquery-plan

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Memoing evaluation for constraint extensions of datalog
• Precomputing Datalog evaluation plans in large-scale scenarios
• A linear algebraic approach to Datalog evaluation
• scientific article; zbMATH DE number 1696779
• Evaluating Datalog via tree automata and cycluits
• Nonrecursive incremental evaluation of Datalog queries
• Logic Programming
• Bottom-up evaluation of Datalog programs with arithmetic constraints

Cited in

(1)

• Precomputing Datalog evaluation plans in large-scale scenarios

This page was built for publication: Memory-saving evaluation plans for Datalog

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