Sciweavers

279 search results - page 7 / 56
» Rewriting Logic Semantics of a Plan Execution Language
Sort
View
160
Voted
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
15 years 9 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
ENTCS
2007
104views more  ENTCS 2007»
14 years 9 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
SIGIR
2004
ACM
15 years 3 months ago
A logic-based approach for computing service executions plans in peer-to-peer networks
Abstract. Today, peer-to-peer services can comprise a large and growing number of services, e.g. search services or services dealing with heterogeneous schemas in the context of Di...
Henrik Nottelmann, Norbert Fuhr
OOPSLA
2007
Springer
15 years 3 months ago
A rewriting approach to the design and evolution of object-oriented languages
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
Mark Hills, Grigore Rosu
162
Voted
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 9 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova