Pages that link to "Item:Q1898482"
From MaRDI portal
The following pages link to Incremental and decremental evaluation of transitive closure by first- order queries (Q1898482):
Displaying 12 items.
- Maintaining transitive closure in first order after node-set and edge-set deletions (Q287062) (← links)
- Irrelevant updates and self-maintainability in transitive closure database views (Q1029040) (← links)
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
- Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
- The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- Local properties of query languages (Q1575140) (← links)
- Maintenance of datalog materialisations revisited (Q2321273) (← links)
- Dynamic Complexity of the Dyck Reachability (Q2988373) (← links)
- Reachability is in DynFO (Q3449473) (← links)
- SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-<font>ary</font> INPUT RELATIONS (Q4528763) (← links)
- Incremental Event Calculus for Run-Time Reasoning (Q5076337) (← links)