OLDTNF-based evaluation method for handling recursive queries in deductive databases

DOI10.1007/BF02917039zbMATH Open0916.68033OpenAlexW2039354580MaRDI QIDQ1286645FDOQ1286645

Authors: Yangjun Chen 

Publication date: 28 July 1999

Published in: Science in China. Series E (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02917039

Recommendations

• scientific article; zbMATH DE number 4106311
• Recursive query processing: The power of logic
• scientific article; zbMATH DE number 4094869
• scientific article; zbMATH DE number 3982568
• Efficient evaluation for a subset of recursive queries

zbMATH Keywords

deductive databasesProlog interpreter

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Parallel complexity of logical query programs
• Title not available (Why is that?)
• Abstract Interpretation Frameworks
• Undecidable optimization problems for database logic programs
• Title not available (Why is that?)
• Efficient bottom-up computation of queries on stratified databases
• Title not available (Why is that?)
• Abstract interpretation based on oldt resolution

Cited In (1)

• OLDTNF

This page was built for publication: OLDTNF-based evaluation method for handling recursive queries in deductive databases

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