Antisampling for Estimation: An Overview
IEEE Transactions on Software Engineering
On semantic issues connected with incomplete information databases
ACM Transactions on Database Systems (TODS)
An Approach to Multilevel Boolean Minimization
Journal of the ACM (JACM)
Evaluation of the size of a query expressed in relational algebra
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Accurate estimation of the number of tuples satisfying a condition
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Statistical Databases: Characteristics, Problems, and some Solutions
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
An Analytic Approach to Statistical Databases
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Rule-based statistical calculations on a database abstract
Rule-based statistical calculations on a database abstract
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
A catalog of quick closed-form bounds on set intersection and union sizes is presented; they can be expressed as rules, and managed by a rule-based system architecture. These methods use a variety of statistics precomputed on the data, and exploit homomorphisms (onto mappings) of the data items onto distributions that can be more easily analyzed. The methods can be used anytime, but tend to work best when there are strong or complex correlations in the data. This circumstance is poorly handled by the standard independence-assumption and distributional-assumption estimates.