A Time Bound on the Materialization of Some Recursively Defined Views
Authors: 
Yannis Ioannidis
Date published: 
1986
Published In: 
Algorithmica, Vol 1, No 4, Oct. 1986, pp. 361-385 (Expanded version of the VLDB '85 paper; it appears in a special issue containing the best papers of the conference.)
Type: 
Journal Article
Abstract: 

A virtual relation (or view) can be defined with a recursive Horn clause that is a function of one or more base relations. In general, the number of times such a Horn clause must be applied in order to retrieve all the tuples in the virtual relation depends on the contents of the base relations of the definition. However, there exist Horn clauses for which there is an upper bound on the number of applications necessary to form the virtual relation, independent of the contents of the base relations. Considering a restricted class of recursive Horn clauses, we give necessary and sufficient conditions for members of the class to have this bound.

 

Related files: 

MaDgIK 2009-2016