662 search results - page 72 / 133 » Trees, Automata and XML |
302
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
153
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling sc...
201
click to vote
CORR
2011
Springer
15 years 18 days ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
188
Voted
IDEAS
2005
IEEE
15 years 11 months ago
2005
IEEE
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
172
click to vote
RTA
2000
Springer
15 years 9 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...