Abstract
The Deep Web is constituted by data that are accessible through Web pages, but not indexable by search engines as they are returned in dynamic pages. In this paper we propose a conceptual framework for answering keyword queries on Deep Web sources represented as relational tables with so-called access limitations. We formalize the notion of optimal answer and characterize queries for which an answer can be found.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
If other values are known besides the keywords, this knowledge may be represented by means of appropriate unary relations with output mode in the schema.
References
Agrawal, S., Chaudhuri, S., Das, G., DBXplorer: a system for keyword-based search over relational databases. In: ICDE, pp. 5–16 (2002)
Bienvenu, M. et al.: Dealing with the deep web and all its quirks. In: Proceedings of VLDS, pp. 21–24 (2012)
Calì, A., Calvanese, D., Martinenghi, D.: Dynamic query optimization under access limitations and dependencies. J. UCS 15(1), 33–62 (2009)
Calì, A., Martinenghi, D.: Conjunctive query containment under access limitations. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds.) ER 2008. LNCS, vol. 5231, pp. 326–340. Springer, Heidelberg (2008). doi:10.1007/978-3-540-87877-3_24
Calì, A., Martinenghi, D.: Querying data under access limitations. In: ICDE, pp. 50–59 (2008)
Calì, A., Martinenghi, D.: Querying the deep web. In: EDBT, pp. 724–727 (2010)
Calì, A., Martinenghi, D., Torlone, R.: Keyword search in the deep web. In: Proceedings of the 9th AMW (2015)
Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing steiner minimal trees. SIAM J. Appl. Math. 32(4), 835–859 (1977)
Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: SIGMOD, pp. 927–940 (2008)
Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: ranked keyword search over xml documents. In: SIGMOD, pp. 16–27 (2003)
He, B., Zhang, Z., Chang, K.C.-C., Metaquerier: querying structured web sources on-the-fly. In: Proceedings of SIGMOD, pp. 927–929 (2005)
Hristidis, V., Papakonstantinou, Y.: Discover: keyword search in relational databases. In: VLDB, pp. 670–681 (2002)
Jamil, HM, Jagadish, HV.: A structured query model for the deep relational web. In: CIKM, pp. 1679–1682 (2015)
Kimelfeld B., Sagiv Y.: Finding and approximating top-k answers in keyword proximity search. In: PODS, pp. 173–182 (2006)
Lehmann, J., Furche, T., Grasso, G., Ngomo, A.-C.N., Schallhart, C., Sellers, A., Unger, C., Bühmann, L., Gerber, D., Höffner, K., Liu, D., Auer, S.: deqa: deep web extraction for question answering. In: Cudré-Mauroux, P., et al. (eds.) ISWC 2012. LNCS, vol. 7650, pp. 131–147. Springer, Heidelberg (2012). doi:10.1007/978-3-642-35173-0_9
Guoliang Li, E., et al.: EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: SIGMOD, pp. 903–914 (2008)
Madhavan, J., Afanasiev, L., Antova, L., Halevy, A.Y.: Harnessing the deep web: present and future. In: CIDR (2009)
Raghavan, S., Garcia-Molina, H.: Crawling the hidden web. In: VLDB, pp. 129–138 (2001)
Tran, T., Wang, H., Rudolph, S., Cimiano, P.: Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data. In: ICDE, pp. 405–416 (2009)
Yu, J.X., Qin, L., Chang, L.: Keyword search in relational databases: a survey. IEEE Data Eng. Bull. 33(1), 67–78 (2010)
Acknowledgments
A. Calì acknowledges support from the EPSRC grant EP/E010865/1 (“LIQUID”) and from the EU COST Action IC1302 (“KEYSTONE”). D. Martinenghi acknowledges support from the EC’s FP7 “CUbRIK” and “SmartH2O” projects, and the FESR project “Proactive”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Calì, A., Martinenghi, D., Torlone, R. (2016). Keyword Queries over the Deep Web. In: Comyn-Wattiau, I., Tanaka, K., Song, IY., Yamamoto, S., Saeki, M. (eds) Conceptual Modeling. ER 2016. Lecture Notes in Computer Science(), vol 9974. Springer, Cham. https://doi.org/10.1007/978-3-319-46397-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-46397-1_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46396-4
Online ISBN: 978-3-319-46397-1
eBook Packages: Computer ScienceComputer Science (R0)