{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:12:43Z","timestamp":1774926763914,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/infocom.2016.7524338","type":"proceedings-article","created":{"date-parts":[[2016,7,28]],"date-time":"2016-07-28T20:47:54Z","timestamp":1469738874000},"page":"1-9","source":"Crossref","is-referenced-by-count":20,"title":["GEM: An analytic geometrical approach to fast event matching for multi-dimensional content-based publish\/subscribe services"],"prefix":"10.1109","author":[{"given":"Wenhao","family":"Fan","sequence":"first","affiliation":[]},{"given":"Yuan'an","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bihua","family":"Tang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"H-tree: An efficient index structure for event matching in content-based publish\/subscribe systems","author":"qian","year":"2014","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989390"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2282159"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487617"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301326"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343622"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/857076.857078"},{"key":"ref17","author":"papadimitriou","year":"1998","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref18","year":"0","journal-title":"Object Copying"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45861-1_10"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213447"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.67"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807171"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.39"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848147"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921029"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2004.1297273"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.119"}],"event":{"name":"IEEE INFOCOM 2016 - IEEE Conference on Computer Communications","location":"San Francisco, CA, USA","start":{"date-parts":[[2016,4,10]]},"end":{"date-parts":[[2016,4,14]]}},"container-title":["IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7515093\/7524326\/07524338.pdf?arnumber=7524338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,9,29]],"date-time":"2016-09-29T23:47:48Z","timestamp":1475192868000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7524338\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/infocom.2016.7524338","relation":{},"subject":[],"published":{"date-parts":[[2016,4]]}}}