{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T06:26:08Z","timestamp":1688279168205},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p>\n            In content-based publish-subscribe (pub\/sub) systems, users express their interests as queries over a stream of publications. Scaling up content-based pub\/sub to very large numbers of subscriptions is challenging: users are interested in low\n            <jats:italic>latency<\/jats:italic>\n            , that is, getting subscription results fast, while the pub\/sub system provider is mostly interested in\n            <jats:italic>scaling<\/jats:italic>\n            , i.e., being able to serve large numbers of subscribers, with low\n            <jats:italic>computational resources utilization.<\/jats:italic>\n          <\/jats:p>\n          <jats:p>We present a novel approach for scalable content-based pub\/sub in the presence of constraints on the available CPU and network resources, implemented within our pub\/sub system Delta. We achieve scalability by off-loading some subscriptions from the pub\/sub server, and leveraging view-based query rewriting to feed these subscriptions from the data accumulated in others. Our main contribution is a novel algorithm for organizing views in a multi-level dissemination network, exploiting view-based rewriting and powerful linear programming capabilities to scale to many views, respect capacity constraints, and minimize latency. The efficiency and effectiveness of our algorithm are confirmed through extensive experiments and a large deployment in a WAN.<\/jats:p>","DOI":"10.14778\/2732240.2732241","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"217-228","source":"Crossref","is-referenced-by-count":7,"title":["Delta"],"prefix":"10.14778","volume":"7","author":[{"given":"Konstantinos","family":"Karanasos","sequence":"first","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asterios","family":"Katsifodimos","sequence":"additional","affiliation":[{"name":"Inria Saclay and Universit\u00e9 Paris-Sud Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioana","family":"Manolescu","sequence":"additional","affiliation":[{"name":"Inria Saclay and Universit\u00e9, Paris-Sud Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734340"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_130"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335432"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25956-5_13"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066179"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958947"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316743"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90079-O"},{"key":"e_1_2_1_10_1","volume-title":"Middleware","author":"Gupta A.","year":"2004","unstructured":"A. Gupta , O. Sahin , D. Agrawal , and A. Abbadi . Meghdoot: Content-based Publish\/Subscribe over P2P networks . In Middleware , 2004 . A. Gupta, O. Sahin, D. Agrawal, and A. Abbadi. Meghdoot: Content-based Publish\/Subscribe over P2P networks. In Middleware, 2004."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645502.656089"},{"key":"e_1_2_1_12_1","volume-title":"JCAI","author":"Hoffmann J.","year":"1999","unstructured":"J. Hoffmann and J. Koehler . A new method to index and query sets . In JCAI , 1999 . J. Hoffmann and J. Koehler. A new method to index and query sets. In JCAI, 1999."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247564"},{"key":"e_1_2_1_14_1","volume-title":"October","author":"Karanasos K.","year":"2013","unstructured":"K. Karanasos , A. Katsifodimos , and I. Manolescu . Delta: Scalable Data Dissemination under Capacity Constraints. Inria Research Report N\u00b08385 , October 2013 . K. Karanasos, A. Katsifodimos, and I. Manolescu. Delta: Scalable Data Dissemination under Capacity Constraints. Inria Research Report N\u00b08385, October 2013."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31753-8_32"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213900"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/070700620"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767915"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344416.2344419"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.131"},{"issue":"2","key":"e_1_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1007\/s007780100048","volume":"10","author":"Pottinger R.","year":"2001","unstructured":"R. Pottinger and A. Y. Halevy . MiniCon: A scalable algorithm for answering queries using views. VLDB J. , 10 ( 2-3 ), 2001 . R. Pottinger and A. Y. Halevy. MiniCon: A scalable algorithm for answering queries using views. VLDB J., 10(2-3), 2001.","journal-title":"VLDB J."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233361"},{"key":"e_1_2_1_23_1","volume-title":"VLDB","author":"Schmidt A.","year":"2002","unstructured":"A. Schmidt , F. Waas , M. L. Kersten , M. J. Carey , I. Manolescu , and R. Busse . XMark: A Benchmark for XML Data Management . In VLDB , 2002 . A. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, and R. Busse. XMark: A Benchmark for XML Data Management. In VLDB, 2002."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645475.654023"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497496"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/966618.966627"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007623"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646015"},{"key":"e_1_2_1_29_1","volume-title":"http:\/\/www.gurobi.com","author":"Optimizer Gurobi","year":"2013","unstructured":"Gurobi Optimizer . http:\/\/www.gurobi.com , 2013 . Gurobi Optimizer. http:\/\/www.gurobi.com, 2013."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732240.2732241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:46:14Z","timestamp":1672224374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732240.2732241"}},"subtitle":["scalable data dissemination under capacity constraints"],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.14778\/2732240.2732241"],"URL":"https:\/\/doi.org\/10.14778\/2732240.2732241","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}