Sciweavers

134 search results - page 1 / 27
» Using Regular Tree Automata as XML Schemas
Sort
View
ADL
2000
Springer
225views Digital Library» more  ADL 2000»
13 years 9 months ago
Using Regular Tree Automata as XML Schemas
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
Boris Chidlovskii
FROCOS
2007
Springer
13 years 11 months ago
Languages Modulo Normalization
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
Hitoshi Ohsaki, Hiroyuki Seki
CIKM
2008
Springer
13 years 6 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
DBPL
2005
Springer
135views Database» more  DBPL 2005»
13 years 10 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
ACJ
2006
85views more  ACJ 2006»
13 years 4 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