{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:05Z","timestamp":1750307045983,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T00:00:00Z","timestamp":1337558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,21]]},"DOI":"10.1145\/2213556.2213595","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"283-294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Rectangle-efficient aggregation in spatial data streams"],"prefix":"10.1145","author":[{"given":"Srikanta","family":"Tirthapura","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}]},{"given":"David","family":"Woodruff","sequence":"additional","affiliation":[{"name":"IBM Research-Almaden, San Jose, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/www.opengeospatial.org\/.  http:\/\/www.opengeospatial.org\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.82"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545464"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303987"},{"key":"e_1_3_2_1_7_1","volume-title":"Computer Science Department","author":"Bentley J.L.","year":"1978","unstructured":"J.L. Bentley . Algorithms for Klee's rectangle problem. Unpublished notes , Computer Science Department , Carnegie Mellon University , 1978 . J.L. Bentley. Algorithms for Klee's rectangle problem. Unpublished notes, Computer Science Department, Carnegie Mellon University, 1978."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109634"},{"key":"e_1_3_2_1_9_1","volume-title":"Recursive sketching for frequency moments. CoRR, abs\/1011.2571","author":"Braverman Vladimir","year":"2010","unstructured":"Vladimir Braverman and Rafail Ostrovsky . Recursive sketching for frequency moments. CoRR, abs\/1011.2571 , 2010 . Vladimir Braverman and Rafail Ostrovsky. Recursive sketching for frequency moments. CoRR, abs\/1011.2571, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806729"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645339.650141"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070550"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377676.1377693"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873616"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_1_16_1","first-page":"27","volume-title":"CCCG","author":"Eric","year":"2005","unstructured":"Eric Y. Chen and Timothy M. Chan. Space-efficient algorithms for Klee's measure problem . In CCCG , pages 27 -- 30 , 2005 . Eric Y. Chen and Timothy M. Chan. Space-efficient algorithms for Klee's measure problem. In CCCG, pages 27--30, 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647008.712501"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978068"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007646"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00079-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359553"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220065"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645927.672174"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198389"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22670-0_24"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/615204.615206"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.38"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007413"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147955"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060621"},{"key":"e_1_3_2_1_33_1","first-page":"284","volume-title":"Can the measure of {{ai","author":"Klee V.","year":"1977","unstructured":"V. Klee . Can the measure of {{ai ; bi} be computed in less than O(n log n) steps? In American Mathematical Monthly , volume 84 , pages 284 -- 285 , 1977 . V. Klee. Can the measure of {{ai; bi} be computed in less than O(n log n) steps? In American Mathematical Monthly, volume 84, pages 284--285, 1977."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04031-7"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375718"},{"key":"e_1_3_2_1_36_1","volume-title":"Counting solutions of polynomial equations","author":"Levchenko K.","year":"2005","unstructured":"K. Levchenko and Y.-K Liu . Counting solutions of polynomial equations , 2005 . Manuscript . K. Levchenko and Y.-K Liu. Counting solutions of polynomial equations, 2005. Manuscript."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031525"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83539-1_1"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220065"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090271"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/647227.719095"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643672"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142496"},{"key":"e_1_3_2_1_45_1","volume-title":"A streaming approximation algorithm for Klee's measure problem. CoRR, abs\/1004.1569","author":"Sharma Gokarna","year":"2010","unstructured":"Gokarna Sharma , Costas Busch , and Srikanta Tirthapura . A streaming approximation algorithm for Klee's measure problem. CoRR, abs\/1004.1569 , 2010 . Gokarna Sharma, Costas Busch, and Srikanta Tirthapura. A streaming approximation algorithm for Klee's measure problem. CoRR, abs\/1004.1569, 2010."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989297"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.031"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.93"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564741"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.12.004"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366109"}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Scottsdale Arizona USA","acronym":"SIGMOD\/PODS '12"},"container-title":["Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213556.2213595","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213556.2213595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:00Z","timestamp":1750238460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213556.2213595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,21]]},"references-count":51,"alternative-id":["10.1145\/2213556.2213595","10.1145\/2213556"],"URL":"https:\/\/doi.org\/10.1145\/2213556.2213595","relation":{},"subject":[],"published":{"date-parts":[[2012,5,21]]},"assertion":[{"value":"2012-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}