Unbiased estimation of size and other aggregates over hidden web databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 855-866

  Dasgupta, Arjun ^a   Jin, Xin ^b   Jewell, Bradley ^a   Zhang, Nan ^b   Das, Gautam ^a  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

aggregate query processing; hidden databases

Indexed keywords

AGGREGATE QUERY PROCESSING; APPROXIMATE QUERY PROCESSING; FORM-LIKE INTERFACES; HIDDEN WEB DATABASE; NOVEL TECHNIQUES; SEARCH QUERIES; UNBIASED ESTIMATES; UNBIASED ESTIMATION; WEB INTERFACE;

AGGREGATES; QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 77954730150     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807259     Document Type: Conference Paper

References (28)

1. E. Agichtein, P. G. Ipeirotis, and L. Gravano. Modeling query-based access to text databases. In WebDB, 2003.
2. M. Alvarez, J. Raposo, A. Pan, F. Cacheda, F. Bellas, and V. Carneiro. Crawling the content hidden behind web forms. In ICCSA, 2007.
3. S. C. Amstrup, B. F. J. Manly, and T. L. McDonald. Handbook of capture-recapture analysis. Princeton University Press, 2005.
4. B. Babcock, S. Chaudhuri, and G. Das. Dynamic sample selection for approximate query processing. In SIGMOD, 2003.
5. Z. Bar-Yossef and M. Gurevich. Efficient search engine measurements. In WWW, 2007.
6. Z. Bar-Yossef and M. Gurevich. Mining search engine query logs via suggestion sampling. In VLDB, 2008.
7. Z. Bar-Yossef and M. Gurevich. Random sampling from a search engine's corpus. Journal of the ACM, 55(5), 2008.
8. K. Bharat and A. Broder. A technique for measuring the relative size and overlap of public web search engines. In WWW, 1998.
9. A. Broder, M. Fontura, V. Josifovski, R. Kumar, R. Motwani, S. U. Nabar, R. Panigrahy, A. Tomkins, and Y. Xu. Estimating corpus size via queries. In CIKM, 2006.
10. N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In ICDE, 2002.
11. J. P. Callan and M. E. Connell. Query-based sampling of text databases. ACM TOIS, 19(2):97-130, 2001.
12. K. C.-C. Chang and S. won Hwang. Minimal probing: supporting expensive predicates for top-k queries. In SIGMOD, 2002.
13. A. Dasgupta, G. Das, and H. Mannila. A random walk approach to sampling hidden databases. In SIGMOD, 2007.
14. A. Dasgupta, N. Zhang, and G. Das. Leveraging count information in sampling hidden databases. In ICDE, 2009.
15. A. Dasgupta, N. Zhang, G. Das, and S. Chaudhuri. Privacy preservation of aggregates in hidden databases: Why and how? In SIGMOD, 2009.
16. J. Gray, P. Sundaresan, S. Englert, K. Baclawski, and P. J. Weinberger. Quickly generating billion-record synthetic databases. In SIGMOD, 1994.
17. Y.-L. Hedley, M. Younas, A. E. James, and M. Sanderson. A two-phase sampling technique for information extraction from hidden web databases. In WIDM, 2004.
18. Y.-L. Hedley, M. Younas, A. E. James, and M. Sanderson. Sampling, information extraction and summarisation of hidden web databases. Data and Knowledge Engineering, 59(2):213-230, 2006.
19. D. Horvitz and D. Thompson. A generalization of sampling without replacement from a finite universe. Journal of the American Statistical Association, 47:663-685, 1952.
20. S. Liddle, D. Embley, D. Scott, and S. Yau. Extracting data behind web forms. In ER (Workshops), 2002.
21. Y. C. Liu, K. and W. Meng. Discovering the representative of a search engine. In CIKM, 2002.
22. J. Lu. Efficient estimation of the size of text deep web data source. In CIKM, 2008.
23. A. Ntoulas, P. Zerfos, and J. Cho. Downloading textual hidden web content through keyword queries. In JCDL, 2005.
24. L. G. Panagiotis G. Ipeirotis. Distributed search over the hidden web: Hierarchical database sampling and selection. In VLDB, 2002.
25. S. Raghavan and H. Garcia-Molina. Crawling the hidden web. In VLDB, 2001.
26. B. Ripley. Stochastic Simulation. Wiley & Sons, New York, 1987.
27. G. A. F. Seber. The estimation of animal abundance and related parameters. MacMillan Press, New York, 1982.
28. M. Shokouhi, J. Zobel, F. Scholer, and S. Tahaghoghi. Capturing collection size for distributed non-cooperative retrieval. In SIGIR, 2006.