AI 中文总结
该研究重新审视比科德关系代数早100多年的塔尔斯基关系代数（TAR），将其作为关系数据库的新基础，设计实现了可组合可控的查询语言Prela，验证其编写的查询兼具简洁性、清晰性与高效性。
AI 中文摘要
我们重新审视塔尔斯基关系代数（TAR），这一关系形式主义比科德的关系代数早了100多年，可作为关系数据库的新基础。我们认为在现代应用代码和系统架构背景下，TAR在语义层和物理层都提供了更优的抽象。为展示TAR的优势，我们设计并实现了可组合且可控的查询语言Prela，结果表明用Prela编写的查询简洁、清晰且高效。
英文摘要
We revisit Tarski's Algebra of Relations (TAR), an old formalism of relations predating Codd's relational algebra by over 100 years, as a new foundation for relational databases. We argue TAR provides a better abstraction at both the semantic level and the physical level, in the context of modern application code and system architecture. To demonstrate the strengths of TAR, we design and implement Prela, a compositional and controllable query language, and show that queries written in Prela are concise, clear, and efficient.
