On Datalog vs. Polynomial Time

Afrati, F; Cosmadakis, S; Yannakakis, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Cosmadakis, S	en
dc.contributor.author	Yannakakis, M	en
dc.date.accessioned	2014-03-01T02:47:58Z
dc.date.available	2014-03-01T02:47:58Z
dc.date.issued	1991	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33476
dc.subject	Polynomial Time	en
dc.subject	Lower Bound	en
dc.title	On Datalog vs. Polynomial Time	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/113413.113415	en
heal.identifier.secondary	http://dx.doi.org/10.1145/113413.113415	en
heal.publicationDate	1991	en
heal.abstract	We show that certain monotonic polynomial time queries are not expressible in variants of Datalog. The proof techniques include lower bounds for monotone circuit size and a “Pumping Lemma” for Datalog queries.	en
heal.journalName	Symposium on Principles of Database Systems	en
dc.identifier.doi	10.1145/113413.113415	en