Rewriting algorithms of Boolean queries
Xie Li-cong · Fuzhou daxue xuebao. Ziran kexue ban · 2004
The problem of rewriting for Boolean query in data integration systems is addressed. With consideration of its specialties, the process of rewriting for Boolean query is simplified. A polynomial time rewriting algorithm under the closed world assumption and an exponential time rewriting algorithm under the open world assumption are presented. Both these two algorithms are sound.