16 citations · 16 across the 10 of their papers we have counts for
6 papers · 1 filter
Rerootable Hypertree Decompositions
Zhekai Jiang, Christoph Koch, Peter Lindner +2
Hypertree decompositions are a cornerstone in the theory of answering conjunctive queries efficiently. However, they are not yet widely adopted in practice. Problems related to, e.…
Answering Conjunctive Queries with Aggregations under Updates
Qichen Wang, Xiao Hu
Dynamic query processing keeps query answers up to date during insertions and deletions. For conjunctive queries (CQs) under set semantics, the classes maintainable in constant amo…
Size Bound-Adorned Datalog
Christian Fattebert, Zhekai Jiang, Christoph Koch +2
We introduce EDB-bounded datalog, a framework for deriving upper bounds on intermediate result sizes and the asymptotic complexity of recursive queries in datalog. We present an al…
Towards Parameterized Hardness on Maintaining Conjunctive Queries
Qichen Wang
We investigate the fine-grained complexity of dynamically maintaining the result of fixed self-join free conjunctive queries under single-tuple updates. Prior work shows that free-…
Succinct Structure Representations for Efficient Query Optimization
Zhekai Jiang, Qichen Wang, Christoph Koch
Structural decomposition methods offer powerful theoretical guarantees for join evaluation, yet they are rarely used in real-world query optimizers. A major reason is the difficult…
Database Theory in Action: Yannakakis' Algorithm
Paraschos Koutris, Stijn Vansummeren, Qichen Wang +2
Yannakakis' seminal algorithm is optimal for acyclic joins, yet it has not been widely adopted due to its poor performance in practice. This paper briefly surveys recent advancemen…