Bounded Arity Datalog (not-)Queries on Graphs

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Afrati, F en
dc.date.accessioned 2014-03-01T01:45:32Z
dc.date.available 2014-03-01T01:45:32Z
dc.date.issued 1997 en
dc.identifier.uri http://hdl.handle.net/123456789/24617
dc.subject Binary Relation en
dc.title Bounded Arity Datalog (not-)Queries on Graphs en
heal.type journalArticle en
heal.identifier.primary 10.1006/jcss.1997.1521 en
heal.identifier.secondary http://dx.doi.org/10.1006/jcss.1997.1521 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. en
heal.journalName Journal of Computer and System Sciences en
dc.identifier.doi 10.1006/jcss.1997.1521 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record