889 search results - page 27 / 178 » Problems in Rewriting III |
SAC
2009
ACM
14 years 4 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
GG
2004
Springer
14 years 3 months ago
2004
Springer
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
EDBT
2010
ACM
14 years 4 months ago
2010
ACM
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...