Selecting and using views to compute aggregate queries (extended abstract)

Afrati, F; Chirkova, R

dc.contributor.author	Afrati, F	en
dc.contributor.author	Chirkova, R	en
dc.date.accessioned	2014-03-01T02:43:31Z
dc.date.available	2014-03-01T02:43:31Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31452
dc.subject	Query Rewriting	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Aggregate queries	en
dc.subject.other	Complexity results	en
dc.subject.other	Extended abstracts	en
dc.subject.other	Query rewritings	en
dc.subject.other	View selection	en
dc.title	Selecting and using views to compute aggregate queries (extended abstract)	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-30570-5_26	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-30570-5_26	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	We consider a workload of aggregate queries and investigate the problem of selecting views that (1) provide equivalent rewritings for all queries, and (2) are optimal, in that the cost of evaluating the query workload is minimized. We consider conjunctive views and rewritings, with or without aggregation; in each rewriting, only one view contributes to computing the aggregated query output. We look at query rewriting using existing views and at view selection. In the query-rewriting problem, we give su.cient and necessary conditions for a rewriting to exist. For view selection, we prove complexity results. Finally, we give algorithms for obtaining rewritings and selecting views. © 2005 Springer-Verlag.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/978-3-540-30570-5_26	en
dc.identifier.isi	ISI:000227472000026	en
dc.identifier.volume	3363 LNCS	en
dc.identifier.spage	383	en
dc.identifier.epage	397	en