Linear vs Polynomial Constraints in Database Query Languages

Afrati, F; Cosmadakis, S; Grumbach, S; Kuper, G

dc.contributor.author	Afrati, F	en
dc.contributor.author	Cosmadakis, S	en
dc.contributor.author	Grumbach, S	en
dc.contributor.author	Kuper, G	en
dc.date.accessioned	2014-03-01T02:48:14Z
dc.date.available	2014-03-01T02:48:14Z
dc.date.issued	1994	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33655
dc.subject	Database Query	en
dc.subject	Expressive Power	en
dc.subject	Linear Constraint	en
dc.title	Linear vs Polynomial Constraints in Database Query Languages	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-58601-6_100	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-58601-6_100	en
heal.publicationDate	1994	en
heal.abstract	We prove positive and negative results on the expressive power of the relational calculusaugmented with linear constraints. We show non-expressibility of some properties expressedby polynomial constraints. We also show expressibility of some queries involving existenceof lines, when the query output has a simple geometrical relation to the input. Finally,we compare the expressive power of linear vs. polynomial constraints in the	en
heal.journalName	Principles and Practice of Constraint Programming	en
dc.identifier.doi	10.1007/3-540-58601-6_100	en