134 search results - page 9 / 27 » Using Regular Tree Automata as XML Schemas |
133
click to vote
DEXA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
266
click to vote
ICDE
2002
IEEE
16 years 6 months ago
2002
IEEE
As Web applications manipulate an increasing amount of XML, there is a growing interest in storing XML data in relational databases. Due to the mismatch between the complexity of ...
149
click to vote
JIIS
2008
15 years 4 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
172
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...