{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:09:35Z","timestamp":1742396975029},"reference-count":31,"publisher":"Elsevier","isbn-type":[{"value":"9781558608696","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1016\/b978-155860869-6\/50034-2","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T07:32:10Z","timestamp":1186644730000},"page":"299-310","source":"Crossref","is-referenced-by-count":33,"title":["Progressive Merge Join"],"prefix":"10.1016","author":[{"given":"Jens-Peter","family":"Dittrich","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Seeger","sequence":"additional","affiliation":[]},{"given":"David Scot","family":"Taylor","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-155860869-6\/50034-2_bib1","series-title":"VLDB","first-page":"570","article-title":"Scalable sweeping-based spatial join","author":"Arge","year":"1998"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib2","series-title":"Sample Survey \u2014 Principles & Methods","author":"Barnett","year":"1991"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib3","series-title":"VLDB","first-page":"39","article-title":"XXL \u2014 A Library Approach to Supporting Efficient Implementations of Advanced Database Queries","author":"Bercken","year":"2001"},{"issue":"4","key":"10.1016\/B978-155860869-6\/50034-2_bib4","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1147\/sj.164.0363","article-title":"Storage and access in relational data bases","volume":"16","author":"Blasgen","year":"1977","journal-title":"IBM Systems Journal"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib5","series-title":"CIKM","first-page":"298","article-title":"High Performance Clustering Based on the Similarity Join","author":"B\u00f6hm","year":"2000"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib6","series-title":"ACM SIGMOD","first-page":"379","article-title":"Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data","author":"B\u00f6hm","year":"2001"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib7","series-title":"ICDE","first-page":"535","article-title":"Data Redundancy and Duplicate Detection in Spatial Join Processing","author":"Dittrich","year":"2000"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib8","series-title":"ACM SIGKDD","first-page":"47","article-title":"GESS: a Scalable Similarity-Join Algorithm for Mining Large Data Sets in High Dimensional Spaces","author":"Dittrich","year":"2001"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib9","series-title":"Progressive Merge Join (full version)","author":"Dittrich","year":"2002"},{"issue":"2","key":"10.1016\/B978-155860869-6\/50034-2_bib10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","article-title":"Query evaluation techniques for large databases","volume":"25","author":"Graefe","year":"1993","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib11","series-title":"ACM SIGMOD","first-page":"287","article-title":"Ripple joins for online aggregation","author":"Haas","year":"1999"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib12","series-title":"JCSS","first-page":"550","article-title":"Selectivity and Cost Estimation for Joins Based on Random Sampling","author":"Haas","year":"1996"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib13","series-title":"ACM SIGMOD","first-page":"171","article-title":"Online aggregation","author":"Hellerstein","year":"1997"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib14","series-title":"ACM SIGMOD","first-page":"299","article-title":"An Adaptive Query Execution System for Data Integration","author":"Ives","year":"1999"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib15","series-title":"VLDB","first-page":"135","article-title":"Percentile finding algorithm for multiple sorted runs","author":"Iyer","year":"1989"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib16","series-title":"ACM SIGMOD","first-page":"324","article-title":"Size Separation Spatial Join","author":"Koudas","year":"1997"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib17","first-page":"3","article-title":"High Dimensional Similarity Joins: Algorithms and Performance Evaluation","volume":"12","author":"Koudas","year":"2000","journal-title":"TKDE"},{"issue":"3","key":"10.1016\/B978-155860869-6\/50034-2_bib18","first-page":"508","article-title":"On Sort-Merge Algorithm for Band Joins","volume":"7","author":"Lu","year":"1995","journal-title":"TKDE"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib19","article-title":"A Non-blocking Parallel Spatial Join Algorithm","author":"Luo","year":"2002","journal-title":"ICDE"},{"issue":"1","key":"10.1016\/B978-155860869-6\/50034-2_bib20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(85)90101-2","article-title":"Join during merge: An improved sort based algorithm","volume":"21","author":"Negri","year":"1985","journal-title":"IPL"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib21","series-title":"TIGER\/Line precensus files (1996 Technical Documentation)","author":"of Census","year":"1996"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib22","series-title":"ACM SIGMOD","first-page":"326","article-title":"Spatial Query Processing in an Object-Oriented Database System","author":"Orenstein","year":"1986"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib23","series-title":"SSD","first-page":"381","article-title":"An Algorithm for Computing the Overlay of k-Dimensional Spaces","author":"Orenstein","year":"1991"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib24","series-title":"ACM SIGMOD","first-page":"259","article-title":"Partition Based Spatial-Merge Join","author":"Patel","year":"1996"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib25","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib26","first-page":"412","article-title":"A parallel processing strategy for evaluating recursive queries","author":"Raschid","year":"1986","journal-title":"VLDB"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib27","series-title":"ICDE","first-page":"301","article-title":"High-Dimensional Similarity Joins","author":"Shim","year":"1997"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib28","first-page":"282","article-title":"Efficient Evaluation of the Valid-Time Natural Join","author":"Soo","year":"1994","journal-title":"ICDE"},{"issue":"2","key":"10.1016\/B978-155860869-6\/50034-2_bib29","first-page":"27","article-title":"Xjoin: A reactively-scheduled pipelined join operator","volume":"23","author":"Urhan","year":"2000","journal-title":"Data Engineering Bulletin"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib30","series-title":"Conference on Databases, Parallel Architectures and their Applications, Miami, USA","first-page":"68","article-title":"Pipelining in Query Execution","author":"Wilschut","year":"1991"},{"key":"10.1016\/B978-155860869-6\/50034-2_bib31","series-title":"VLDB","first-page":"376","article-title":"Dynamic memory adjustment for external mergesort","author":"Zhang","year":"1997"}],"container-title":["VLDB '02: Proceedings of the 28th International Conference on Very Large Databases"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,1,5]],"date-time":"2019-01-05T02:59:59Z","timestamp":1546657199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558608696500342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781558608696"],"references-count":31,"URL":"https:\/\/doi.org\/10.1016\/b978-155860869-6\/50034-2","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}