50 search results - page 5 / 10 » Querying Unranked Trees with Stepwise Tree Automata |
ADBIS
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
ML
2007
ACM
13 years 6 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
IPL
2008
13 years 7 months ago
2008
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
DBPL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, the...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...