Answering queries using views with arithmetic comparisons

Foto Afrati, Chen Li, Prasenjit Mitra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Pages209-220
Number of pages12
Publication statusPublished - 2002
Externally publishedYes
EventProceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002) - Madison, WI
Duration: 3 Jun 20025 Jun 2002

Other

OtherProceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002)
CityMadison, WI
Period3/6/025/6/02

ASJC Scopus subject areas

  • Software

Cite this

Afrati, F., Li, C., & Mitra, P. (2002). Answering queries using views with arithmetic comparisons. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 209-220)

Answering queries using views with arithmetic comparisons. / Afrati, Foto; Li, Chen; Mitra, Prasenjit.

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2002. p. 209-220.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Afrati, F, Li, C & Mitra, P 2002, Answering queries using views with arithmetic comparisons. in Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. pp. 209-220, Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002), Madison, WI, 3/6/02.
Afrati F, Li C, Mitra P. Answering queries using views with arithmetic comparisons. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2002. p. 209-220
Afrati, Foto ; Li, Chen ; Mitra, Prasenjit. / Answering queries using views with arithmetic comparisons. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2002. pp. 209-220
@inproceedings{0d0df049e1934d54913d04a41031e4ad,
title = "Answering queries using views with arithmetic comparisons",
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.",
author = "Foto Afrati and Chen Li and Prasenjit Mitra",
year = "2002",
language = "English",
pages = "209--220",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",

}

TY - GEN

T1 - Answering queries using views with arithmetic comparisons

AU - Afrati, Foto

AU - Li, Chen

AU - Mitra, Prasenjit

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036041424&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036041424&partnerID=8YFLogxK

M3 - Conference contribution

SP - 209

EP - 220

BT - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

ER -