Incremental recomputation in local languages.

DOI10.1016/S0890-5401(03)00017-8MaRDI QIDQ1401928zbMATH OpenOpenAlexWikidataFDO

Authors Guozhu Dong, Limsoon Wong, Leonid Libkin

Publication date 19 August 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0890-5401(03)00017-8

zbMATH Keywords

First-order logicIncremental recomputationLocalitySQLTransitive closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Local properties of query languages
• Nonrecursive incremental evaluation of Datalog queries
• scientific article; zbMATH DE number 1737514
• Irrelevant updates and self-maintainability in transitive closure database views
• Updates of Relational Views

Cites work

• Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
• Complexity models for incremental computation
• Deterministic FOIES are strictly weaker
• Dyn-FO: A parallel, dynamic complexity class
• scientific article; zbMATH DE number 3819693 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1306899 (Why is no real title available?)
• scientific article; zbMATH DE number 2080398 (Why is no real title available?)
• scientific article; zbMATH DE number 2080476 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Incremental and decremental evaluation of transitive closure by first- order queries
• Languages that Capture Complexity Classes
• Locality of order-invariant first-order formulas
• Logics with aggregate operators
• Notions of locality and their logical characterizations over finite models
• On monadic NP vs monadic co-NP
• Principles of programming with complex objects and collection types
• Query languages for bags and aggregate functions

Cited in

(12)

• Irrelevant updates and self-maintainability in transitive closure database views
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Local properties of query languages
• Nonrecursive incremental evaluation of Datalog queries
• Dynamic conjunctive queries
• The dynamic descriptive complexity of k-clique
• On the quantifier-free dynamic complexity of reachability
• Maintenance of queries under database changes: a unified logic based approach
• A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
• scientific article; zbMATH DE number 2016852 (Why is no real title available?)
• scientific article; zbMATH DE number 1737514 (Why is no real title available?)
• Fixing incremental computation. Derivatives of fixpoints, and the recursive semantics of Datalog

This page was built for publication: Incremental recomputation in local languages.

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