Leveraging COUNT information in sampling hidden databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 329-340

  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

FORM-LIKE INTERFACES; ONLINE DATABASE; SEARCH QUERIES;

EID: 67649671784     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.112     Document Type: Conference Paper

References (23)

1. A. Dasgupta, G. Das, and H. Mannila, "A random walk approach to sampling hidden databases," in SIGMOD, 2007.
2. F. Olken and D. Rotem, "Random sampling from databases - a survey," Statistics & Computing, vol. 5, no. 1, pp. 25-42, 1995.
3. J. S. Vitter, "Random sampling with a reservoir," ACM Transactions on Mathematical Software, vol. 11, no. 1, pp. 37-57, 1985.
4. V. T. Chakaravarthy, V. Pandit, S. Roy, P. Awasthi, and M. Mohania, "Decision trees for entity identification: approximation algorithms and hardness results," in PODS, 2007, pp. 53-62.
5. G. Das, "Survey of approximate query processing techniques (tutorial)," in SSDBM, 2003.
6. M. N. Garofalakis and P. B. Gibbons, "Approximate query processing: Taming the terabytes," in VLDB, 2001.
7. 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, vol. 20, no. 4, pp. 3-45, 1997.
8. S. Chaudhuri, G. Das, and U. Srivastava, "Effective use of block-level sampling in statistics estimation," in SIGMOD, 2004.
9. B. Arai, G. Das, D. Gunopulos, and V. Kalogeraki, "Efficient approximate query processing in peer-to-peer networks," TKDE, vol. 19, no. 7, pp. 919-933, 2007.
10. E. Agichtein, P. G. Ipeirotis, and L. Gravano, "Modeling query-based access to text databases," in WebDB, 2003.
11. A. Ntoulas, P. Zerfos, and J. Cho, "Downloading textual hidden web content through keyword queries," in JCDL, 2005.
12. K. Bharat and A. Broder, "A technique for measuring the relative size and overlap of public web search engines," in WWW, 1998.
13. S. Raghavan and H. Garcia-Molina, "Crawling the hidden web," in VLDB, 2001.
14. S. W. Liddle, D. W. Embley, D. T. Scott, and S. H. Yau, "Extracting data behind web forms," in ER (Workshops), 2002.
15. M. Alvarez, J. Raposo, A. Pan, F. Cacheda, F. Bellas, and V. Carneiro, "Crawling the content hidden behind web forms," in ICCSA, 2007.
16. J. P. Callan and M. E. Connell, "Query-based sampling of text databases," ACM Transactions on Information Systems, vol. 19, no. 2, pp. 97-130, 2001.
17. L. G. Panagiotis G. Ipeirotis, "Distributed search over the hidden web: Hierarchical database sampling and selection," in VLDB, 2002.
18. Y.-L. Hedley, M. Younas, A. E. James, and M. Sanderson, "A twophase sampling technique for information extraction from hidden web databases," in WIDM, 2004.
19. -,"Sampling, information extraction and summarisation of hidden web databases," Data and Knowledge Engineering, vol. 59, no. 2, pp. 213-230, 2006.
20. K. C.-C. Chang and S. won Hwang, "Minimal probing: supporting expensive predicates for top-k queries," in SIGMOD, 2002.
21. N. Bruno, L. Gravano, and A. Marian, "Evaluating top-k queries over web-accessible databases," in ICDE, 2002.
22. L. Barbosa and J. Freire, "Siphoning hidden-web data through keywordbased interfaces," in SBBD, 2004.
23. Z. Bar-Yossef and M. Gurevich, "Random sampling from a search engine's index," in WWW, 2006.