Faster methods for random sampling
Communications of the ACM
Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
Filtering search: a new approach to query answering
SIAM Journal on Computing
A probabilistic algorithm for the post office problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Parallel processing can be harmful: the unusual behavior of interpolation search
Information and Computation
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
Query optimization in star computer networks
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Analysis of the Search Performance of Coalesced Hashing
Journal of the ACM (JACM)
Finite Differencing of Computable Expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interpolation search—a log logN search
Communications of the ACM
An optimal evaluation of Boolean expressions in an online query system
Communications of the ACM
Expected time bounds for selection
Communications of the ACM
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Principles of Database Systems
Principles of Database Systems
Efficient processing of relational calculus expressions using range query theory
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract)
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Proceedings of the 12th Colloquium on Automata, Languages and Programming
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Adaptive selectivity estimation using query feedback
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
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(N2/3) for all differential problems involving approximately N executing steps.