Download now Free registration required
In this paper the authors investigate the feasibility and efficiency of mapping XML data and access control policies onto relational and native XML databases for storage and querying. They developed a re-annotation algorithm that computes the XPath query which designates the XML nodes to be re-annotated when an update operation occurs. The algorithm uses XPath static analysis and the experimental results show that the re-annotation solution is on the average 7 times faster than annotating the entire document.
- Format: PDF
- Size: 280.8 KB