{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T18:56:17Z","timestamp":1778871377610,"version":"3.51.4"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p>Many databases on the web are \"hidden\" behind (i.e., accessible only through) their restrictive, form-like, search interfaces. Recent studies have shown that it is possible to estimate aggregate query answers over such hidden web databases by issuing a small number of carefully designed search queries through the restrictive web interface. A problem with these existing work, however, is that they all assume the underlying database to be static, while most real-world web databases (e.g., Amazon, eBay) are frequently updated. In this paper, we study the novel problem of estimating\/tracking aggregates over dynamic hidden web databases while adhering to the stringent query-cost limitation they enforce (e.g., at most 1,000 search queries per day). Theoretical analysis and extensive real-world experiments demonstrate the effectiveness of our proposed algorithms and their superiority over baseline solutions (e.g., the repeated execution of algorithms designed for static web databases).<\/jats:p>","DOI":"10.14778\/2732977.2732985","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"1107-1118","source":"Crossref","is-referenced-by-count":10,"title":["Aggregate estimation over dynamic hidden web databases"],"prefix":"10.14778","volume":"7","author":[{"given":"Weimo","family":"Liu","sequence":"first","affiliation":[{"name":"The George Washington University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saravanan","family":"Thirumuruganathan","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[{"name":"The George Washington University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.09.014"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543615"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/603867.603884"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142601"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247550"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807259"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.112"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739051"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000001"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142595"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687665"},{"key":"e_1_2_1_12_1","volume-title":"VLDB","author":"Garofalakis M. N.","year":"2001","unstructured":"M. N. Garofalakis and P. B. Gibbons . Approximate query processing: Taming the terabytes . In VLDB , 2001 . M. N. Garofalakis and P. B. Gibbons. Approximate query processing: Taming the terabytes. In VLDB, 2001."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/314500.315083"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014071"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-012-2859-3"},{"key":"e_1_2_1_16_1","unstructured":"W. Liu S. Thirumuruganathan N. Zhang and G. Das. Aggregate estimation over dynamic hidden web databases http:\/\/arxiv.org\/pdf\/1403.2763.pdf.  W. Liu S. Thirumuruganathan N. Zhang and G. Das. Aggregate estimation over dynamic hidden web databases http:\/\/arxiv.org\/pdf\/1403.2763.pdf."},{"key":"e_1_2_1_17_1","volume-title":"VLDB","author":"Raghavan S.","year":"2001","unstructured":"S. Raghavan and H. Garcia-Molina . Crawling the hidden web . In VLDB , 2001 . S. Raghavan and H. Garcia-Molina. Crawling the hidden web. In VLDB, 2001."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350232"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951416"},{"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\/2732977.2732985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:21:01Z","timestamp":1672226461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732977.2732985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":21,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.14778\/2732977.2732985"],"URL":"https:\/\/doi.org\/10.14778\/2732977.2732985","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}