### Abstract

We consider the problem of answering queries using views, where queries and views are conjunctive queries with arithmetic comparisons (CQACs) over dense orders. Previous work only considered limited variants of this problem, without giving a complete solution. We have developed a novel algorithm to obtain maximally-contained rewritings (MCRs) for queries having left (or right) semi-interval-comparison predicates. For semi-interval queries, we show that the language of finite unions of CQAC rewritings is not sufficient to find a maximally-contained solution, and identify cases where datalog is sufficient. Finally, we show that it is decidable to obtain equivalent rewritings for CQAC queries.

Original language | English |
---|---|

Title of host publication | Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems |

Pages | 209-220 |

Number of pages | 12 |

Publication status | Published - 2002 |

Externally published | Yes |

Event | Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002) - Madison, WI Duration: 3 Jun 2002 → 5 Jun 2002 |

### Other

Other | Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002) |
---|---|

City | Madison, WI |

Period | 3/6/02 → 5/6/02 |

### ASJC Scopus subject areas

- Software

### Cite this

*Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems*(pp. 209-220)