Bounded arity Datalog (not equal) queries on graphs

Afrati, FN

dc.contributor.author	Afrati, FN	en
dc.date.accessioned	2014-03-01T01:46:24Z
dc.date.available	2014-03-01T01:46:24Z
dc.date.issued	1997	en
dc.identifier.issn	0022-0000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24897
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Bounded arity Datalog (not equal) queries on graphs	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1997	en
heal.abstract	We show that there are Datalog(not equal) queries on graphs (i.e., the extensional database contains a single binary relation) that require recursively defined predicates of arbitrarily large width. More specifically, we prove that fixed subgraph homeomorphism queries require width of recursively defined predicates which is al least equal to the number of arcs in the pattern graph. (C) 1997 Academic Press.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	JOURNAL OF COMPUTER AND SYSTEM SCIENCES	en
dc.identifier.isi	ISI:A1997YF85500003	en
dc.identifier.volume	55	en
dc.identifier.issue	2	en
dc.identifier.spage	210	en
dc.identifier.epage	228	en