{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T06:04:59Z","timestamp":1777615499357,"version":"3.51.4"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p>\n            Many web databases are \"hidden\" behind proprietary search interfaces that enforce the top-\n            <jats:italic>k<\/jats:italic>\n            output constraint, i.e., each query returns at most\n            <jats:italic>k<\/jats:italic>\n            of all matching tuples, preferentially selected and returned according to a proprietary ranking function. In this paper, we initiate research into the novel problem of skyline discovery over top-\n            <jats:italic>k<\/jats:italic>\n            hidden web databases. Since skyline tuples provide critical insights into the database and include the top-ranked tuple for every possible ranking function following the monotonic order of attribute values, skyline discovery from a hidden web database can enable a wide variety of innovative third-party applications over one or multiple web databases. Our research in the paper shows that the critical factor affecting the cost of skyline discovery is the type of search interface controls provided by the website. As such, we develop efficient algorithms for three most popular types, i.e., one-ended range, free range and point predicates, and then combine them to support web databases that feature a mixture of these types. Rigorous theoretical analysis and extensive real-world online and offline experiments demonstrate the effectiveness of our proposed techniques and their superiority over baseline solutions.\n          <\/jats:p>","DOI":"10.14778\/2904483.2904491","type":"journal-article","created":{"date-parts":[[2016,4,12]],"date-time":"2016-04-12T12:24:41Z","timestamp":1460463881000},"page":"600-611","source":"Crossref","is-referenced-by-count":22,"title":["Discovering the skyline of web databases"],"prefix":"10.14778","volume":"9","author":[{"given":"Abolfazl","family":"Asudeh","sequence":"first","affiliation":[{"name":"University of Texas at Arlington"}],"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":"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":[[2016,3]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"VLDB","author":"Arai B.","year":"2007","unstructured":"B. Arai , G. Das , D. Gunopulos , and N. Koudas . Anytime measures for top-k algorithms . In VLDB , 2007 . B. Arai, G. Das, D. Gunopulos, and N. Koudas. Anytime measures for top-k algorithms. In VLDB, 2007."},{"key":"e_1_2_1_2_1","volume-title":"Discovering the skyline of web databases. CoRR, abs\/1512.02138","author":"Asudeh A.","year":"2015","unstructured":"A. Asudeh , S. Thirumuruganathan , N. Zhang , and G. Das . Discovering the skyline of web databases. CoRR, abs\/1512.02138 , 2015 . A. Asudeh, S. Thirumuruganathan, N. Zhang, and G. Das. Discovering the skyline of web databases. CoRR, abs\/1512.02138, 2015."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806451"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_16"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90156-7"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247550"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.112"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739051"},{"key":"e_1_2_1_11_1","volume-title":"VLDB","author":"Dellis E.","year":"2007","unstructured":"E. Dellis and B. Seeger . Efficient computation of reverse skyline queries . In VLDB , 2007 . E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In VLDB, 2007."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10485-5_21"},{"key":"e_1_2_1_13_1","volume-title":"A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys (CSUR), 40(4)","author":"Ilyas I. F.","year":"2008","unstructured":"I. F. Ilyas , G. Beskales , and M. A. Soliman . A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys (CSUR), 40(4) , 2008 . I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys (CSUR), 40(4), 2008."},{"key":"e_1_2_1_14_1","volume-title":"VLDB","author":"Kossmann D.","year":"2002","unstructured":"D. Kossmann , F. Ramsak , and S. Rost . Shooting stars in the sky: An online algorithm for skyline queries . In VLDB , 2002 . D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: An online algorithm for skyline queries. In VLDB, 2002."},{"key":"e_1_2_1_15_1","volume-title":"ICDE","author":"Lin X.","year":"2005","unstructured":"X. Lin , Y. Yuan , W. Wang , and H. Lu . Stabbing the sky: Efficient skyline computation over sliding windows . In ICDE , 2005 . X. Lin, Y. Yuan, W. Wang, and H. Lu. Stabbing the sky: Efficient skyline computation over sliding windows. In ICDE, 2005."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367854"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-012-2859-3"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.04.003"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454163"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872814"},{"key":"e_1_2_1_21_1","volume-title":"VLDB","author":"Pei J.","year":"2007","unstructured":"J. Pei , B. Jiang , X. Lin , and Y. Yuan . Probabilistic skylines on uncertain data . In VLDB , 2007 . J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In VLDB, 2007."},{"key":"e_1_2_1_22_1","volume-title":"VLDB","author":"Raghavan S.","year":"2000","unstructured":"S. Raghavan and H. Garcia-Molina . Crawling the hidden web . VLDB , 2000 . S. Raghavan and H. Garcia-Molina. Crawling the hidden web. VLDB, 2000."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350232"},{"key":"e_1_2_1_24_1","volume-title":"VLDB","author":"Tan K.-L.","year":"2001","unstructured":"K.-L. Tan , P.-K. Eng , B. C. Ooi , Efficient progressive skyline computation . In VLDB , 2001 . K.-L. Tan, P.-K. Eng, B. C. Ooi, et al. Efficient progressive skyline computation. In VLDB, 2001."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951416"},{"key":"e_1_2_1_26_1","volume-title":"VLDB","author":"Yiu M. L.","year":"2007","unstructured":"M. L. Yiu and N. Mamoulis . Efficient processing of top-k dominating queries on multi-dimensional data . In VLDB , 2007 . M. L. Yiu and N. Mamoulis. Efficient processing of top-k dominating queries on multi-dimensional data. In VLDB, 2007."},{"key":"e_1_2_1_27_1","volume-title":"On skyline groups. TKDE, 26(4)","author":"Zhang N.","year":"2014","unstructured":"N. Zhang , C. Li , N. Hassan , S. Rajasekaran , and G. Das . On skyline groups. TKDE, 26(4) , 2014 . N. Zhang, C. Li, N. Hassan, S. Rajasekaran, and G. Das. On skyline groups. TKDE, 26(4), 2014."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2904483.2904491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:50:16Z","timestamp":1672224616000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2904483.2904491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.14778\/2904483.2904491"],"URL":"https:\/\/doi.org\/10.14778\/2904483.2904491","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}