On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases

DOI10.1007/978-3-319-17996-4_22zbMath1336.68054OpenAlexW2345420923MaRDI QIDQ2808079

Son Thanh Cao

Publication date: 26 May 2016

Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17996-4_22

zbMATH Keywords

query processingoptimization methodsdeductive databasesHorn knowledge basesQSQQSQNQSQN-rTREQSQN-TRE

Mathematics Subject Classification ID

Database theory (68P15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• Recursive query processing: The power of logic
• A Generalized QSQR Evaluation Method for Horn Knowledge Bases
• An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases