Updating recursive xml views of relations

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.

{{stack| {{Infobox file format | icon = | logo = | screenshot = | extension = .

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.

We provide new techniques to efficiently support XML view updates specified in terms of XPath expressions with recursion and complex filters.

The interaction between XPath 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 NP-complete.