{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:34:23Z","timestamp":1774949663564,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"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":[[2016,6,14]]},"DOI":"10.1145\/2882903.2882940","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T19:01:52Z","timestamp":1466103712000},"page":"631-646","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":98,"title":["Quickr"],"prefix":"10.1145","author":[{"given":"Srikanth","family":"Kandula","sequence":"first","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Anil","family":"Shanbhag","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Aleksandar","family":"Vitorovic","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Matthaios","family":"Olma","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Robert","family":"Grandl","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Surajit","family":"Chaudhuri","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Bolin","family":"Ding","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"AMPLab BigData Benchmark. http:\/\/bit.ly\/1uyuBE8.  AMPLab BigData Benchmark. http:\/\/bit.ly\/1uyuBE8."},{"key":"e_1_3_2_1_2_1","unstructured":"Apache Tez. http:\/\/tez.apache.org\/.  Apache Tez. http:\/\/tez.apache.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Intel Big-Data-Benchmark. http:\/\/bit.ly\/1HlFRH0.  Intel Big-Data-Benchmark. http:\/\/bit.ly\/1HlFRH0."},{"key":"e_1_3_2_1_4_1","unstructured":"TPC-DS Benchmark. http:\/\/bit.ly\/1J6uDap.  TPC-DS Benchmark. http:\/\/bit.ly\/1J6uDap."},{"key":"e_1_3_2_1_5_1","unstructured":"TPC-H Benchmark. http:\/\/bit.ly\/1KRK5gl.  TPC-H Benchmark. http:\/\/bit.ly\/1KRK5gl."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304581"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335450"},{"key":"e_1_3_2_1_8_1","volume-title":"NSDI","author":"Agarwal S.","year":"2012","unstructured":"S. Agarwal Re-optimizing data parallel computing . In NSDI , 2012 . S. Agarwal et al. Re-optimizing data parallel computing. In NSDI, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593667"},{"key":"e_1_3_2_1_11_1","volume-title":"OSDI","author":"Ananthanarayanan G.","year":"2010","unstructured":"G. Ananthanarayanan Reining in the Outliers in MapReduce Clusters Using Mantri . In OSDI , 2010 . G. Ananthanarayanan et al. Reining in the Outliers in MapReduce Clusters Using Mantri. In OSDI, 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742797"},{"key":"e_1_3_2_1_13_1","volume-title":"Models and issues in data stream systems. Technical report","author":"Babcock B.","year":"2002","unstructured":"B. Babcock Models and issues in data stream systems. Technical report , 2002 . B. Babcock et al. Models and issues in data stream systems. Technical report, 2002."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872822"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247504"},{"key":"e_1_3_2_1_16_1","unstructured":"J. Brutlag. Speed matters for Google web search. http:\/\/bit.ly\/1b4RKoZ 2009.  J. Brutlag. Speed matters for Google web search. http:\/\/bit.ly\/1b4RKoZ 2009."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454166"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656545"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375694"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304206"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276343"},{"key":"e_1_3_2_1_22_1","volume-title":"NSDI","author":"Condie T.","year":"2010","unstructured":"T. Condie Mapreduce online . In NSDI , 2010 . T. Condie et al. Mapreduce online. In NSDI, 2010."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000004"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/634067.634255"},{"key":"e_1_3_2_1_25_1","volume-title":"RANDOM","author":"B.-Y.","year":"2002","unstructured":"B.-Y. et. al. Counting distinct elements in a data stream . In RANDOM , 2002 . B.-Y. et. al. Counting distinct elements in a data stream. In RANDOM, 2002."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168847"},{"key":"e_1_3_2_1_27_1","volume-title":"IEEE Data Eng. Bull.","author":"Graefe G.","year":"1995","unstructured":"G. Graefe . The cascades framework for query optimization . IEEE Data Eng. Bull. , 1995 . G. Graefe. The cascades framework for query optimization. IEEE Data Eng. Bull., 1995."},{"key":"e_1_3_2_1_28_1","volume-title":"Answering queries using views: A survey","author":"Halevy A.","year":"2001","unstructured":"A. Halevy . Answering queries using views: A survey . 2001 . A. Halevy. Answering queries using views: A survey. 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253291"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247560"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066159"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287400"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920886"},{"key":"e_1_3_2_1_34_1","volume-title":"Query processing, resource management, and approximation ina data stream management system. Technical report","author":"Motwani R.","year":"2003","unstructured":"R. Motwani Query processing, resource management, and approximation ina data stream management system. Technical report , 2003 . R. Motwani et al. Query processing, resource management, and approximation ina data stream management system. Technical report, 2003."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556563"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402748"},{"key":"e_1_3_2_1_39_1","volume-title":"CIDR","author":"Sidirourgos L.","year":"2011","unstructured":"L. Sidirourgos : Scientific data management with bounds on runtime and quality . In CIDR , 2011 . L. Sidirourgos et al. Sciborq: Scientific data management with bounds on runtime and quality. In CIDR, 2011."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807140"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733022"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2735381"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588579"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2016 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2882940","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882903.2882940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:28Z","timestamp":1750273468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2882940"}},"subtitle":["Lazily Approximating Complex AdHoc Queries in BigData Clusters"],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":43,"alternative-id":["10.1145\/2882903.2882940","10.1145\/2882903"],"URL":"https:\/\/doi.org\/10.1145\/2882903.2882940","relation":{},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}