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 advancements in making Yannakakis' algorithm more practical, in terms of both efficiency and ease of implementation, and points out several avenues for future research.

翻译：Yannakakis的开创性算法对于无环连接查询是最优的，但由于其在实际应用中性能不佳，并未被广泛采用。本文简要综述了近期在提升Yannakakis算法的实践性方面取得的进展，包括其执行效率和实现便捷性，并指出了未来研究的若干方向。