On the bottom-up evaluation of recursive queries

DOI10.1002/(SICI)1098-111X(199610)11:10%3C807::AID-INT7%3E3.0.CO;2-2zbMATH Open0862.68045OpenAlexW2135542610MaRDI QIDQ4332202FDOQ4332202

Yangjun Chen

Publication date: 1996

Full work available at URL: https://doi.org/10.1002/(sici)1098-111x(199610)11:10%3C807::aid-int7%3E3.0.co;2-2

Recommendations

• Magic sets revisited
• Efficient evaluation for a subset of recursive queries
• On the power of magic
• scientific article
• Chase of recursive queries

zbMATH Keywords

bottom-up evaluation method

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (11)

• Write it recursively
• Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets
• On the graph traversal method for evaluating linear binary-chain programs
• Compilation and evaluation of linear mutual recursions
• Title not available (Why is that?)
• Efficient bottom-up computation of queries on stratified databases
• Title not available (Why is that?)
• Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
• Characterization and processing of simple prefixed-chain recursion
• One-sided recursions
• Efficient evaluation for a subset of recursive queries

This page was built for publication: On the bottom-up evaluation of recursive queries

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