Affiliation:
1. State Univ. of New York, Albany
Abstract
In many computing applications, there are several equivalent algorithms capable of performing a particular task, and no one is the most efficient under all statistical distributions of the data. In such contexts, a good heuristic is to take a sample of the database and use it to guess which procedure is likely to be the most efficient. This paper defines the very general notion of a differentiable query problem and shows that the ideal sample size for guessing the optimal choice of algorithm is
O
(
N
2/3
) for all differential problems involving approximately
N
executing steps.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference38 articles.
1. Optimal partial-match retrieval when fields are independently specified
2. System R
3. A unifying model of physical databases
4. ~BICKEL P. AND DOKSUM K.A. 3 lathematlca{Statistlcs Ba$ic Ideas and Selected Topic's. Holden- ~Day Inc. Oakland Calif. 1977. ~BICKEL P. AND DOKSUM K.A. 3 lathematlca{Statistlcs Ba$ic Ideas and Selected Topic's. Holden- ~Day Inc. Oakland Calif. 1977.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献