{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:37Z","timestamp":1725566677963},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285830"},{"type":"electronic","value":"9783540319689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547273_12","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T01:52:49Z","timestamp":1285638769000},"page":"162-176","source":"Crossref","is-referenced-by-count":9,"title":["Main Memory Implementations for Binary Grouping"],"prefix":"10.1007","author":[{"given":"Norman","family":"May","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/319983.319987","volume":"8","author":"D. Bitton","year":"1983","unstructured":"Bitton, D., DeWitt, D.J.: Duplicate record elimination in large data files. ACM TODS\u00a08(2), 255\u2013265 (1983)","journal-title":"ACM TODS"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Chatziantoniou, D., Akinde, M., Johnson, T., Kim, S.: The MD-Join: An Operator for Complex OLAP. In: Proc. ICDE, pp. 524\u2013533 (2001)","DOI":"10.1109\/ICDE.2001.914866"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cluet, S., Moerkotte, G.: Efficient evaluation of aggregates on bulk types. In: Proc. of 5-th DBPL (1995)","DOI":"10.14236\/ewic\/DBPL1995.6"},{"key":"12_CR4","unstructured":"Cluet, S., Moerkotte, G.: Nested queries in object bases. Technical Report RWTH-95-06, GemoReport64, RWTH Aachen\/INRIA (1995)"},{"key":"12_CR5","volume-title":"Introduction to Algorithms","author":"T. Corman","year":"2001","unstructured":"Corman, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-46439-5_34","volume-title":"Advances in Database Technology - EDBT 2000","author":"J. Bercken Van den","year":"2000","unstructured":"Van den Bercken, J., Schneider, M., Seeger, B.: Plug&join: An easy-to-use generic algorithm for efficiently processing equi and non-equi joins. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 495\u2013509. Springer, Heidelberg (2000)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"DeWitt, D.J., Katz, R., Olken, F., Shapiro, L., Stonebraker, M., Wood, D.: Implementation techniques for main memory database systems. In: Proc. of the ACM SIGMOD, pp. 1\u20138 (June 1984)","DOI":"10.1145\/602259.602261"},{"key":"12_CR8","unstructured":"DeWitt, D.J., Naughton, J.F., Schneider, D.A.: An evaluation of non-equijoin algorithms. In: Proc. VLDB, pp. 443\u2013452 (1991)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G. Graefe","year":"1993","unstructured":"Graefe, G.: Query evaluation techniques for large databases. ACM Computing Surveys\u00a025(2), 73\u2013170 (1993)","journal-title":"ACM Computing Surveys"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Graefe, G.: Sort-merge-join: An idea whose time has(h) passed? In: Proc. ICDE, pp. 406\u2013417 (1994)","DOI":"10.1109\/ICDE.1994.283062"},{"key":"12_CR11","unstructured":"Graefe, G.: Executing nested queries. In: BTW, pp. 58\u201377 (2003)"},{"key":"12_CR12","unstructured":"Graefe, G., Bunker, R., Cooper, S.: Hash joins and hash teams in Microsoft SQL server. In: Proc. VLDB, pp. 86\u201397 (1998)"},{"issue":"6","key":"12_CR13","first-page":"934","volume":"6","author":"G. Graefe","year":"1994","unstructured":"Graefe, G., Linville, A., Shapiro, L.D.: Sort vs. hash revisited. hash revisited. IEEE TKDE\u00a06(6), 934\u2013944 (1994)","journal-title":"hash revisited. IEEE TKDE"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s007780050043","volume":"6","author":"L.M. Haas","year":"1997","unstructured":"Haas, L.M., Carey, M.J., Livny, M., Shukla, A.: Seeking the truth about ad hoc join costs. VLDB Journal\u00a06(3), 241\u2013256 (1997)","journal-title":"VLDB Journal"},{"key":"12_CR15","unstructured":"Helmer, S., Neumann, T., Moerkotte, G.: Early grouping gets the skew. Technical Report TR-02-009, University of Mannheim (2002)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. Proc. 18th ISCIS, pp. 218\u2013225 (2003)","DOI":"10.1007\/978-3-540-39737-3_28"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"May, N., Helmer, S., Moerkotte, G.: Nested queries and quantifiers in an ordered context. In: Proc. ICDE, pp. 239\u2013250 (2004)","DOI":"10.1109\/ICDE.2004.1320001"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"May, N., Helmer, S., Moerkotte, G.: Main memory implementations for binary grouping. Technical report, University of Mannheim (2005), Available at http:\/\/pi3.informatik.uni-mannheim.de\/publikationen.html","DOI":"10.1007\/11547273_12"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/235968.233320","volume":"25","author":"D.E. Simmen","year":"1996","unstructured":"Simmen, D.E., Shekita, E.J., Malkemus, T.: Fundamental techniques for order optimization. SIGMOD Record\u00a025(2), 57\u201367 (1996)","journal-title":"SIGMOD Record"},{"key":"12_CR20","unstructured":"Steenhagen, H.J., Apers, P.M.G., Blanken, H.M., de By, R.A.: From nestedloop to join queries in OODB. In: Proc. VLDB, pp. 618\u2013629 (1994)"},{"key":"12_CR21","unstructured":"Westmann, T., Moerkotte, G.: Variations on grouping and aggregation. Technical report, University of Mannheim (1999)"}],"container-title":["Lecture Notes in Computer Science","Database and XML Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547273_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:57:47Z","timestamp":1619506667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547273_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285830","9783540319689"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11547273_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}