{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T16:50:01Z","timestamp":1675356601791},"reference-count":23,"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>\n            Mashups integrate a set of Web-services and data sources, often referred to as\n            <jats:italic>mashlets<\/jats:italic>\n            . We study in this paper a common scenario where these mashlets are components of larger Web-Applications. In this case, integration of mash-lets yields a set of inter-connected applications, referred to as\n            <jats:italic>Mashed-up Applications<\/jats:italic>\n            (abbr.\n            <jats:italic>MashAPP)<\/jats:italic>\n            . While interactions between the mashlets enrich the individual applications, they also render navigation within them more intricate for the user, as actions in one application may affect others. To assist users in their navigation through\n            <jats:italic>MashAPPs<\/jats:italic>\n            we provide a solution based on a simple, generic model for\n            <jats:italic>MashAPPs<\/jats:italic>\n            and navigation flows within them. Queries over the model allow users to describe navigation flows of interest, and an effective query evaluation algorithm provides users with recommendations on how to navigate within the\n            <jats:italic>MashAPP<\/jats:italic>\n            . The model and algorithms serve as a basis for the\n            <jats:italic>COMPASS<\/jats:italic>\n            system, built on top of the Mashup Server.\n          <\/jats:p>","DOI":"10.14778\/1920841.1920885","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"320-329","source":"Crossref","is-referenced-by-count":6,"title":["Navigating in complex mashed-up applications"],"prefix":"10.14778","volume":"3","author":[{"given":"Daniel","family":"Deutch","sequence":"first","affiliation":[{"name":"Tel-Aviv University"}]},{"given":"Ohad","family":"Greenshpan","sequence":"additional","affiliation":[{"name":"Tel-Aviv University &amp; IBM Research Labs"}]},{"given":"Tova","family":"Milo","sequence":"additional","affiliation":[{"name":"Tel-Aviv University"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Business Process Execution Language for Web Services. http:\/\/www.ibm.com\/developerworks\/library\/ws-bpel\/.  Business Process Execution Language for Web Services. http:\/\/www.ibm.com\/developerworks\/library\/ws-bpel\/."},{"key":"e_1_2_1_2_1","volume-title":"ICDE '10","author":"Deutch D."},{"key":"e_1_2_1_3_1","volume-title":"ICDE '09","author":"Deutch D."},{"key":"e_1_2_1_4_1","volume-title":"Goal Oriented Website Navigation for Online Shoppers. In VLDB '09","author":"Deutch D."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514924"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066219"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247626"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365697"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_2_1_10_1","volume-title":"NGITS '09","author":"Greenshpan O."},{"key":"e_1_2_1_11_1","volume-title":"VLDB '09","author":"Greenshpan O."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/637411.637428"},{"key":"e_1_2_1_13_1","volume-title":"McGraw-Hill","author":"Jones T. C.","year":"2007"},{"key":"e_1_2_1_14_1","volume-title":"VLDB '07","author":"Kimelfeld B."},{"issue":"4","key":"e_1_2_1_15_1","first-page":"531","article-title":"Emerging application development paradigm for a digital journal","volume":"13","author":"Kulathuramaiyer N.","year":"2007","journal-title":"J. UCS"},{"issue":"10","key":"e_1_2_1_16_1","first-page":"1675","article-title":"Toward a new paradigm: Mashup patterns in web 2.0","volume":"6","author":"Lee C.-J.","year":"2009","journal-title":"WSEAS Trans. Info. Sci. and App."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526893"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/128869"},{"key":"e_1_2_1_19_1","volume-title":"Proc. of IEEE, 77(4)","author":"Murata T.","year":"1989"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019288403823"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"E. Ruppert. Finding the k shortest paths in parallel. Algorithmica 28(2) 2000.  E. Ruppert. Finding the k shortest paths in parallel. Algorithmica 28(2) 2000.","DOI":"10.1007\/s004530010038"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240624.1240842"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242697"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:53:40Z","timestamp":1672228420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920885"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920885","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}