Approximate rewriting of queries using views

Foto Afrati, Manik Chandrachud, Rada Chirkova, Prasenjit Mitra

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

3 Citations (Scopus)

Abstract

We study approximate, that is contained and containing, rewritings of queries using views. We consider conjunctive queries with arithmetic comparisons (CQACs), which capture the full expressive power of SQL select-project-join queries. For contained rewritings, we present a sound and complete algorithm for constructing, for CQAC queries and views, a maximally-contained rewriting (MCR) whose all CQAC disjuncts have up to a predetermined number of view literals. For containing rewritings, we present a sound and efficient algorithm pruned-MiCR, which computes a CQAC containing rewriting that does not contain any other CQAC containing rewriting (i.e., computes a minimally containing rewriting, MiCR) and that has the minimum possible number of relational subgoals. As a result, the MiCR rewriting produced by our algorithm may be very efficient to execute. Both algorithms have good scalability and perform well in many practical cases, due to their extensive pruning of the search space, see [1].

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages164-178
Number of pages15
Volume5739 LNCS
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event13th East European Conference on Advances in Databases and Information Systems, ADBIS 2009 - Riga
Duration: 7 Sep 200910 Sep 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5739 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other13th East European Conference on Advances in Databases and Information Systems, ADBIS 2009
CityRiga
Period7/9/0910/9/09

Fingerprint

Rewriting
Query
Acoustic waves
Scalability
Expressive Power
Pruning
Search Space
Join
Efficient Algorithms

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Afrati, F., Chandrachud, M., Chirkova, R., & Mitra, P. (2009). Approximate rewriting of queries using views. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5739 LNCS, pp. 164-178). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5739 LNCS). https://doi.org/10.1007/978-3-642-03973-7_13

Approximate rewriting of queries using views. / Afrati, Foto; Chandrachud, Manik; Chirkova, Rada; Mitra, Prasenjit.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5739 LNCS 2009. p. 164-178 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5739 LNCS).

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

Afrati, F, Chandrachud, M, Chirkova, R & Mitra, P 2009, Approximate rewriting of queries using views. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5739 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5739 LNCS, pp. 164-178, 13th East European Conference on Advances in Databases and Information Systems, ADBIS 2009, Riga, 7/9/09. https://doi.org/10.1007/978-3-642-03973-7_13
Afrati F, Chandrachud M, Chirkova R, Mitra P. Approximate rewriting of queries using views. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5739 LNCS. 2009. p. 164-178. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-03973-7_13
Afrati, Foto ; Chandrachud, Manik ; Chirkova, Rada ; Mitra, Prasenjit. / Approximate rewriting of queries using views. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5739 LNCS 2009. pp. 164-178 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ee01cc17bf7049c0aa6269d036c40f4c,
title = "Approximate rewriting of queries using views",
abstract = "We study approximate, that is contained and containing, rewritings of queries using views. We consider conjunctive queries with arithmetic comparisons (CQACs), which capture the full expressive power of SQL select-project-join queries. For contained rewritings, we present a sound and complete algorithm for constructing, for CQAC queries and views, a maximally-contained rewriting (MCR) whose all CQAC disjuncts have up to a predetermined number of view literals. For containing rewritings, we present a sound and efficient algorithm pruned-MiCR, which computes a CQAC containing rewriting that does not contain any other CQAC containing rewriting (i.e., computes a minimally containing rewriting, MiCR) and that has the minimum possible number of relational subgoals. As a result, the MiCR rewriting produced by our algorithm may be very efficient to execute. Both algorithms have good scalability and perform well in many practical cases, due to their extensive pruning of the search space, see [1].",
author = "Foto Afrati and Manik Chandrachud and Rada Chirkova and Prasenjit Mitra",
year = "2009",
doi = "10.1007/978-3-642-03973-7_13",
language = "English",
isbn = "3642039723",
volume = "5739 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "164--178",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Approximate rewriting of queries using views

AU - Afrati, Foto

AU - Chandrachud, Manik

AU - Chirkova, Rada

AU - Mitra, Prasenjit

PY - 2009

Y1 - 2009

N2 - We study approximate, that is contained and containing, rewritings of queries using views. We consider conjunctive queries with arithmetic comparisons (CQACs), which capture the full expressive power of SQL select-project-join queries. For contained rewritings, we present a sound and complete algorithm for constructing, for CQAC queries and views, a maximally-contained rewriting (MCR) whose all CQAC disjuncts have up to a predetermined number of view literals. For containing rewritings, we present a sound and efficient algorithm pruned-MiCR, which computes a CQAC containing rewriting that does not contain any other CQAC containing rewriting (i.e., computes a minimally containing rewriting, MiCR) and that has the minimum possible number of relational subgoals. As a result, the MiCR rewriting produced by our algorithm may be very efficient to execute. Both algorithms have good scalability and perform well in many practical cases, due to their extensive pruning of the search space, see [1].

AB - We study approximate, that is contained and containing, rewritings of queries using views. We consider conjunctive queries with arithmetic comparisons (CQACs), which capture the full expressive power of SQL select-project-join queries. For contained rewritings, we present a sound and complete algorithm for constructing, for CQAC queries and views, a maximally-contained rewriting (MCR) whose all CQAC disjuncts have up to a predetermined number of view literals. For containing rewritings, we present a sound and efficient algorithm pruned-MiCR, which computes a CQAC containing rewriting that does not contain any other CQAC containing rewriting (i.e., computes a minimally containing rewriting, MiCR) and that has the minimum possible number of relational subgoals. As a result, the MiCR rewriting produced by our algorithm may be very efficient to execute. Both algorithms have good scalability and perform well in many practical cases, due to their extensive pruning of the search space, see [1].

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

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

U2 - 10.1007/978-3-642-03973-7_13

DO - 10.1007/978-3-642-03973-7_13

M3 - Conference contribution

AN - SCOPUS:70449866026

SN - 3642039723

SN - 9783642039720

VL - 5739 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 164

EP - 178

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -