查询具有访问限制的架构
Querying Schemas With Access Restrictions
摘要:
我们研究验证系统的过渡包括访问基于Web的数据源。访问是在关系数据库中查找关系,为关系中的一组位置固定值。例如,转换可以表示对Web表单的访问,其中用户被限制为填写特定字段集的值。我们看看验证属性的模式描述这样一个系统的可能访问。我们提出了一种语言,其中可以描述的访问路径的属性,并指定额外的限制访问所实施的模式。我们的主要属性语言,AccLTL,是基于线性时间时态逻辑的一阶扩展,解释访问路径的关系结构序列。我们还提出了一个较低级别的自动机模型,Aautomata,AccLTL规范可以编译成。我们表明,AccLTL和A-自动机可以表达静态分析问题有关的“查询有限的访问模式”,在过去的数据库文献中已经研究过,如访问是否相关回答查询,以及两个查询是否是等价的,在可访问的数据,他们可以返回。我们证明了可判定性和复杂性结果的几个限制和变体的AccLTL,并解释哪些属性的路径可以表示在每个限制。
英文摘要:
We study verification of systems whose transitions consist of accesses to a Web-based data-source. An access is a lookup on a relation within a relational database, fixing values for a set of positions in the relation. For example, a transition can represent access to a Web form, where the user is restricted to filling in values for a particular set of fields. We look at verifying properties of a schema describing the possible accesses of such a system. We present a language where one can describe the properties of an access path, and also specify additional restrictions on accesses that are enforced by the schema. Our main property language, AccLTL, is based on a first-order extension of linear-time temporal logic, interpreting access paths as sequences of relational structures. We also present a lower-level automaton model, Aautomata, which AccLTL specifications can compile into. We show that AccLTL and A-automata can express static analysis problems related to "querying with limited access patterns" that have been studied in the database literature in the past, such as whether an access is relevant to answering a query, and whether two queries are equivalent in the accessible data they can return. We prove decidability and complexity results for several restrictions and variants of AccLTL, and explain which properties of paths can be expressed in each restriction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。