{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:31Z","timestamp":1740109291718,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T00:00:00Z","timestamp":1511222400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China (CN)","award":["61632010","61402130, 61602129, 61502121"],"award-info":[{"award-number":["61632010","61402130, 61602129, 61502121"]}]},{"name":"Shandong Province Science and Technology major projects","award":["2015ZDXX0210B02"],"award-info":[{"award-number":["2015ZDXX0210B02"]}]},{"DOI":"10.13039\/501100012166","name":"National key research and development program","doi-asserted-by":"crossref","award":["2016YFB1000703"],"award-info":[{"award-number":["2016YFB1000703"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10115-017-1136-z","type":"journal-article","created":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T04:55:13Z","timestamp":1511240113000},"page":"437-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficiently processing deterministic approximate aggregation query on massive data"],"prefix":"10.1007","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5477-9249","authenticated-orcid":false,"given":"Xixian","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bailing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Acharya S, Gibbons P, Poosala V (2000) Congressional samples for approximate answering of group-by queries. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, pp 487\u2013498","key":"1136_CR1","DOI":"10.1145\/342009.335450"},{"doi-asserted-by":"crossref","unstructured":"Agarwal S, Milner H, Kleiner A et al (2014) Knowing when you\u2019re wrong: building fast and reliable approximate query processing systems. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 481\u2013492","key":"1136_CR2","DOI":"10.1145\/2588555.2593667"},{"doi-asserted-by":"crossref","unstructured":"Agarwal S, Mozafari B, Panda A et al (2013) Blinkdb: queries with bounded errors and bounded response times on very large data. In: Proceedings of the 8th ACM European conference on computer systems, pp 29\u201342","key":"1136_CR3","DOI":"10.1145\/2465351.2465355"},{"unstructured":"Ahn H, Mamoulis N, Wong H (2001) A survey on multidimensional access methods. Technical report, University of Science and Technology, Clearwater Bay, Hong Kong","key":"1136_CR4"},{"issue":"2\u20133","key":"1136_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s007780100049","volume":"10","author":"K Chakrabarti","year":"2001","unstructured":"Chakrabarti K, Garofalakis M, Rastogi R, Shim K (2001) Approximate query processing using wavelets. VLDB J 10(2\u20133):199\u2013223","journal-title":"VLDB J"},{"issue":"1\u20133","key":"1136_CR6","first-page":"1","volume":"4","author":"G Cormode","year":"2012","unstructured":"Cormode G, Garofalakis M, Haas P, Jermaine C (2012) Synopses for massive data: samples, histograms, wavelets, sketches. Found Trends Databases 4(1\u20133):1\u2013294","journal-title":"Found Trends Databases"},{"doi-asserted-by":"crossref","unstructured":"Ding B, Huang S, Chaudhuri S et al (2016) Sample + seek: approximating aggregates with distribution precision guarantee. In: Proceedings of the 2016 ACM SIGMOD international conference on management of data, pp 679\u2013694","key":"1136_CR7","DOI":"10.1145\/2882903.2915249"},{"unstructured":"Dong X, Han J, Cheng H, Li X (2006) Answering top- $$k$$ k queries with multi-dimensional selections: the ranking cube approach. In: Proceedings of the 32nd international conference on very large data bases, pp 463\u2013474","key":"1136_CR8"},{"key":"1136_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01889-3","volume-title":"Deep web query interface understanding and integration","author":"E Dragut","year":"2012","unstructured":"Dragut E, Meng W, Yu C (2012) Deep web query interface understanding and integration. Morgan & Claypool, San Rafael (Synthesis lectures on data management)"},{"issue":"2","key":"1136_CR10","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, G\u00fcnther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170\u2013231","journal-title":"ACM Comput Surv"},{"unstructured":"Ganti V, Lee M, Ramakrishnan R (2000) ICICLES: self-tuning samples for approximate query answering. In: Proceedings of 26th international conference on very large data bases, pp 176\u2013187","key":"1136_CR11"},{"unstructured":"Garofalakis M, Gibbons P (2001) Approximate query processing: taming the terabytes. In: Proceedings of 27th international conference on very large data bases, p 725","key":"1136_CR12"},{"issue":"1","key":"1136_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1009726021843","volume":"1","author":"J Gray","year":"1997","unstructured":"Gray J, Chaudhuri S, Bosworth A et al (1997) Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Min Knowl Discov 1(1):29\u201353","journal-title":"Data Min Knowl Discov"},{"unstructured":"Gupta A, Harinarayan V, Quass D (1995) Aggregate-query processing in data warehousing environments. In: Proceedings of the 21th international conference on very large data bases, pp 358\u2013369","key":"1136_CR14"},{"doi-asserted-by":"crossref","unstructured":"Haas P, Hellerstein J (1999) Ripple joins for online aggregation. In: Proceedings of the 1999 ACM SIGMOD international conference on management of data, pp 287\u2013298","key":"1136_CR15","DOI":"10.1145\/304182.304208"},{"key":"1136_CR16","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ins.2014.03.091","volume":"278","author":"X Han","year":"2014","unstructured":"Han X, Li J, Gao H (2014) Efficiently processing (p, $$\\epsilon $$ \u03f5 )-approximate join aggregation on massive data. Inf Sci 278:773\u2013792","journal-title":"Inf Sci"},{"doi-asserted-by":"crossref","unstructured":"Harinarayan V, Rajaraman A, Ullman J (1996) Implementing data cubes efficiently. In: Proceedings of the 1996 ACM SIGMOD international conference on management of data, pp 205\u2013216","key":"1136_CR17","DOI":"10.1145\/233269.233333"},{"doi-asserted-by":"crossref","unstructured":"Hellerstein J, Haas P, Wang H (1997) Online aggregation. In: Proceedings of the 1997 ACM SIGMOD international conference on management of data, pp 171\u2013182","key":"1136_CR18","DOI":"10.1145\/253260.253291"},{"issue":"4","key":"1136_CR19","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/1412331.1412335","volume":"33","author":"C Jermaine","year":"2008","unstructured":"Jermaine C, Arumugam S, Pol A, Dobra A (2008) Scalable approximate query processing with the DBO engine. ACM Trans Database Syst 33(4):23:1\u201323:54","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"1136_CR20","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1145\/319732.319745","volume":"7","author":"W Kim","year":"1982","unstructured":"Kim W (1982) On optimizing an SQL-like nested query. ACM Trans Database Syst 7(3):443\u2013469","journal-title":"ACM Trans Database Syst"},{"doi-asserted-by":"crossref","unstructured":"Lazaridis I, Mehrotra S (2001) Progressive approximate aggregate queries with a multi-resolution tree structure. In: Proceedings of the 2001 ACM SIGMOD international conference on management of data, pp 401\u2013412","key":"1136_CR21","DOI":"10.1145\/375663.375718"},{"doi-asserted-by":"crossref","unstructured":"Li F, Wu B, Yi K, Zhao Z (2016) Wander join: online aggregation for joins. In: Proceedings of the 2016 ACM SIGMOD international conference on management of data, pp 2121\u20132124","key":"1136_CR22","DOI":"10.1145\/2882903.2899413"},{"doi-asserted-by":"crossref","unstructured":"Miller R (1968) Response time in man-computer conversational transactions. In: Proceedings of the fall joint computer conference, part I, pp 267\u2013277","key":"1136_CR23","DOI":"10.1145\/1476589.1476628"},{"doi-asserted-by":"crossref","unstructured":"Mozafari B, Goh E, Yoon D (2015) Cliffguard: a principled framework for finding robust database designs. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 1167\u20131182","key":"1136_CR24","DOI":"10.1145\/2723372.2749454"},{"issue":"3","key":"1136_CR25","first-page":"3","volume":"38","author":"B Mozafari","year":"2015","unstructured":"Mozafari B, Niu N (2015) A handbook for building an approximate query engine. IEEE Data Eng Bull 38(3):3\u201329","journal-title":"IEEE Data Eng Bull"},{"doi-asserted-by":"crossref","unstructured":"O\u2019Neil P, Quass D (1997) Improved query performance with variant indexes. In: Proceedings of the 1997 ACM SIGMOD international conference on management of data, pp 38\u201349","key":"1136_CR26","DOI":"10.1145\/253260.253268"},{"issue":"11","key":"1136_CR27","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.14778\/3402707.3402748","volume":"4","author":"N Pansare","year":"2011","unstructured":"Pansare N, Borkar V, Jermaine C, Condie T (2011) Online aggregation for large mapreduce jobs. Proc VLDB Endow 4(11):1135\u20131145","journal-title":"Proc VLDB Endow"},{"issue":"4","key":"1136_CR28","first-page":"5","volume":"22","author":"V Poosala","year":"1999","unstructured":"Poosala V, Ganti V, Ioannidis Y (1999) Approximate query answering using histograms. IEEE Data Eng Bull 22(4):5\u201314","journal-title":"IEEE Data Eng Bull"},{"issue":"9","key":"1136_CR29","doi-asserted-by":"crossref","first-page":"898","DOI":"10.14778\/2777598.2777599","volume":"8","author":"N Potti","year":"2015","unstructured":"Potti N, Patel J (2015) Daq: a new paradigm for approximate query processing. Proc VLDB Endow 8(9):898\u2013909","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"crossref","unstructured":"R\u00f6sch P, Lehner W (2009) Sample synopses for approximate answering of group-by queries. In: Proceedings of the 12th international conference on extending database technology: advances in database technology, pp 403\u2013414","key":"1136_CR30","DOI":"10.1145\/1516360.1516408"},{"issue":"3","key":"1136_CR31","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01840449","volume":"1","author":"H Wong","year":"1986","unstructured":"Wong H, Li J, Olken F et al (1986) Bit transposition for very large scientific and statistical databases. Algorithmica 1(3):289\u2013309","journal-title":"Algorithmica"},{"issue":"1","key":"1136_CR32","doi-asserted-by":"crossref","first-page":"443","DOI":"10.14778\/1687627.1687678","volume":"2","author":"S Wu","year":"2009","unstructured":"Wu S, Jiang S, Ooi B, Tan K (2009) Distributed online aggregation. Proc VLDB Endow 2(1):443\u2013454","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"crossref","unstructured":"Zeng K, Gao S, Mozafari B, Zaniolo C (2014) The analytical bootstrap: a new method for fast error estimation in approximate query processing. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 277\u2013288","key":"1136_CR33","DOI":"10.1145\/2588555.2588579"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1136-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1136-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1136-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,7]],"date-time":"2022-08-07T19:09:22Z","timestamp":1659899362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1136-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,21]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1136"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1136-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,11,21]]}}}