{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:21:21Z","timestamp":1672291281940},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p>Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which triggers the need of ranking mashup results based on some user preferences.<\/jats:p>\n          <jats:p>We present MashRank, a mashup authoring and processing system building on concepts from rank-aware processing, probabilistic databases, and information extraction to enable ranked mashups of (unstructured) sources with uncertain ranking attributes. MashRank is based on new semantics, formulations and processing techniques to handle uncertain preference scores, represented as intervals enclosing possible score values.<\/jats:p>\n          <jats:p>MashRank integrates information extraction with query processing by asynchronously pushing extracted data on-the-fly into pipelined rank-aware query plans, and using ranking early-out requirements to limit extraction cost. To the best of our knowledge, both the technical problems and target applications of MashRank have not been addressed before.<\/jats:p>","DOI":"10.14778\/1920841.1920947","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"826-837","source":"Crossref","is-referenced-by-count":4,"title":["Building ranked mashups of unstructured sources with uncertain information"],"prefix":"10.14778","volume":"3","author":[{"given":"Mohamed A.","family":"Soliman","sequence":"first","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ihab F.","family":"Ilyas","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mina","family":"Saleeb","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Google mashup editor: http:\/\/code.google.com\/gme\/.  Google mashup editor: http:\/\/code.google.com\/gme\/."},{"key":"e_1_2_1_2_1","unstructured":"Microsoft Popfly: http:\/\/www.popfly.com\/.  Microsoft Popfly: http:\/\/www.popfly.com\/."},{"key":"e_1_2_1_3_1","unstructured":"Yahoo! Pipes: http:\/\/pipes.yahoo.com\/.  Yahoo! Pipes: http:\/\/pipes.yahoo.com\/."},{"key":"e_1_2_1_4_1","volume-title":"LWA 2005 - Workshopwoche der GI-Fachgruppen\/Arbeitskreise","author":"Anton T.","year":"2005","unstructured":"T. Anton . Xpath-wrapper induction by generalizing tree traversal patterns . LWA 2005 - Workshopwoche der GI-Fachgruppen\/Arbeitskreise , 2005 . T. Anton. Xpath-wrapper induction by generalizing tree traversal patterns. LWA 2005 - Workshopwoche der GI-Fachgruppen\/Arbeitskreise, 2005."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.36"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260848"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.75"},{"key":"e_1_2_1_8_1","volume-title":"VLDB","author":"Crescenzi V.","year":"2001","unstructured":"V. Crescenzi , G. Mecca , and P. Merialdo . RoadRunner: Towards automatic data extraction from large web sites . In VLDB , 2001 . V. Crescenzi, G. Mecca, and P. Merialdo. RoadRunner: Towards automatic data extraction from large web sites. In VLDB, 2001."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559882"},{"issue":"4","key":"e_1_2_1_10_1","volume":"14","author":"Deshpande A.","year":"2005","unstructured":"A. Deshpande , C. Guestrin , S. Madden , J. M. Hellerstein , and W. Hong . Model-based approximate querying in sensor networks. VLDB J. , 14 ( 4 ), 2005 . A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, and W. Hong. Model-based approximate querying in sensor networks. VLDB J., 14(4), 2005.","journal-title":"Model-based approximate querying in sensor networks. VLDB J."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376685"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0128-2"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_2_1_14_1","volume-title":"IJCAI (1)","author":"Kushmerick N.","year":"1997","unstructured":"N. Kushmerick , D. S. Weld , and R. B. Doorenbos . Wrapper induction for information extraction . In IJCAI (1) , 1997 . N. Kushmerick, D. S. Weld, and R. B. Doorenbos. Wrapper induction for information extraction. In IJCAI (1), 1997."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066173"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920923"},{"key":"e_1_2_1_17_1","volume-title":"VLDB","author":"Natsev A.","year":"2001","unstructured":"A. Natsev , Y. Chang , J. R. Smith , C. Li , and J. S. Vitter . Supporting incremental join queries on ranked inputs . In VLDB , 2001 . A. Natsev, Y. Chang, J. R. Smith, C. Li, and J. S. Vitter. Supporting incremental join queries on ranked inputs. In VLDB, 2001."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376924"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458502.1458505"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376734"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559999"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.102"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0176-8"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367935"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447757"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2008.4498380"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:37:07Z","timestamp":1672227427000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920947"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920947","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}