The field of database query evaluation is moving towards more efficient and tractable solutions for complex queries. Researchers are exploring new methods to quantify the contributions of database facts to query answers, such as weighted sums of minimal supports, which offer a more tractable alternative to traditional Shapley value-based approaches. Additionally, there is a growing interest in formal frameworks for efficient query evaluation under time constraints, with a focus on complex event recognition and streaming algorithms. Furthermore, the development of zero-knowledge protocols for proving regular expression equivalence is opening up new possibilities for secure and private query evaluation. Noteworthy papers in this area include: Shapley Revisited: Tractable Responsibility Measures for Query Answers, which introduces a new family of responsibility measures with tractable data complexity. Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge, which presents the first zero-knowledge protocol for encoding regular expression equivalence proofs. Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints, which provides polynomial-time algorithms for computing the polymatroid bound and evaluating conjunctive queries under simple degree constraints.