{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T09:11:41Z","timestamp":1712567501861},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,30]],"date-time":"2011-06-30T00:00:00Z","timestamp":1309392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Sci Res Dev"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00450-011-0186-9","type":"journal-article","created":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T18:58:51Z","timestamp":1309373931000},"page":"3-27","source":"Crossref","is-referenced-by-count":13,"title":["New algorithms for join and grouping operations"],"prefix":"10.1007","volume":"27","author":[{"given":"Goetz","family":"Graefe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,30]]},"reference":[{"issue":"4","key":"186_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s007780050026","volume":"5","author":"G Antoshenkov","year":"1996","unstructured":"Antoshenkov G, Ziauddin M (1996) Query processing and optimization in Oracle Rdb. VLDB J 5(4):229\u2013237","journal-title":"VLDB J"},{"key":"186_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/342009.335420","volume-title":"SIGMOD","author":"R Avnur","year":"2000","unstructured":"Avnur R, Hellerstein JM (2000) Eddies: continuously adaptive query processing. In: SIGMOD, pp\u00a0261\u2013272"},{"issue":"2","key":"186_CR3","first-page":"3","volume":"20","author":"C Ballinger","year":"1997","unstructured":"Ballinger C, Fryer R (1997) Born to be parallel: why parallel origins give Teradata an enduring performance edge. IEEE Data Eng Bull 20(2):3\u201312","journal-title":"IEEE Data Eng Bull"},{"issue":"1","key":"186_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/320521.320530","volume":"2","author":"R Bayer","year":"1977","unstructured":"Bayer R, Unterauer K (1977) Prefix B-Trees. ACM Trans Database Syst 2(1):11\u201326","journal-title":"ACM Trans Database Syst"},{"issue":"2","key":"186_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/319983.319987","volume":"8","author":"D Bitton","year":"1983","unstructured":"Bitton D, DeWitt DJ (1983) Duplicate record elimination in large data files. ACM Trans Database Syst 8(2):255\u2013265","journal-title":"ACM Trans Database Syst"},{"key":"186_CR6","first-page":"757","volume-title":"VLDB","author":"P Bizarro","year":"2005","unstructured":"Bizarro P, Babu S, DeWitt DJ, Widom J (2005) Content-based routing: different plans for different data. In: VLDB, pp\u00a0757\u2013768"},{"key":"186_CR7","first-page":"323","volume-title":"VLDB","author":"K Bratbergsengen","year":"1984","unstructured":"Bratbergsengen K (1984) Hashing methods and relational algebra operations. In: VLDB, pp\u00a0323\u2013333"},{"key":"186_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/253260.253302","volume-title":"SIGMOD","author":"MJ Carey","year":"1997","unstructured":"Carey MJ, Kossmann D (1997) On saying \u201cenough already!\u201d in SQL. In: SIGMOD, pp\u00a0219\u2013230"},{"issue":"3","key":"186_CR9","first-page":"12","volume":"20","author":"MJ Carey","year":"1997","unstructured":"Carey MJ, Kossmann D (1997) Processing top n and bottom n queries. IEEE Data Eng Bull 20(3):12\u201319","journal-title":"IEEE Data Eng Bull"},{"key":"186_CR10","first-page":"203","volume-title":"VLDB","author":"S Chandrasekaran","year":"2002","unstructured":"Chandrasekaran S, Franklin MJ (2002) Streaming queries over streaming data. In: VLDB, pp\u00a0203\u2013214"},{"key":"186_CR11","first-page":"354","volume-title":"VLDB","author":"S Chaudhuri","year":"1994","unstructured":"Chaudhuri S, Shim K (1994) Including group-by in query optimization. In: VLDB, pp\u00a0354\u2013366"},{"key":"186_CR12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/191839.191872","volume-title":"SIGMOD","author":"RL Cole","year":"1994","unstructured":"Cole RL, Graefe G (1994) Optimization of dynamic query evaluation plans. In: SIGMOD, pp\u00a0150\u2013160"},{"key":"186_CR13","first-page":"137","volume-title":"OSDI","author":"J Dean","year":"2004","unstructured":"Dean J, Ghemawat S (2004) MapReduce\u2014simplified data processing on large clusters. In: OSDI, pp\u00a0137\u2013150"},{"key":"186_CR14","first-page":"151","volume-title":"VLDB","author":"DJ DeWitt","year":"1985","unstructured":"DeWitt DJ, Gerber RH (1985) Multiprocessor hash-based join algorithms. In: VLDB, pp\u00a0151\u2013164"},{"key":"186_CR15","first-page":"1","volume-title":"SIGMOD","author":"DJ DeWitt","year":"1984","unstructured":"DeWitt DJ, Katz RH, Olken F, Shapiro LD, Stonebraker M, Wood DA (1984) Implementation techniques for main memory database systems. In: SIGMOD, pp\u00a01\u20138"},{"key":"186_CR16","first-page":"228","volume-title":"VLDB","author":"DJ DeWitt","year":"1986","unstructured":"DeWitt DJ, Gerber RH, Graefe G, Heytens ML, Kumar KB, Muralikrishna M (1986) GAMMA\u2014a high performance dataflow database machine. In: VLDB, pp\u00a0228\u2013237"},{"key":"186_CR17","first-page":"230","volume-title":"PDIS","author":"DJ DeWitt","year":"1993","unstructured":"DeWitt DJ, Naughton JF, Burger J (1993) Nested loops revisited. In: PDIS, pp\u00a0230\u2013242"},{"key":"186_CR18","first-page":"299","volume-title":"VLDB","author":"J-P Dittrich","year":"2002","unstructured":"Dittrich J-P, Seeger B, Taylor DS, Widmayer P (2002) Progressive merge join: a generic and non-blocking sort-based join algorithm. In: VLDB, pp\u00a0299\u2013310"},{"issue":"1","key":"186_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62032.62033","volume":"14","author":"JC Freytag","year":"1989","unstructured":"Freytag JC, Goodman N (1989) On the translation of relational queries into iterative programs. ACM Trans Database Syst 14(1):1\u201327","journal-title":"ACM Trans Database Syst"},{"key":"186_CR20","first-page":"209","volume-title":"VLDB","author":"S Fushimi","year":"1986","unstructured":"Fushimi S, Kitsuregawa M, Tanaka H (1986) An overview of the system software of a parallel relational database machine GRACE. In: VLDB, pp\u00a0209\u2013219"},{"issue":"4","key":"186_CR21","first-page":"4","volume":"16","author":"P Gassner","year":"1993","unstructured":"Gassner P, Lohman GM, Schiefer KB, Wang Y (1993) Query optimization in the IBM DB2 family. IEEE Data Eng Bull 16(4):4\u201318","journal-title":"IEEE Data Eng Bull"},{"issue":"2","key":"186_CR22","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G Graefe","year":"1993","unstructured":"Graefe G (1993) Query evaluation techniques for large databases. ACM Comput Surv 25(2):73\u2013170","journal-title":"ACM Comput Surv"},{"issue":"2","key":"186_CR23","first-page":"3","volume":"23","author":"G Graefe","year":"2000","unstructured":"Graefe G (2000) Dynamic query evaluation plans: some course corrections? IEEE Data Eng Bull 23(2):3\u20136","journal-title":"IEEE Data Eng Bull"},{"key":"186_CR24","volume-title":"CIDR","author":"G Graefe","year":"2003","unstructured":"Graefe G (2003) Sorting and indexing with partitioned B-trees. In: CIDR"},{"key":"186_CR25","first-page":"58","volume-title":"BTW","author":"G Graefe","year":"2003","unstructured":"Graefe G (2003) Executing nested queries. In: BTW, pp\u00a058\u201377"},{"key":"186_CR26","doi-asserted-by":"crossref","unstructured":"Graefe G (2006) Implementing sorting in database systems. ACM Comput. Surv. 38(3)","DOI":"10.1145\/1132960.1132964"},{"key":"186_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1140402.1140409","volume-title":"DaMoN","author":"G Graefe","year":"2006","unstructured":"Graefe G (2006) B-tree indexes, interpolation search, and skew. In: DaMoN, p\u00a05"},{"issue":"3\u20134","key":"186_CR28","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00450-007-0022-4","volume":"21","author":"G Graefe","year":"2007","unstructured":"Graefe G (2007) Master-detail clustering using merged indexes. Inform Forsch Entwickl 21(3\u20134):127\u2013145","journal-title":"Inform Forsch Entwickl"},{"key":"186_CR29","doi-asserted-by":"crossref","unstructured":"Graefe G (2010) A\u00a0survey of B-tree locking techniques. ACM Trans Database Syst","DOI":"10.1145\/1806907.1806908"},{"key":"186_CR30","unstructured":"Graefe G (2010) Robust sorting (in preparation)"},{"issue":"2","key":"186_CR31","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/210197.210202","volume":"20","author":"G Graefe","year":"1995","unstructured":"Graefe G, Cole RL (1995) Fast algorithms for universal quantification in large databases. ACM Trans Database Syst 20(2):187\u2013236","journal-title":"ACM Trans Database Syst"},{"key":"186_CR32","first-page":"160","volume-title":"SIGMOD","author":"G Graefe","year":"1987","unstructured":"Graefe G, DeWitt DJ (1987) The Exodus optimizer generator. In: SIGMOD, pp\u00a0160\u2013172"},{"key":"186_CR33","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/1739041.1739087","volume-title":"EDBT","author":"G Graefe","year":"2010","unstructured":"Graefe G, Kuno HA (2010) Self-selecting, self-tuning, incrementally optimized indexes. In: EDBT, pp\u00a0371\u2013381"},{"key":"186_CR34","first-page":"358","volume-title":"SIGMOD","author":"G Graefe","year":"1989","unstructured":"Graefe G, Ward K (1989) Dynamic query evaluation plans. In: SIGMOD, pp\u00a0358\u2013366"},{"issue":"6","key":"186_CR35","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/69.334883","volume":"6","author":"G Graefe","year":"1994","unstructured":"Graefe G, Linville A, Shapiro LD (1994) Sort versus hash revisited. IEEE Trans Knowl Data Eng 6(6):934\u2013944","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"186_CR36","first-page":"86","volume-title":"VLDB","author":"G Graefe","year":"1998","unstructured":"Graefe G, Bunker R, Cooper S (1998) Hash joins and hash teams in Microsoft SQL Server. In: VLDB, pp\u00a086\u201397"},{"key":"186_CR37","volume-title":"CIDR","author":"G Graefe","year":"2009","unstructured":"Graefe G, Kuno HA, Wiener JL (2009) Visualizing the robustness of query execution. In: CIDR"},{"issue":"3","key":"186_CR38","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s007780050043","volume":"6","author":"LM Haas","year":"1997","unstructured":"Haas LM, Carey MJ, Livny M, Shukla A (1997) Seeking the truth about ad-hoc join costs. VLDB J 6(3):241\u2013256","journal-title":"VLDB J"},{"key":"186_CR39","first-page":"289","volume-title":"VLDB","author":"RB Hagmann","year":"1986","unstructured":"Hagmann RB (1986) An observation on database buffering performance metrics. In: VLDB, pp\u00a0289\u2013293"},{"issue":"2","key":"186_CR40","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/292481.277627","volume":"23","author":"JM Hellerstein","year":"1998","unstructured":"Hellerstein JM (1998) Optimization techniques for queries with expensive methods. ACM Trans Database Syst 23(2):113\u2013157","journal-title":"ACM Trans Database Syst"},{"key":"186_CR41","first-page":"98","volume-title":"VLDB","author":"S Helmer","year":"1998","unstructured":"Helmer S, Westmann T, Moerkotte G (1998) Diag-join: an opportunistic join algorithm for 1:N relationships. In: VLDB, pp\u00a098\u2013109"},{"issue":"1","key":"186_CR42","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"CAR Hoare","year":"1962","unstructured":"Hoare CAR (1962) Quicksort. Comput J 5(1):10\u201315","journal-title":"Comput J"},{"key":"186_CR43","first-page":"68","volume-title":"CIDR","author":"S Idreos","year":"2007","unstructured":"Idreos S, Kersten ML, Manegold S (2007) Database cracking. In: CIDR, pp\u00a068\u201378"},{"key":"186_CR44","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/93597.98740","volume-title":"SIGMOD","author":"YE Ioannidis","year":"1990","unstructured":"Ioannidis YE, Kang YC (1990) Randomized algorithms for optimizing large join queries. In: SIGMOD, pp\u00a0312\u2013321"},{"key":"186_CR45","first-page":"148","volume-title":"SIGMOD","author":"T Keller","year":"1991","unstructured":"Keller T, Graefe G, Maier D (1991) Efficient assembly of complex objects. In: SIGMOD, pp\u00a0148\u2013157"},{"key":"186_CR46","first-page":"30","volume-title":"VLDB","author":"A Kemper","year":"1999","unstructured":"Kemper A, Kossmann D, Wiesner C (1999) Generalised hash teams for join and group-by. In: VLDB, pp\u00a030\u201341"},{"key":"186_CR47","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/582250.582278","volume-title":"SIGMOD","author":"W Kim","year":"1980","unstructured":"Kim W (1980) A\u00a0new way to compute the product and join of relations. In: SIGMOD, pp\u00a0179\u2013187"},{"key":"186_CR48","first-page":"257","volume-title":"VLDB","author":"M Kitsuregawa","year":"1989","unstructured":"Kitsuregawa M, Nakayama M, Takagi M (1989) The effect of bucket size tuning in the dynamic hybrid GRACE hash join method. In: VLDB, pp\u00a0257\u2013266"},{"key":"186_CR49","volume-title":"The art of computer programming, vol III: sorting and searching","author":"DE Knuth","year":"1973","unstructured":"Knuth DE (1973) The art of computer programming, vol III: sorting and searching. Addison-Wesley, Reading"},{"issue":"4","key":"186_CR50","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TKDE.2003.1209012","volume":"15","author":"P-\u00c5 Larson","year":"2003","unstructured":"Larson P-\u00c5 (2003) External sorting: run formation revisited. IEEE Trans Knowl Data Eng 15(4):961\u2013972","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"186_CR51","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1145\/276304.276346","volume-title":"SIGMOD","author":"P-\u00c5 Larson","year":"1998","unstructured":"Larson P-\u00c5, Graefe G (1998) Memory management during run generation in external sorting. In: SIGMOD, pp\u00a0472\u2013483"},{"key":"186_CR52","unstructured":"Li G (2010) On the design and evaluation of a new order-based join algorithm. MS-CS thesis, UC Irvine"},{"key":"186_CR53","first-page":"26","volume-title":"ICDE","author":"Q Li","year":"2007","unstructured":"Li Q, Shao M, Markl V, Beyer KS, Colby LS, Lohman GM (2007) Adaptively reordering joins during query execution. In: ICDE, pp\u00a026\u201335"},{"key":"186_CR54","first-page":"18","volume-title":"SIGMOD","author":"GM Lohman","year":"1988","unstructured":"Lohman GM (1988) Grammar-like functional rules for representing query optimization alternatives. In: SIGMOD, pp\u00a018\u201327"},{"issue":"1","key":"186_CR55","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1147\/sj.421.0098","volume":"42","author":"V Markl","year":"2003","unstructured":"Markl V, Lohman GM, Raman V (2003) LEO: An autonomic query optimizer for DB2. IBM Syst J 42(1):98\u2013106","journal-title":"IBM Syst J"},{"key":"186_CR56","first-page":"361","volume-title":"SIGMOD","author":"C Mohan","year":"1992","unstructured":"Mohan C, Narang I (1992) Algorithms for creating indexes for very large tables without quiescing updates. In: SIGMOD, pp\u00a0361\u2013370"},{"key":"186_CR57","first-page":"29","volume-title":"EDBT","author":"C Mohan","year":"1990","unstructured":"Mohan C, Haderle DJ, Wang Y, Cheng JM (1990) Single table access using multiple indexes: optimization, execution, and concurrency control techniques. In: EDBT, pp\u00a029\u201343"},{"issue":"8","key":"186_CR58","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/32.153378","volume":"18","author":"JEB Moss","year":"1992","unstructured":"Moss JEB (1992) Working with persistent objects: to swizzle or not to swizzle. IEEE Trans Softw Eng 18(8):657\u2013673","journal-title":"IEEE Trans Softw Eng"},{"key":"186_CR59","first-page":"28","volume-title":"SIGMOD","author":"M Muralikrishna","year":"1988","unstructured":"Muralikrishna M, DeWitt DJ (1988) Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In: SIGMOD, pp\u00a028\u201336"},{"key":"186_CR60","first-page":"468","volume-title":"VLDB","author":"M Nakayama","year":"1988","unstructured":"Nakayama M, Kitsuregawa M, Takagi M (1988) Hash-partitioned join method using dynamic destaging strategy. In: VLDB, pp\u00a0468\u2013478"},{"key":"186_CR61","first-page":"618","volume-title":"VLDB","author":"H Pang","year":"1993","unstructured":"Pang H, Carey MJ, Livny M (1993) Memory-adaptive external sorting. In: VLDB, pp\u00a0618\u2013629"},{"issue":"3","key":"186_CR62","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00572988","volume":"27","author":"B Salzberg","year":"1989","unstructured":"Salzberg B (1989) Merging sorted runs using large main memory. Acta Inform 27(3):195\u2013215","journal-title":"Acta Inform"},{"key":"186_CR63","first-page":"23","volume-title":"SIGMOD","author":"PG Selinger","year":"1979","unstructured":"Selinger PG, Astrahan MM, Chamberlin DD, Lorie RA, Price TG (1979) Access path selection in a relational database management system. In: SIGMOD, pp\u00a023\u201334"},{"issue":"3","key":"186_CR64","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/6314.6315","volume":"11","author":"LD Shapiro","year":"1986","unstructured":"Shapiro LD (1986) Join processing in database systems with large main memories. ACM Trans Database Syst 11(3):239\u2013264","journal-title":"ACM Trans Database Syst"},{"key":"186_CR65","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/93597.98739","volume-title":"SIGMOD","author":"EJ Shekita","year":"1990","unstructured":"Shekita EJ, Carey MJ (1990) A\u00a0performance evaluation of pointer-based joins. In: SIGMOD, pp\u00a0300\u2013311"},{"key":"186_CR66","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/233269.233320","volume-title":"SIGMOD","author":"DE Simmen","year":"1996","unstructured":"Simmen DE, Shekita EJ, Malkemus T (1996) Fundamental techniques for order optimization. In: SIGMOD, pp\u00a057\u201367"},{"key":"186_CR67","first-page":"409","volume-title":"VLDB","author":"K Youssefi","year":"1979","unstructured":"Youssefi K, Wong E (1979) Query processing in a relational database management system. In: VLDB, pp\u00a0409\u2013417"},{"key":"186_CR68","first-page":"186","volume-title":"VLDB","author":"H Zeller","year":"1990","unstructured":"Zeller H, Gray J (1990) An adaptive hash join algorithm for multiuser environments. In: VLDB, pp\u00a0186\u2013197"},{"key":"186_CR69","first-page":"523","volume-title":"VLDB","author":"W Zhang","year":"1998","unstructured":"Zhang W, Larson P-\u00c5 (1998) Buffering and read-ahead strategies for external mergesort. In: VLDB, pp\u00a0523\u2013533"}],"container-title":["Computer Science - Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-011-0186-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00450-011-0186-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-011-0186-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T08:34:40Z","timestamp":1712565280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-011-0186-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,30]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1007\/s00450-011-0186-9","relation":{},"ISSN":["1865-2034","1865-2042"],"issn-type":[{"value":"1865-2034","type":"print"},{"value":"1865-2042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,30]]}}}