Sciweavers

889 search results - page 101 / 178
» Problems in Rewriting III
Sort
View
ENTCS
2000
114views more  ENTCS 2000»
13 years 9 months ago
Syntactic Type Soundness for the Region Calculus
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
Simon Helsen, Peter Thiemann
SAC
2002
ACM
13 years 9 months ago
Automatic code generation for executing tiled nested loops onto parallel architectures
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
Georgios I. Goumas, Maria Athanasaki, Nectarios Ko...
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 9 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
PVLDB
2008
123views more  PVLDB 2008»
13 years 9 months ago
Dependable cardinality forecasts for XQuery
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...
Jens Teubner, Torsten Grust, Sebastian Maneth, She...
JAPLL
2010
104views more  JAPLL 2010»
13 years 8 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx