Most state-of-the art approaches for securing XML documents allow users to access data only through authorized views defined by annotating an XML grammar (e.g. To prevent improper disclosure of confidential information, user queries posed on these views need to be rewritten into equivalent queries on the underlying documents.
This rewriting enables us to avoid the overhead of view materialization and maintenance.
Please check on the web2py web site and mailing list for more recent adapters.
Google No SQL is treated as a particular case in Chapter 13.
We investigate the extension of the downward class of XPath, composed only by child and descendant axes, with some axes and operators and we propose a general approach to rewrite queries under recursive XML views.
Unlike Regular XPath-based works, we provide a rewriting algorithm which processes the query only over the annotated DTD grammar and which can run in linear time in the size of the query.
The term has a variety of meanings specific to a variety of disciplines ranging from linguistics to logic.
A relational database is a collection of data items organized as a set of formally described tables from which data can be accessed easily.
In this paper, we show that query rewriting is always possible for recursive XML views using only the expressive power of the standard XPath.The interaction between XFath recursion and DAG compression of XML views makes the analysis of XML view updates intriguing.Moreover, we propose a mild condition on SPJ views, and show that under this condition the analysis of deletions on relational views becomes PTIME while the insertion analysis is NF-complete.In response to these, on the XML side, we revise the update semantics to accommodate XML side effects based on the semantics of XML views, and present efficient algorithms to translate XML updates to relational view updates.On the relational side, we propose a mild condition on SPJ views, and show that under this condition the analysis of deletions on relational views becomes PTIME while the insertion analysis is NP-complete.