Expressiveness of restricted recursive queries

Afrati, F; Cosmadakis, S

dc.contributor.author	Afrati, F	en
dc.contributor.author	Cosmadakis, S	en
dc.date.accessioned	2014-03-01T02:47:52Z
dc.date.available	2014-03-01T02:47:52Z
dc.date.issued	1989	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33399
dc.subject	Expressive Power	en
dc.subject	Logic Programs	en
dc.title	Expressiveness of restricted recursive queries	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/73007.73018	en
heal.identifier.secondary	http://dx.doi.org/10.1145/73007.73018	en
heal.publicationDate	1989	en
heal.abstract	We study the effect of various syntactic restrictions on the expressive power of database logic programs. We find natural examples of programs whichrequire recursively defined predicates of arbitrarily large width,require rules with arbitrarily many recursive calls, orrequire nonlinear rules, but can be evaluated in NC2.	en
heal.journalName	ACM Symposium on Theory of Computing	en
dc.identifier.doi	10.1145/73007.73018	en