Sciweavers

279 search results - page 5 / 56
» Tree Pattern Rewriting Systems
Sort
View
VLDB
2007
ACM
152views Database» more  VLDB 2007»
16 years 2 months ago
Structured Materialized Views for XML Queries
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
Andrei Arion, Ioana Manolescu, Véronique Be...
133
Voted
ACL
1992
15 years 3 months ago
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
David J. Weir
FLOPS
2004
Springer
15 years 6 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar
115
Voted
HOA
1993
15 years 6 months ago
Strong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
Steffen van Bakel, Maribel Fernández