{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:04Z","timestamp":1725564604939},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157653"},{"type":"electronic","value":"9783642157660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15766-0_100","type":"book-chapter","created":{"date-parts":[[2010,9,2]],"date-time":"2010-09-02T16:41:05Z","timestamp":1283445665000},"page":"584-589","source":"Crossref","is-referenced-by-count":1,"title":["Distribution of Continuous Queries over Data Aggregators in Dynamic Data Dissemination Networks"],"prefix":"10.1007","author":[{"given":"Mahesh","family":"Gadiraju","sequence":"first","affiliation":[]},{"given":"V.","family":"Valli Kumari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"100_CR1","doi-asserted-by":"crossref","unstructured":"Gupta, R., Ramamritham, K.: Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks. In: WWW 2007, Banff, Alberta, Canada, May 8-12 (2007)","DOI":"10.1145\/1242572.1242616"},{"key":"100_CR2","doi-asserted-by":"crossref","unstructured":"Hassin, R., Levin, A.: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM Journal on Computing\u00a035(1) (2005)","DOI":"10.1137\/S0097539704444750"},{"key":"100_CR3","doi-asserted-by":"crossref","unstructured":"Shah, S., Ramamritham, K., Shenoy, P.: Resilient and Coherence preserving Dissemination of Dynamic Data using Cooperating Peers. IEEE Transactions on Knowledge and Data Engineering\u00a016(7) (July 2004)","DOI":"10.1109\/TKDE.2004.1318563"},{"key":"100_CR4","doi-asserted-by":"crossref","unstructured":"Vander Meer, D., Datta, A., Dutta, K., Thomas, H., Ramamritham, K.: Proxy-Based Acceleration of Dynamically Generated Content on the World Wide Web. ACM Transactions on Database Systems (TODS)\u00a029 (June 2004)","DOI":"10.1145\/1005566.1005571"},{"key":"100_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-11659-9_2","volume-title":"Distributed Computing and Internet Technology","author":"K. Ramamritham","year":"2010","unstructured":"Ramamritham, K.: Maintaining Coherent Views over Dynamic Distributed Data. In: Janowski, T., Mohanty, H. (eds.) Distributed Computing and Internet Technology. LNCS, vol.\u00a05966, pp. 13\u201320. Springer, Heidelberg (2010)"},{"key":"100_CR6","doi-asserted-by":"crossref","unstructured":"Shah, S., Ramamritham, K.: Handling Non-Linear Polynimial Queries over Dynamic Data. In: Proc. of IEEE International Conference on Data Engineering (April 2008)","DOI":"10.1109\/ICDE.2008.4497513"}],"container-title":["Communications in Computer and Information Science","Information and Communication Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15766-0_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:39:55Z","timestamp":1606167595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15766-0_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157653","9783642157660"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15766-0_100","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}