Creating nested mappings with clio
Mauricio A. Hernández, Ward Ho, et al.
ICDE 2007
Many classical database problems such as semantic optimization, minimization, rewriting using views, equivalent query reformulation in data publishing and integration, are particular instances of query reformulation under constraints. while the general reformulation problem is undecidable, the least restrictive known conditions which are sufficient to guarantee decidability hold in numerous practical scenarios. C&B is a sound and complete algorithm, which provide a uniform solution to the above database problems. The C&B method is viable in practice with careful engineering of the chase and backchase phases.
Mauricio A. Hernández, Ward Ho, et al.
ICDE 2007
Ronald Fagin, Phokion G. Kolaitis, et al.
ACM TODS
Ronald Fagin, Phokion G. Kolaitis, et al.
Theoretical Computer Science
Yu Zhang, Yunyi Zhang, et al.
AAAI 2024