Skip to main content
Springer Nature Link
Log in

Selectivity Estimation for Exclusive Query Translation in Deep Web Data Integration

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5463))

Included in the following conference series:

Abstract

In Deep Web data integration, some Web database interfaces express exclusive predicates of the form Q e  = P i (P i  ∈ P 1, P 2,...,P m ), which permits only one predicate to be selected at a time. Accurately and efficiently estimating the selectivity of each Q e is of critical importance to optimal query translation. In this paper, we mainly focus on the selectivity estimation on infinite-value attribute which is more difficult than that on key attribute and categorical attribute. Firstly, we compute the attribute correlation and retrieve approximate random attribute-level samples through submitting queries on the least correlative attribute to the actual Web database. Then we estimate Zipf equation based on the word rank of the sample and the actual selectivity of several words from the actual Web database. Finally, the selectivity of any word on the infinite-value attribute can be derived by the Zipf equation. An experimental evaluation of the proposed selectivity estimation method is provided and experimental results are highly accurate.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. The Deep Web: Surfacing Hidden Value, http://www.completeplanet.com/Tutorials/

  2. Oliken. F.: Random Sampling from databases. PhD Thesis, University of California, Berkeley (1993)

    Google Scholar 

  3. Zhang. Z., He. B., Chang. K. C. C.: On-the-fly Constraint Mapping across Web Query Interfaces. In: IIWEB (2004)

    Google Scholar 

  4. Mandelbrot, B.B.: Fractal Geometry of Nature. W. H. Freeman and Co., New York (1988)

    MATH  Google Scholar 

  5. Dasgupta. A., Das. G., Mannila. H.: A random walk approach to sampling hidden databases. In: SIGMOD, pp. 629–640 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information, Renmin University of China, China

    Fangjiao Jiang & Xiaofeng Meng

  2. College of Physics and Electronic Engineering, Xuzhou Normal University, China

    Fangjiao Jiang

  3. Computer Science Dept, SUNY at Binghamton, USA

    Weiyi Meng

Authors
  1. Fangjiao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weiyi Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofeng Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology and Electrical Engineering, The University of Queensland, QLD 4072, Brisbane, Australia

    Xiaofang Zhou  & Ke Deng  & 

  2. Tokyo Institute of Technology, Graduate School of Information Science and Engineering, 2-12-1 Oh-Okayama Meguro-ku, 152-8552, Tokyo, Japan

    Haruo Yokota

  3. CSIRO, Castray Esplanade, TAS 7000, Hobart, Australia

    Qing Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, F., Meng, W., Meng, X. (2009). Selectivity Estimation for Exclusive Query Translation in Deep Web Data Integration. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00887-0_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00887-0_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00886-3

  • Online ISBN: 978-3-642-00887-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics