Pages that link to "Item:Q4332202"
From MaRDI portal
The following pages link to On the bottom-up evaluation of recursive queries (Q4332202):
Displaying 12 items.
- Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets (Q687932) (← links)
- Graph traversal and top-down evaluation of logic queries (Q1130171) (← links)
- Characterization and processing of simple prefixed-chain recursion (Q1208145) (← links)
- Magic sets revisited (Q1368187) (← links)
- Compilation and evaluation of linear mutual recursions (Q1803866) (← links)
- Chase of Recursive Queries (Q3401938) (← links)
- (Q3830569) (← links)
- Efficient bottom-up computation of queries on stratified databases (Q3988800) (← links)
- (Q4473152) (← links)
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (Q4598259) (← links)
- Write it recursively (Q5178762) (← links)
- On the graph traversal method for evaluating linear binary-chain programs (Q5926750) (← links)