Turbo-charging hidden database samplers with overflowing queries and skew reduction

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 51-62

  Dasgupta, Arjun ^a   Zhang, Nan ^b   Das, Gautam ^a  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM SAMPLING; REAL-WORLD DATABASE; SAMPLING EFFICIENCY; SAMPLING TECHNIQUE; SCORING FUNCTIONS; SEARCH QUERIES; SKEW REDUCTION; WEB INTERFACE;

TECHNOLOGY;

DATABASE SYSTEMS;

EID: 77952296875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739051     Document Type: Conference Paper

References (22)

1. M. Alvarez, J. Raposo, A. Pan, F. Cacheda, F. Bellas, and V. Carneiro. Crawling the content hidden behind web forms. In ICCSA, 2007.
2. Z. Bar-Yossef and M. Gurevich. Random sampling from a search engine's index. In WWW, 2006.
3. Z. Bar-Yossef and M. Gurevich. Efficient search engine measurements. In WWW, 2007.
4. D. Barbará, W. DuMouchel, C. Faloutsos, P. J. Haas, J. M. Hellerstein, Y. E. Ioannidis, H. V. Jagadish, T. Johnson, R. T. Ng, V. Poosala, K. A. Ross, and K. C. Sevcik. The new jersey data reduction report. IEEE Data Engineering Bulletin, 20(4):3-45, 1997.
5. L. Barbosa and J. Freire. Siphoning hidden-web data through keyword-based interfaces. In SBBD, 2004.
6. K. Bharat and A. Broder. A technique for measuring the relative size and overlap of public web search engines. In WWW, 1998.
7. N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In ICDE, 2002.
8. J. P. Callan and M. E. Connell. Query-based sampling of text databases. ACM TOIS, 19(2):97-130, 2001.
9. K. C.-C. Chang and S. won Hwang. Minimal probing: supporting expensive predicates for top-k queries. In SIGMOD, 2002.
10. S. Chaudhuri, G. Das, and V. Narasayya. Optimized stratified sampling for approximate query processing. TODS, 32(2), 2007.
11. G. Das. Survey of approximate query processing techniques (tutorial). In SSDBM, 2003.
12. A. Dasgupta, G. Das, and H. Mannila. A random walk approach to sampling hidden databases. In SIGMOD, 2007.
13. A. Dasgupta, N. Zhang, and G. Das. Leveraging count information in sampling hidden databases. In ICDE, 2009.
14. A. Dasgupta, N. Zhang, G. Das, and S. Chaudhuri. Privacy preservation of aggregates in hidden databases: Why and how? In SIGMOD, 2009.
15. M. N. Garofalakis and P. B. Gibbons. Approximate query processing: Taming the terabytes. In VLDB, 2001.
16. Google Base. http://base.google.com.
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. S. W. Liddle, D. W. Embley, D. T. Scott, and S. H. Yau. Extracting data behind web forms. In ER (Workshops), 2002.
20. L. G. Panagiotis G. Ipeirotis. Distributed search over the hidden web: Hierarchical database sampling and selection. In VLDB, 2002.
21. S. Raghavan and H. Garcia-Molina. Crawling the hidden web. In VLDB, 2001.
22. Yahoo! Auto. http://auto.yahoo.com.