Bounded Arity Datalog(≠) Queries on Graphs

Afrati, FN

dc.contributor.author	Afrati, FN	en
dc.date.accessioned	2014-03-01T01:45:54Z
dc.date.available	2014-03-01T01:45:54Z
dc.date.issued	1997	en
dc.identifier.issn	00220000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24779
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0031247923&partnerID=40&md5=70494a39faec6268a36f8c5923e65829	en
dc.subject.other	Computational complexity	en
dc.subject.other	Graph theory	en
dc.subject.other	Recursive functions	en
dc.subject.other	Relational database systems	en
dc.subject.other	Theorem proving	en
dc.subject.other	Extensional database (EDB) predicates	en
dc.subject.other	Fixed subgraph homeomorphism query	en
dc.subject.other	Intensional database (IDB) predicates	en
dc.subject.other	Query languages	en
dc.title	Bounded Arity Datalog(≠) Queries on Graphs	en
heal.type	journalArticle	en
heal.publicationDate	1997	en
heal.abstract	We show that there are Datalog(≠) 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 at least equal to the number of arcs in the pattern graph. © 1997 Academic Press.	en
heal.journalName	Journal of Computer and System Sciences	en
dc.identifier.volume	55	en
dc.identifier.issue	2	en
dc.identifier.spage	210	en
dc.identifier.epage	228	en