Sciweavers

28 search results - page 4 / 6
» On the minimization of XML Schemas and tree automata for unr...
Sort
View
PPDP
2010
Springer
13 years 5 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch
IANDC
2011
91views more  IANDC 2011»
13 years 2 months ago
Queries on Xml streams with bounded delay and concurrency
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
Olivier Gauwin, Joachim Niehren, Sophie Tison
ACJ
2006
85views more  ACJ 2006»
13 years 7 months ago
Tree Automata for Schema-Level Filtering of XML Associations
In this paper we present query filtering techniques based on bottom-up tree automata for XML access control. In our authorization model (RXACL), RDF statements are used to represen...
Vaibhav Gowadia, Csilla Farkas
CIKM
2008
Springer
13 years 9 months ago
Rewriting of visibly pushdown languages for xml data integration
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
Alex Thomo, Srinivasan Venkatesh
MFCS
2009
Springer
14 years 2 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deï...
P. Madhusudan, Mahesh Viswanathan