Skip to main content

A Self-adaptive Cross-Domain Query Approach on the Deep Web

  • Conference paper
Web-Age Information Management (WAIM 2011)

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

Included in the following conference series:

  • 1727 Accesses

Abstract

As integration systems of data sources in the same domain become more and more, another application comes up with the tide of them. Because of correlation of pairs of domains, when we do some queries involving multiple domains, such as “find a post named software development engineer on job web and look for apartments for rental around the company having been chosen”, we note that general-purpose search engines and general integration frameworks fail to answer cross-domain queries. This paper presents SCDQ, an approach providing fully automated support for cross-domain queries. More specifically, for SCDQ, (i) find which domains are correlated based on data sources having been clustered according to domain. (ii) Recommend different cross-domain paths to meet user’s all possible intentions when query arrives.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. Deutch, D., Greenshpan, O., Milo, T.: Navigating in Complex Mashed-Up Applications. VLDB Endowment 03, 320–329 (2010)

    Article  Google Scholar 

  2. Deutch, D., Greenshpan, O., Milo, T.: Navigating through mashed-up applications with compass. In: ICDE, pp. 1117–1120. IEEE Press, California (2010)

    Google Scholar 

  3. Mashup information, http://en.wikipedia.org/wiki/Mashup_(web_application_hybrid)

    Google Scholar 

  4. Braga, D., Calvanese, D., Campi, A., Ceri, S., Daniel, F., et al.: NGS: a Framework for Multi-Domain Query Answering. In: ICDE Workshop, pp. 254–261. IEEE Press, Cancún (2008)

    Google Scholar 

  5. Ilyas, I.F., Aref, W.G., Elmagarmid, A.: Supporting top-k join queries in relational databases. In: VLDB, pp. 754–765. VLDB Endowment press, Berlin (2003)

    Google Scholar 

  6. Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: ICDE, p. 369. IEEE Press, San Jose (2002)

    Google Scholar 

  7. Chang, K.C.-C., Hwang, S.w.: Minimal probing: supporting expensive predicates for top-k queries. In: SIGMOD, pp. 346–357. ACM Press, New York (2002)

    Google Scholar 

  8. Liu, W., Meng, X., Ling, Y.: A Web database sampling method based on graph model. Journal of Software 19, 179–193 (2008)

    Article  MATH  Google Scholar 

  9. Xiao, G., Liu, J.: The multi-factor decision-making fuzzy evaluation model. Statistics and Decision 09, 12–14 (2007)

    Google Scholar 

  10. Bao, X., Fang, W., Zhao, P., Cui, Z., Hu, P.: A quality estimation model of Deep Web sources. Microelectronics & Computer 25, 47–50 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Y., Shen, D., Nie, T., Yu, G., Shan, J., Yue, K. (2011). A Self-adaptive Cross-Domain Query Approach on the Deep Web. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds) Web-Age Information Management. WAIM 2011. Lecture Notes in Computer Science, vol 6897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23535-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23535-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23534-4

  • Online ISBN: 978-3-642-23535-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics