Answering queries using views with arithmetic comparisons

Afrati, F; Li, C; Mitra, P

dc.contributor.author	Afrati, F	en
dc.contributor.author	Li, C	en
dc.contributor.author	Mitra, P	en
dc.date.accessioned	2014-03-01T02:42:04Z
dc.date.available	2014-03-01T02:42:04Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30761
dc.subject	Conjunctive Queries	en
dc.subject.other	Algorithms	en
dc.subject.other	Constraint theory	en
dc.subject.other	Optimization	en
dc.subject.other	Problem solving	en
dc.subject.other	Query languages	en
dc.subject.other	Conjunctive queries with arithmetic comparisons	en
dc.subject.other	Equivalent rewriting	en
dc.subject.other	Maximally-contained rewritings	en
dc.subject.other	Digital arithmetic	en
dc.title	Answering queries using views with arithmetic comparisons	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/543613.543641	en
heal.identifier.secondary	http://dx.doi.org/10.1145/543613.543641	en
heal.publicationDate	2002	en
heal.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.	en
heal.journalName	Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems	en
dc.identifier.doi	10.1145/543613.543641	en
dc.identifier.spage	209	en
dc.identifier.epage	220	en