Graph traversal and top-down evaluation of logic queries

DOI10.1007/BF02946620zbMATH Open0903.68068MaRDI QIDQ1130171FDOQ1130171

Authors: Yangjun Chen 

Publication date: 20 August 1998

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

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

zbMATH Keywords

linear recursive querieslogic query

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• On the power of magic
• Towards an algebraic theory of recursion
• Comparison of methods for logic-query implementation
• Efficient bottom-up computation of queries on stratified databases
• Magic sets revisited
• Counting and topological order
• Title not available (Why is that?)

Cited In (4)

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

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)