662 search results - page 83 / 133 » Trees, Automata and XML |
130
click to vote
ICEIS
2007
IEEE
16 years 11 days ago
2007
IEEE
The Xequiv algorithm determines when two XML schemas are equivalent based on their structural organization. It calculates the percentages of schema inclusion in another schema by ...
145
click to vote
BXML
2004
15 years 7 months ago
2004
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
141
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining domain, ...
268
click to vote
VLDB
2002
ACM
16 years 6 months ago
2002
ACM
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
158
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...