Sciweavers

882 search results - page 57 / 177
» A Taste of Rewrite Systems
Sort
View
PODS
2003
ACM
142views Database» more  PODS 2003»
14 years 7 months ago
Query containment and rewriting using views for regular path queries under constraints
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Gösta Grahne, Alex Thomo
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 7 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CONPAR
1994
13 years 11 months ago
The Rewrite Rule Machine Node Architecture and Its Performance
The Rewrite Rule Machine (RRM) is a massively parallel MIMD/SIMD computer designed with the explicit purpose of supporting veryhigh-level parallel programming with rewrite rules. T...
Patrick Lincoln, José Meseguer, Livio Ricci...
WISE
2007
Springer
14 years 1 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu
VLDB
2011
ACM
245views Database» more  VLDB 2011»
13 years 2 months ago
Normalization and optimization of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. They are an important tool in several areas of database research, notab...
Georg Gottlob, Reinhard Pichler, Vadim Savenkov