ON THE MEAN EXECUTION TIME OF RECURSIVE DEFINITIONS ON RELATIONAL DATABASES
(EN)
DELAVEGA, WF
(EN)
STAFYLOPATIS, AN
(EN)
PASCHOS, VT
(EN)
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)
