基于XPath的访问控制策略的静态可执行性
Static Enforceability of XPath-Based Access Control Policies
摘要：
我们考虑使用使用XPath表达式指定的细粒度、高级访问控制策略来扩展XML数据库的问题。大多数以前的工作动态地检查单个更新，这是昂贵的（需要与数据库大小成比例的最坏情况执行时间）。另一方面，静态实施可以在不访问数据库的情况下执行，但可能是不完整的，因为它可能禁止动态实施允许的访问。我们引入拓扑表征的碎片，以研究的问题，确定何时可以执行静态的访问控制策略，而不损失的精度。我们介绍的公平的政策，静态可执行的概念，并研究确定公平性和静态执法本身的复杂性。
英文摘要：
We consider the problem of extending XML databases with fine-grained, high-level access control policies specified using XPath expressions. Most prior work checks individual updates dynamically, which is expensive (requiring worst-case execution time proportional to the size of the database). On the other hand, static enforcement can be performed without accessing the database but may be incomplete, in the sense that it may forbid accesses that dynamic enforcement would allow. We introduce topological characterizations of XPath fragments in order to study the problem of determining when an access control policy can be enforced statically without loss of precision. We introduce the notion of fair policies that are statically enforceable, and study the complexity of determining fairness and of static enforcement itself.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
