A random walk approach to sampling hidden databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 629-640

  Dasgupta, Arjun ^a   Das, Gautam ^a   Mannila, Heikki ^b  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^b HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Hidden databases; Random walk; Sampling; Top k interfaces

Indexed keywords

DATA DISTRIBUTION; HIDDEN DATABASES; PROBABILISTIC REJECTION; QUERY SPACE;

DATA PROCESSING; PROBABILITY; QUALITY OF SERVICE; QUERY PROCESSING; WORLD WIDE WEB;

DATABASE SYSTEMS;

EID: 35448942785     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247550     Document Type: Conference Paper

References (17)

1. Z. Bar-Yossef and M. Gurevich. Random Sampling from a Search Engine's Index. In Proceedings of WWW, 2006, 367-376.
2. K. Bharat and A. Broder. A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines. In Proceedings of WWW, 1998, 379-388.
3. J.P. Callan, M. Connell and A. Du. Automatic Discovery of Language Models for Text Databases. In Proceedings of ACM SIGMOD, 1999, 479-490.
4. S. Chaudhuri, G. Das, and U. Srivastava. Effective Use of Block-Level Sampling in Statistics Estimation. In Proceedings of ACM SIGMOD, 2004.
5. http://www.completeplanet.com/Tutorials/DeepWeb
6. M. N. Garofalakis and P. B.Gibbons. Approximate Query Processing: Taming the TeraBytes. In Proceedings of VLDB, 2001.
7. W. Hastings. Monte Carlo Sampling Methods using Markov Chains and their Applications. Biometrika, 57 (1), 1970, 97-109.
8. P. J. Haas, C. A. Koenig. Bi-Level Bernoulli Scheme for Database Sampling. In Proceedings of ACMSIGMOD, 2004, 275-286.
9. Ipeirotis, Panagiotis G., L. Gravano, and M. Sahami. Probe, Count, and Classify: Categorizing Hidden Web databases. In Proceedings of ACM SIGMOD, 2001.
10. S. Lawrence and C. L. Giles. Accessibility of Information on the Web. Nature, 400, 1999. 107-109.
11. S. Lawrence and C. L. Giles. Searching the World Wide Web. Science, 280 (5360), 1998.
12. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equations of State Calculations by Fast Computing Machines. J. of Chemical Physics, 21, 1953, 1087-1091.
13. J. Von Neumann. Various Techniques used in Connection with Random Digits. In John von Neumann, Collected Works, Volume V. Oxford, 1963.
14. F. Olken. Random Sampling from Databases. PhD Thesis, University of California, Berkeley, 1993.
15. G. Piatetsky-Shapiro and C. Connell. Accurate Estimation of the Number of Tuples Satisfying a Condition. In Proceedings of ACM SIGMOD, 1984, 256-276.
16. S. Raghavan and H. Garcia-Molina. "Crawling the Hidden Web," In Proceedings of VLDB, 2001, 129-138.
17. J. Vitter. Random Sampling with a Reservoir. ACM Transactions on Mathematical Software, 11(1), 1985.