Efficient sampling strategies for relational database operations

Theoretical Computer Science

Volumn 116, Issue 1, 1993, Pages 195-226

  Lipton, Richard J ^a   Naughton, Jeffrey F ^b   Schneider, Donovan A ^b   Seshadri, S ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; QUERY LANGUAGES; RANDOM PROCESSES; SAMPLING;

ASYMPTOTIC EFFICIENCY; QUERY SIZE; RELATIONAL DATABASE OPERATIONS; SAMPLING STRATEGIES; SANITY BOUNDS;

DATABASE SYSTEMS;

EID: 0027906155     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(93)90224-H     Document Type: Article

References (34)

1. Benchmarking database systems: A systematic approach
2. Estimating block transfers and join sizes
3. Estimating record selectivities
4. Estimation of the number of tuples satisfying a query expressed in predicate calculus language
5. Database performance evaluation using multiple regression techniques
6. Probabilistic counting algorithms for data base applications
7. On the sizes of projections: a generating function approach
8. On the sizes of projections: I
9. On the sizes of projections: II
10. On the estimation of the number of classes in a population
11. Query optimization in star computer networks
12. Statistical estimators for relational algebra expressions
13. Processing aggregate relational queries with hard time constraints
14. A model of data distribution based on texture analysis
15. The transitive closure of a random digraph
16. Estimating the size of generalized transitive closures
17. Query size estimation by adaptive sampling
18. Selectivity estimation and query optimization in large databases with highly skewed distributions of column values
19. Distribution models of relations
20. The cost of relational algebraic operations on skewed data: estimates and experiments
21. Equidepth histograms for estimating selectivity factors for multi-dimensional queries
22. Simple random sampling for relational databases
23. +-trees
24. Random sampling from hash files
25. Accurate estimation of the number of tuples satisfying a condition
26. On estimating the cardinality of the projection of a database relation
27. Antisampling for estimation an overview
28. Access path selection in a relational database management system
29. A linear-time probabilistic counting algorithm for database applications