{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:37:46Z","timestamp":1764239866308},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:p>\n            A\n            <jats:italic>hidden database<\/jats:italic>\n            refers to a dataset that an organization makes accessible on the web by allowing users to issue queries through a search interface. In other words, data acquisition from such a source is not by following static hyper-links. Instead, data are obtained by querying the interface, and reading the result page dynamically generated. This, with other facts such as the interface may answer a query only partially, has prevented hidden databases from being crawled effectively by existing search engines.\n          <\/jats:p>\n          <jats:p>This paper remedies the problem by giving algorithms to extract all the tuples from a hidden database. Our algorithms are provably efficient, namely, they accomplish the task by performing only a small number of queries, even in the worst case. We also establish theoretical results indicating that these algorithms are asymptotically optimal -- i.e., it is impossible to improve their efficiency by more than a constant factor. The derivation of our upper and lower bound results reveals significant insight into the characteristics of the underlying problem. Extensive experiments confirm the proposed techniques work very well on all the real datasets examined.<\/jats:p>","DOI":"10.14778\/2350229.2350232","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1112-1123","source":"Crossref","is-referenced-by-count":49,"title":["Optimal algorithms for crawling a hidden database in the web"],"prefix":"10.14778","volume":"5","author":[{"given":"Cheng","family":"Sheng","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[{"name":"George Washington University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Tao","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong and Korea Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Jin","sequence":"additional","affiliation":[{"name":"George Washington University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,7]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"87","volume-title":"WebDB","author":"Agichtein E.","year":"2003","unstructured":"E. Agichtein , P. G. Ipeirotis , and L. Gravano . Modeling query-based access to text databases . In WebDB , pages 87 -- 92 , 2003 . E. Agichtein, P. G. Ipeirotis, and L. Gravano. Modeling query-based access to text databases. In WebDB, pages 87--92, 2003."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802954.1802989"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242627"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453868"},{"issue":"1","key":"e_1_2_1_5_1","first-page":"133","article-title":"Siphoning hidden-web data through keyword-based interfaces","volume":"1","author":"Barbosa L.","year":"2010","unstructured":"L. Barbosa and J. Freire . Siphoning hidden-web data through keyword-based interfaces . JIDM , 1 ( 1 ): 133 -- 144 , 2010 . L. Barbosa and J. Freire. Siphoning hidden-web data through keyword-based interfaces. JIDM, 1(1):133--144, 2010.","journal-title":"JIDM"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879016"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739138"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383040"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807259"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687665"},{"key":"e_1_2_1_11_1","first-page":"679","volume-title":"VLDB","author":"Dragut E.","year":"2006","unstructured":"E. Dragut , C. Yu , and W. Meng . Meaningful labeling of integrated query interfaces . In VLDB , pages 679 -- 690 , 2006 . E. Dragut, C. Yu, and W. Meng. Meaningful labeling of integrated query interfaces. In VLDB, pages 679--690, 2006."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872784"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014071"},{"key":"e_1_2_1_14_1","first-page":"394","volume-title":"VLDB","author":"Ipeirotis P.","year":"2002","unstructured":"P. Ipeirotis and L. Gravano . Distributed search over the hidden web: Hierarchical database sampling and selection . In VLDB , pages 394 -- 405 , 2002 . P. Ipeirotis and L. Gravano. Distributed search over the hidden web: Hierarchical database sampling and selection. In VLDB, pages 394--405, 2002."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989381"},{"key":"e_1_2_1_16_1","first-page":"402","volume-title":"ER (Workshops)","author":"Liddle S.","year":"2002","unstructured":"S. Liddle , D. Embley , D. Scott , and S. Yau . Extracting data behind web forms . In ER (Workshops) , pages 402 -- 413 , 2002 . S. Liddle, D. Embley, D. Scott, and S. Yau. Extracting data behind web forms. In ER (Workshops), pages 402--413, 2002."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454163"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065385.1065407"},{"key":"e_1_2_1_19_1","first-page":"129","volume-title":"VLDB","author":"Raghavan S.","year":"2001","unstructured":"S. Raghavan and H. Garcia-Molina . Crawling the hidden web . In VLDB , pages 129 -- 138 , 2001 . S. Raghavan and H. Garcia-Molina. Crawling the hidden web. In VLDB, pages 129--138, 2001."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458279"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007583"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2350229.2350232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:25:04Z","timestamp":1672226704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2350229.2350232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["10.14778\/2350229.2350232"],"URL":"https:\/\/doi.org\/10.14778\/2350229.2350232","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}