1
کامپیوتر و شبکه::
پیش محاسبه
The AD Tree building algorithm scans the dataset once, and precomputes information needed to answer every possible query in time independent of the number of records.
nator of any r-value, are precomputed in our cache.
For example we precompute the fact that A has h(1) values occurring only once, h(2) values occurring twice and in general, h(i) values occurring i times.
When testing attribute set A in record t, we compute C(at), and compare that to the precomputed histogram.
واژگان شبکه مترجمین ایران