Graph traversal and top-down evaluation of logic queries

DOI10.1007/BF02946620MaRDI QIDQ1130171zbMATH OpenFDO

Authors Yangjun Chen

Publication date 20 August 1998

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

linear recursive querieslogic query

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the graph traversal method for evaluating linear binary-chain programs
• scientific article; zbMATH DE number 1406216
• On the bottom-up evaluation of recursive queries

Cites work

• scientific article; zbMATH DE number 993474 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Comparison of methods for logic-query implementation
• Counting and topological order
• Depth-First Search and Linear Graph Algorithms
• Efficient bottom-up computation of queries on stratified databases
• Magic sets revisited
• On the power of magic
• Towards an algebraic theory of recursion

Cited in

(4)

• The query topology in logic programming
• Path querying on acyclic graphs using Boolean grammars
• An accelerated search on the graph: PROLOG representation
• Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Graph traversal and top-down evaluation of logic queries

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