Answering queries using materialized views with disjunctions

Afrati, FN; Gergatsoulis, M; Kavalieros, T

dc.contributor.author	Afrati, FN	en
dc.contributor.author	Gergatsoulis, M	en
dc.contributor.author	Kavalieros, T	en
dc.date.accessioned	2014-03-01T01:14:24Z
dc.date.available	2014-03-01T01:14:24Z
dc.date.issued	1999	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13054
dc.subject	Information Integration	en
dc.subject	Materialized Views	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Answering queries using materialized views with disjunctions	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-49257-7_27	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-49257-7_27	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	We consider the problem of answering datalog queries using materialized views. More specifically, queries are rewritten to refer to views instead of the base relations over which the queries were originally written. Much work has been done on program rewriting that produces an equivalent query. In the context of information integration, though, the importance of using views to infer as many answers as possible has been pointed out. Formally, the problem is: Given a datalog program P is there a datalog program P-v which uses only views as EDB predicates and (i) produces a subset of the answers that P produces and (ii) any other program P-v' over the views with property (i) is contained in P-v? In this paper we investigate the problem in the case of disjunctive view definitions.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	DATABASE THEORY - ICDT'99	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-49257-7_27	en
dc.identifier.isi	ISI:000082775200027	en
dc.identifier.volume	1540	en
dc.identifier.spage	435	en
dc.identifier.epage	452	en