Conjunctive queries with free access patterns under updates
From MaRDI portal
Cites work
- Conjunctive queries with free access patterns under updates
- Conjunctive queries with free access patterns under updates
- Counting Triangles under Updates in Worst-Case Optimal Time
- Dynamic set intersection
- Enumeration complexity of logical query problems with second-order variables
- Evaluation trade-offs for acyclic conjunctive queries
- First-order queries on structures of bounded degree are computable with constant delay
- scientific article; zbMATH DE number 5547867 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 2080475 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- On the Desirability of Acyclic Database Schemes
- Probabilistic databases
- Probabilistic graphical models.
- Rewriting queries using views with access patterns under integrity constraints
- Size bounds and query plans for relational joins
- Size bounds for factorised representations of query results
- The Shapley value of tuples in query answering
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
- Worst-case optimal join algorithms
Cited in
(2)
This page was built for publication: Conjunctive queries with free access patterns under updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960751)
