Computational complexity of the problem of tree generation under fine-grained access control policies

DOI10.1016/j.ic.2010.11.019zbMath1221.68094OpenAlexW2024829078MaRDI QIDQ553325

Neil Moore

Publication date: 27 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.019

zbMATH Keywords

complexityfine-grained access controltree updates

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

One-variable context-free hedge automata

Uses Software

• XQuery
• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• XML queries and constraints, containment and reformulation
• Reasoning about XML update constraints
• The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
• Containment and equivalence for a fragment of XPath

This page was built for publication: Computational complexity of the problem of tree generation under fine-grained access control policies