ON THE MEAN EXECUTION TIME OF RECURSIVE DEFINITIONS ON RELATIONAL DATABASES

DELAVEGA, WF; PASCHOS, VT; STAFYLOPATIS, AN

dc.contributor.author	DELAVEGA, WF	en
dc.contributor.author	PASCHOS, VT	en
dc.contributor.author	STAFYLOPATIS, AN	en
dc.date.accessioned	2014-03-01T01:08:28Z
dc.date.available	2014-03-01T01:08:28Z
dc.date.issued	1991	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10507
dc.subject	Cost Reduction	en
dc.subject	Relational Database	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	ON THE MEAN EXECUTION TIME OF RECURSIVE DEFINITIONS ON RELATIONAL DATABASES	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-54009-1_9	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-54009-1_9	en
heal.language	English	en
heal.publicationDate	1991	en
heal.abstract	The execution cost of a regular recursive definition is evaluated in the case where the database relation is represented by means of a forest of labeled oriented trees. The cost is evaluated for all possible types of queries with respect to the binding of the variables in the definition. The mean execution cost is also evaluated, where the mean is computed over all databases representable by forests. Also, a cost reduction technique is investigated-the intermediate storage-and the corresponding execution cost is computed.	en
heal.publisher	SPRINGER VERLAG	en
heal.journalName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-54009-1_9	en
dc.identifier.isi	ISI:A1991FR19700010	en
dc.identifier.volume	495	en
dc.identifier.spage	119	en
dc.identifier.epage	133	en