{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:38:20Z","timestamp":1703187500376},"reference-count":20,"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            A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible execution flows of a BP, analysts are often interested in identifying flows that are \"most important\", according to some weight metric. This paper studies the following problem: given a specification of such a BP, a weighting function over BP execution flows, a query, and a number\n            <jats:italic>k<\/jats:italic>\n            , identify the\n            <jats:italic>k<\/jats:italic>\n            flows with the highest weight among those satisfying the query. We provide here, for the first time, a\n            <jats:italic>provably optimal<\/jats:italic>\n            algorithm for identifying the top-k weighted flows of a given BP, and use it for efficient top-k query evaluation.\n          <\/jats:p>","DOI":"10.14778\/1920841.1920960","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"940-951","source":"Crossref","is-referenced-by-count":8,"title":["Optimal top-k query evaluation for weighted business processes"],"prefix":"10.14778","volume":"3","author":[{"given":"Daniel","family":"Deutch","sequence":"first","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Tova","family":"Milo","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Neoklis","family":"Polyzotis","sequence":"additional","affiliation":[{"name":"UC Santa Cruz"}]},{"given":"Tom","family":"Yam","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_62"},{"key":"e_1_2_1_2_1","unstructured":"Active XML. http:\/\/activexml.net\/.  Active XML. http:\/\/activexml.net\/."},{"key":"e_1_2_1_3_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_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3830"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453898"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.199"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514923"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142364"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_17"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_2_1_13_1","volume-title":"Estimating Software Costs","author":"Jones T.","year":"2007","unstructured":"T. Jones . Estimating Software Costs . McGraw-Hill , 2007 . T. Jones. Estimating Software Costs. McGraw-Hill, 2007."},{"key":"e_1_2_1_14_1","volume-title":"Finite Markov Chains","author":"Kemeny J.","year":"1976","unstructured":"J. Kemeny and J. Snell . Finite Markov Chains . Springer , 1976 . J. Kemeny and J. Snell. Finite Markov Chains. Springer, 1976."},{"key":"e_1_2_1_15_1","volume-title":"Proc. of VLDB","author":"Kimelfeld B.","year":"2007","unstructured":"B. Kimelfeld and Y. Sagiv . Matching twigs in probabilistic xml . In Proc. of VLDB , 2007 . B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic xml. In Proc. of VLDB, 2007."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315572"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019288403823"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367905"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559954"},{"key":"e_1_2_1_20_1","unstructured":"Yahoo! shopping. http:\/\/shopping.yahoo.com\/.  Yahoo! shopping. http:\/\/shopping.yahoo.com\/."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:41:55Z","timestamp":1672227715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920960"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920960","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}