{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:29:56Z","timestamp":1742383796203},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540854807"},{"type":"electronic","value":"9783540854814"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85481-4_25","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T14:53:43Z","timestamp":1219244023000},"page":"321-336","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Top-k Data Sources Ranking for Query on Deep Web"],"prefix":"10.1007","author":[{"given":"Derong","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meifang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Kou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiezheng","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1031570.1031584","volume":"33","author":"K.C.-C. Chang","year":"2004","unstructured":"Chang, K.C.-C., He, B., Li, C., Patel, M., Zhang, Z.: Structured databases on the web: Observations and implications. SIGMOD Record\u00a033(3), 61\u201370 (2004)","journal-title":"SIGMOD Record"},{"key":"25_CR2","unstructured":"BrightPlanet.com. The deep web: Surfacing hidden value, http:\/\/brightplanet.com\/deepcontent\/"},{"issue":"4","key":"25_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"Michalis Faloutsos","year":"1999","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: Proc. of ACM SIGCOMM, pp. 251\u2013262 (1999)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"25_CR4","first-page":"217","volume-title":"Proc. of SIGMOD","author":"B. He","year":"2003","unstructured":"He, B., Chang, K.C.-C.: Statistical schema matching across web query interfaces. In: Proc. of SIGMOD, pp. 217\u2013228. ACM Press, New York (2003)"},{"key":"25_CR5","first-page":"147","volume-title":"Proc. of SIGKDD","author":"B. He","year":"2004","unstructured":"He, B., Chang, K.C.-C., Han, J.: Discovering complex matchings across web query interfaces: A correlation mining approach. In: Proc. of SIGKDD, pp. 147\u2013158. ACM Press, New York (2004)"},{"key":"25_CR6","first-page":"211","volume-title":"Proc. of ICDM","author":"J. Han","year":"2002","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining Top-k frequent closed patterns without minimum support. In: Proc. of ICDM, pp. 211\u2013218. IEEE Computer Society, New York (2002)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"Proc. of ACM SIGMOD","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of ACM SIGMOD, pp. 1\u201312. ACM Press, New York (2000)"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/B978-012088469-8.50058-9","volume-title":"Proceedings 2004 VLDB Conference","author":"Martin Theobald","year":"2004","unstructured":"Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: Proc. of VLDB, pp. 648\u2013659 (2004)"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/1076034.1076077","volume-title":"Proc. of SIGIR","author":"M. Theobald","year":"2005","unstructured":"Theobald, M., Schenkel, R., Weikum, G.: Efficient and Self-tuning Incremental Query Expansion for Top-k Query Processing. In: Proc. of SIGIR, pp. 242\u2013249. ACM Press, New York (2005)"},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/B978-012722442-8\/50072-0","volume-title":"Proceedings 2003 VLDB Conference","author":"Ihab F. Ilyas","year":"2003","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting Top-k Join Queries in Relational Databases. In: Proc. of VLDB, pp. 754\u2013765 (2003)"},{"key":"25_CR11","first-page":"64","volume-title":"Proc. of WIRI","author":"G. Kabra","year":"2005","unstructured":"Kabra, G., Li, C.K., Chang, K.C.-C.: Query Routing: Finding Ways in the Maze of the Deep Web. In: Proc. of WIRI, pp. 64\u201373. IEEE Computer Society, New York (2005)"},{"key":"25_CR12","unstructured":"UIUC Web Integration Repository, http:\/\/eagle.cs.uiuc.edu\/metaquerier"},{"key":"25_CR13","unstructured":"Chang, K.C.-C., He, B., Zhang, Z.: Toward large scale integration: Building a metaquerier over databases on the web. In: Proc. of CIDR, pp. 44\u201355 (2005)"},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/B978-012722442-8\/50039-2","volume-title":"Proceedings 2003 VLDB Conference","author":"Hai He","year":"2003","unstructured":"He, H., Meng, W., Yu, C., Wu, Z.: Wise-integrator: An automatic integrator of web search interfaces fore-commerce. In: Proceedings of VLDB, pp. 357\u2013368 (2003)"},{"key":"25_CR15","unstructured":"Raghavan, S., Garcia-Molina, H.: Crawling the hidden web. In: Proc. of VLDB, pp. 129\u2013138 (2001)"},{"key":"25_CR16","unstructured":"Barbosa, L., Freire, J.: Searching for Hidden-Web Databases. In: Proc. of WebDB (2005)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Ipeirotis, P.G., Gravano, L.: Distributed search over the hidden-web: Hierarchical sampling and selection. In: Proc. of VLDB, pp. 394\u2013405 (2002)","DOI":"10.1016\/B978-155860869-6\/50042-1"},{"key":"25_CR18","first-page":"67","volume-title":"Proc. of ACM SIGMOD","author":"P.G. Ipeirotis","year":"2001","unstructured":"Ipeirotis, P.G., Gravano, L., Sahami, M.: Probe, count, and classify: Categorizing hidden web databases. In: Proc. of ACM SIGMOD, pp. 67\u201378. ACM Press, New York (2001)"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/635484.635485","volume":"21","author":"L. Gravano","year":"2003","unstructured":"Gravano, L., Ipeirotis, P., Sahami, M.: QProber, a system for automatic classification of hidden-web databases. ACM TOIS\u00a021(1), 1\u201341 (2003)","journal-title":"ACM TOIS"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s11280-006-0227-7","volume":"9","author":"J. Caverlee","year":"2006","unstructured":"Caverlee, J., Liu, L., Rocco, D.: Discovering Interesting Relationships among Deep Web Databases: A Source-Biased Approach. World Wide Web\u00a09, 585\u2013622 (2006)","journal-title":"World Wide Web"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-76993-4_2","volume-title":"Web Information Systems Engineering \u2013 WISE 2007","author":"L. Shu","year":"2007","unstructured":"Shu, L., Meng, W., He, H., Yu, C.: Querying Capability Modeling and Construction of Deep Web Sources. In: Benatallah, B., Casati, F., Georgakopoulos, D., Bartolini, C., Sadiq, W., Godart, C. (eds.) WISE 2007. LNCS, vol.\u00a04831, pp. 13\u201325. Springer, Heidelberg (2007)"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R. Fagin","year":"2001","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences\u00a066, 614\u2013656 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR23","first-page":"346","volume-title":"Proc. of SIGMOD","author":"K.C.-C. Chang","year":"2002","unstructured":"Chang, K.C.-C., Hwang, S.-W.: Minimal Probing: Supporting Expensive Predicates for Top-K Queries. In: Proc. of SIGMOD, pp. 346\u2013357. ACM Press, New York (2002)"},{"key":"25_CR24","first-page":"162","volume-title":"Proc. of ICDE","author":"A. Marian","year":"2005","unstructured":"Marian, A., Sihem, A.Y., Nick, K., Divesh, S.: Adaptive Processing of Top-k Queries in XML. In: Proc. of ICDE, pp. 162\u2013173. IEEE Computer Society, New York (2005)"},{"key":"25_CR25","first-page":"637","volume-title":"Proc. of VLDB","author":"S. Michel","year":"2005","unstructured":"Michel, S., Triantafillou, P., Weikum, G.: KLEE: A Framework for Distributed Top-k Query Algorithms. In: Proc. of VLDB, pp. 637\u2013648. ACM Press, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering - WISE 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85481-4_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T17:32:39Z","timestamp":1684517559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85481-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540854807","9783540854814"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85481-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}