{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:54:56Z","timestamp":1725882896207},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557526"},{"type":"electronic","value":"9783319557533"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55753-3_24","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:38:10Z","timestamp":1490053090000},"page":"376-390","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Batch Grouping in Relational Datasets"],"prefix":"10.1007","author":[{"given":"Jizhou","family":"Sun","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"24_CR1","unstructured":"Agarwal, S., Agrawal, R., Deshpande, P. et al.: On the computation of multidimensional aggregates. In: Proceedings of 22th International Conference on Very Large Data Bases (1996)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Armstrong,W.W.: Dependency structures of data base relationships. In: IFIP Congress, pp. 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"issue":"1","key":"24_CR3","first-page":"85","volume":"7","author":"C Balkesen","year":"2013","unstructured":"Balkesen, C., Alonso, G., Teubner, J., et al.: Multi-core, main-memory joins: sort vs. hash revisited. PVLDB 7(1), 85\u201396 (2013)","journal-title":"PVLDB"},{"issue":"3","key":"24_CR4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00778-011-0251-9","volume":"21","author":"Y Cao","year":"2012","unstructured":"Cao, Y., Bramandia, R., Chan, C., et al.: Sort-sharing-aware query processing. VLDB J. 21(3), 411\u2013436 (2012)","journal-title":"VLDB J."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Chandramouli, B., Goldstein, J.: Patience is a virtue: revisiting merge and sort on modern processors. In: Proceedings of 33rd International Conference on Management of Data, Snowbird, USA, pp. 731\u2013742 (2014)","DOI":"10.1145\/2588555.2593662"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chaudhuri, S., Motwani, R. et al.: Towards estimation error guarantees for distinct values. In: Proceedings of 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, USA, pp. 268\u2013279 (2000)","DOI":"10.1145\/335168.335230"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Chen, S., Jiang, S., He, B. et al.: A study of sorting algorithms on approximate memory. In: Proceedings of 35th International Conference on Management of Data, SIGMOD 2016, San Francisco, USA, pp. 647\u2013662. ACM (2016)","DOI":"10.1145\/2882903.2882908"},{"issue":"4","key":"24_CR8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Comput. Surv. 24(4), 441\u2013476 (1992)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"24_CR9","first-page":"6","volume":"33","author":"W Fan","year":"2008","unstructured":"Fan, W., Geerts, F., Jia, X., et al.: Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst. 33(2), 6 (2008)","journal-title":"ACM Trans. Database Syst."},{"key":"24_CR10","unstructured":"Gibbons, P.B.: Distinct sampling for highly-accurate answers to distinct values queries and event reports. In: Proceedings of 27th International Conference on Very Large Data Bases, Roma, Italy, pp. 541\u2013550 (2001)"},{"issue":"3","key":"24_CR11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1132960.1132964","volume":"38","author":"G Graefe","year":"2006","unstructured":"Graefe, G.: Implementing sorting in database systems. ACM Comput. Surv. 38(3), 10 (2006)","journal-title":"ACM Comput. Surv."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Guravannavar, R., Sudarshan, S.: Reducing order enforcement cost in complex query plans. In: Proceedings of 23rd International Conference on Data Engineering, Istanbul, Turkey, pp. 856\u2013865 (2007)","DOI":"10.1109\/ICDE.2007.367931"},{"issue":"11","key":"24_CR13","first-page":"1274","volume":"8","author":"H Inoue","year":"2015","unstructured":"Inoue, H., Taura, K.: SIMD- and cache-friendly algorithm for sorting an array of structures. PVLDB 8(11), 1274\u20131285 (2015)","journal-title":"PVLDB"},{"volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art","year":"2010","key":"24_CR14","unstructured":"J\u00fcnger, M. (ed.): 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art. Springer, Heidelberg (2010)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: A combined framework for grouping and order optimization. In: Proceedings of 30th International Conference on Very Large Data Bases, Toronto, Canada, pp. 960\u2013971 (2004)","DOI":"10.1016\/B978-012088469-8.50084-X"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: An efficient framework for order optimization. In: Proceedings of 20th International Conference on Data Engineering, Boston, USA, pp. 461\u2013472 (2004)","DOI":"10.1109\/ICDE.2004.1320019"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Simmen, D.E., Shekita, E.J., Malkemus, T.: Fundamental techniques for order optimization. In: Proceedings of 15th International Conference on Management of Data, Montreal, Canada, pp. 57\u201367 (1996)","DOI":"10.1145\/233269.233320"},{"issue":"5","key":"24_CR18","first-page":"413","volume":"7","author":"S Viglas","year":"2014","unstructured":"Viglas, S.: Write-limited sorts and joins for persistent memory. PVLDB 7(5), 413\u2013424 (2014)","journal-title":"PVLDB"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Wang, X., Cherniack, M.: Avoiding sorting and grouping in processing queries. In: Proceedings of 29th International Conference on Very Large Data Bases, VLDB 2003, Berlin, Germany, pp. 826\u2013837. VLDB Endowment (2003)","DOI":"10.1016\/B978-012722442-8\/50078-1"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Xu, W., Feng, Z., Lo, E.: Fast multi-column sorting in main-memory column-stores. In: Proceedings of 35th International Conference on Management of Data, SIGMOD 2016, San Francisco, USA, pp. 1263\u20131278. ACM (2016)","DOI":"10.1145\/2882903.2915205"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55753-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T20:47:10Z","timestamp":1568926030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55753-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319557526","9783319557533"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55753-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}