Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
From MaRDI portal
Publication:6135781
DOI10.46298/lmcs-19(3:11)2023arXiv1907.01988MaRDI QIDQ6135781
Miloš Nikolić, Haozhe Zhang, Ahmet Kara, Dan Olteanu
Publication date: 26 August 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01988
Related Items (3)
Range updates and range sum queries on multidimensional points with monoid weights ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ General space-time tradeoffs via relational queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Database query processing using finite cursor machines
- Size Bounds and Query Plans for Relational Joins
- Enumeration Complexity of Logical Query Problems with Second-order Variables
- Approximating fractional hypertree width
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- Enumeration of monadic second-order queries on trees
- On the Desirability of Acyclic Database Schemes
- Probabilistic Databases
- The Design of Arbitrage-Free Data Pricing Schemes
- Efficient Enumeration for Conjunctive Queries over X-underbar Structures
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- Worst-case Optimal Join Algorithms
- MSO queries on trees
- Size Bounds for Factorised Representations of Query Results
- Counting Triangles under Updates in Worst-Case Optimal Time
- First-order queries on structures of bounded degree are computable with constant delay
- Enumeration for FO Queries over Nowhere Dense Graphs
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
This page was built for publication: Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
