{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:21:03Z","timestamp":1729668063921,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/iscc.2013.6755014","type":"proceedings-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T17:14:57Z","timestamp":1394212497000},"page":"000606-000611","source":"Crossref","is-referenced-by-count":0,"title":["PUBSUB: An efficient publish\/subscribe system"],"prefix":"10.1109","author":[{"given":"Tania Banerjee","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.127"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"15","article-title":"S-ToPSS: Semantic toronto publish\/subscribe system","author":"petrovic","year":"2003","journal-title":"VLDB"},{"key":"16","article-title":"Generating wide-area content-based publish\/subscribe workloads","author":"yu","year":"2009","journal-title":"NetDB"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061984"},{"key":"14","article-title":"Efficient event routing in content-based publish-subscribe service networks","author":"cao","year":"2004","journal-title":"INFOCOM"},{"journal-title":"Handbook of Data Structures and Applications","year":"2005","author":"mehta","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2003.1213447"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2011.12"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90117-0"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/380749.380767"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989390"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/331983.331992"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301326"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/0214021"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/176567.176573"},{"key":"4","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1109\/TC.2004.81","article-title":"Dynamic router-tables for prefixes and ranges","volume":"53","author":"lu","year":"2004","journal-title":"JEEE Transactions of Computers"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687633"},{"key":"8","article-title":"Filtering algorithms and implementation for fast pub\/sub systems","author":"fabret","year":"2001","journal-title":"SJGMOD"}],"event":{"name":"2013 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2013,7,7]]},"location":"Split, Croatia","end":{"date-parts":[[2013,7,10]]}},"container-title":["2013 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6746555\/6754912\/06755014.pdf?arnumber=6755014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T05:15:23Z","timestamp":1498108523000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6755014\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/iscc.2013.6755014","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}