662 search results - page 36 / 133 » Trees, Automata and XML |
169
click to vote
WEBDB
2010
Springer
15 years 11 months ago
2010
Springer
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
149
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
261
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
263
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
147
Voted
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...