作者: J. F. Naughton , R. J. Lipton
DOI:
关键词:
摘要: We present a framework for the estimation of size binary recursively defined relations. show how can be used to provide estimating algo rithms transitive closure and generalizations closure, also that bounded degree relations, algorithm runs in linear time. Such algorithms are essential if database systems support recursive relations or fixpoints able optimize queries avoid infeasible computations.