Efficient sampling strategies for relational database operations
From MaRDI portal
Publication:688673
DOI10.1016/0304-3975(93)90224-HzbMATH Open0797.68048MaRDI QIDQ688673FDOQ688673
Publication date: 14 December 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Sequential analysis. Tests and confidence intervals
- A $k$-Sample Model in Order Statistics
- Title not available (Why is that?)
- The transitive closure of a random digraph
- Query size estimation by adaptive sampling
- Probabilistic counting algorithms for data base applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Query optimization in star computer networks
- On the Estimation of the Number of Classes in a Population
- On the size of projections: I
- Estimating block selectivities
Cited In (13)
- Title not available (Why is that?)
- On sampling representatives of relational schemas with a functional dependency
- Title not available (Why is that?)
- Tracking join and self-join sizes in limited storage
- Query size estimation by adaptive sampling
- Sampling to estimate the number of duplicates in a database
- Robust distributed query processing for streaming data
- Optimal sample cost residues for differential database batch query problems
- How to estimate the sizes of domains
- Statistical profile estimation in database systems
- Title not available (Why is that?)
- Sequential sampling techniques for algorithmic learning theory
- Dynamic analysis of some relational databases parameters
This page was built for publication: Efficient sampling strategies for relational database operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688673)
