279 search results - page 8 / 56 » Tree Pattern Rewriting Systems |
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
CASES
2010
ACM
13 years 7 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
NAACL
2010
13 years 7 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
POPL
2003
ACM
14 years 10 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...