{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:32Z","timestamp":1750307492384,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,6]],"date-time":"2010-06-06T00:00:00Z","timestamp":1275782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,6]]},"DOI":"10.1145\/1807167.1807186","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"147-158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["PR-join"],"prefix":"10.1145","author":[{"given":"Shimin","family":"Chen","sequence":"first","affiliation":[{"name":"Intel Labs Pittsburgh, Pittsburgh, PA, USA"}]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Intel Labs Pittsburgh, Pittsburgh, PA, USA"}]},{"given":"Suman","family":"Nath","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687669"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687557"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559855"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602261"},{"key":"e_1_3_2_1_5_1","volume-title":"VLDB","author":"Dittrich J.-P.","year":"2002","unstructured":"J.-P. Dittrich , B. Seeger , D. S. Taylor , and P. Widmayer . Progressive merge join: A generic and non-blocking sort-based join algorithm . In VLDB , 2002 . J.-P. Dittrich, B. Seeger, D. S. Taylor, and P. Widmayer. Progressive merge join: A generic and non-blocking sort-based join algorithm. In VLDB, 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687675"},{"key":"e_1_3_2_1_7_1","unstructured":"Gartner Inc. Market share: Business intelligence platform software worldwide 2007. http:\/\/www.gartner.com\/it\/page.jsp?id=700410 2008.  Gartner Inc. Market share: Business intelligence platform software worldwide 2007. http:\/\/www.gartner.com\/it\/page.jsp?id=700410 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/152610.152611"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1363189.1363198"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304208"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009835310546"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_3_2_1_13_1","volume-title":"http:\/\/www.emc.com\/collateral\/analyst-reports\/diverseexploding-digital-universe.pdf","author":"DC.","year":"2008","unstructured":"I DC. The diverse and exploding digital universe. http:\/\/www.emc.com\/collateral\/analyst-reports\/diverseexploding-digital-universe.pdf , 2008 . IDC. The diverse and exploding digital universe. http:\/\/www.emc.com\/collateral\/analyst-reports\/diverseexploding-digital-universe.pdf, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412331.1412335"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189775"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037022"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453913"},{"key":"e_1_3_2_1_18_1","volume-title":"VLDB","author":"Lawrence R.","year":"2005","unstructured":"R. Lawrence . Early hash join: A configurable algorithm for the efficient and early production of join results . In VLDB , 2005 . R. Lawrence. Early hash join: A configurable algorithm for the efficient and early production of join results. In VLDB, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376723"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564721"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978115"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453961"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236412"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066200"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559854"},{"issue":"2","key":"e_1_3_2_1_26_1","first-page":"27","article-title":"Xjoin: A reactively-scheduled pipelined join operator","volume":"23","author":"Urhan T.","year":"2000","unstructured":"T. Urhan and M. J. Franklin . Xjoin: A reactively-scheduled pipelined join operator . Data Eng. Bull. , 23 ( 2 ): 27 -- 33 , 2000 . T. Urhan and M. J. Franklin. Xjoin: A reactively-scheduled pipelined join operator. Data Eng. Bull., 23(2):27--33, 2000.","journal-title":"Data Eng. Bull."}],"event":{"name":"SIGMOD\/PODS '10: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Indianapolis Indiana USA","acronym":"SIGMOD\/PODS '10"},"container-title":["Proceedings of the 2010 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807186","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807167.1807186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:35Z","timestamp":1750249055000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807186"}},"subtitle":["a non-blocking join achieving higher early result rate with statistical guarantees"],"short-title":[],"issued":{"date-parts":[[2010,6,6]]},"references-count":26,"alternative-id":["10.1145\/1807167.1807186","10.1145\/1807167"],"URL":"https:\/\/doi.org\/10.1145\/1807167.1807186","relation":{},"subject":[],"published":{"date-parts":[[2010,6,6]]},"assertion":[{"value":"2010-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}