5499 search results - page 211 / 1100 » Generalized Rewrite Theories |
294
click to vote
VLDB
2001
ACM
16 years 7 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
289
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
189
click to vote
ICDE
2010
IEEE
16 years 7 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...
178
click to vote
FOSSACS
2009
Springer
16 years 2 months ago
2009
Springer
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics...
195
click to vote
FOSSACS
2009
Springer
16 years 2 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...