Sciweavers

23201 search results - page 102 / 4641
» Rewriting Systems with Data
Sort
View
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 9 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
IANDC
2010
141views more  IANDC 2010»
15 years 4 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
PODS
2004
ACM
120views Database» more  PODS 2004»
16 years 5 months ago
Locally Consistent Transformations and Query Answering in Data Exchange
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions ? ta...
Marcelo Arenas, Pablo Barceló, Ronald Fagin...
145
Voted
ICDCS
1999
IEEE
15 years 9 months ago
Incorporating Transaction Semantics to Reduce Reprocessing Overhead in Replicated Mobile Data Applications
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in [...
Peng Liu, Paul Ammann, Sushil Jajodia
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
15 years 9 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal