{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:57:08Z","timestamp":1649181428800},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10115-011-0429-x","type":"journal-article","created":{"date-parts":[[2011,6,30]],"date-time":"2011-06-30T09:28:59Z","timestamp":1309426139000},"page":"527-557","source":"Crossref","is-referenced-by-count":7,"title":["PI-Join: Efficiently processing join queries on massive data"],"prefix":"10.1007","volume":"32","author":[{"given":"Xixian","family":"Han","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Donghua","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,1]]},"reference":[{"key":"429_CR1","unstructured":"Ailamaki A, DeWitt D, Hill M, Wood D (1999) DBMSs on a modern processor: where does time go? In: Proceedings of the 25th international conference on very large data bases, pp 266\u2013277"},{"issue":"3","key":"429_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10115-004-0149-6","volume":"7","author":"J An","year":"2005","unstructured":"An J, Chen H, Furuse K, Ohbo N (2005) CVA file: an index structure for high-dimensional datasets. Knowl Inf Syst 7(3): 337\u2013357","journal-title":"Knowl Inf Syst"},{"key":"429_CR3","volume-title":"Programming pearls","author":"J Bentley","year":"2000","unstructured":"Bentley J (2000) Programming pearls. 2nd edn. ACM Press\/Addison-Wesley, New York","edition":"2"},{"issue":"6","key":"429_CR4","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm C, Krebs F (2004) The k-nearest neighbour join: turbo charging the KDD process. Knowl Inf Syst 6(6): 728\u2013749","journal-title":"Knowl Inf Syst"},{"key":"429_CR5","unstructured":"Boncz P, Manegold S, Kersten M (1999) Database architecture optimized for the new bottleneck: memory access. In: Proceedings of the 25th international conference on very large data bases, pp 54\u201365"},{"issue":"2","key":"429_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10115-010-0303-2","volume":"27","author":"H Chen","year":"2011","unstructured":"Chen H, Liu J, Furuse K, Yu J, Ohbo N (2011) Indexing expensive functions for efficient multi-dimensional similarity search. Knowl Inf Syst 27(2): 165\u2013192","journal-title":"Knowl Inf Syst"},{"key":"429_CR7","doi-asserted-by":"crossref","unstructured":"Chen S, Ailamaki A, Gibbons P, Mowry T (2004) Improving hash join performance through prefetching. In: Proceedings of the 20th international conference on data engineering, pp 116\u2013127","DOI":"10.1109\/ICDE.2004.1319989"},{"issue":"3","key":"429_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1272743.1272747","volume":"32","author":"S Chen","year":"2007","unstructured":"Chen S, Ailamaki A, Gibbons P, Mowry T (2007) Improving hash join performance through prefetching. ACM Trans Database Syst 32(3): 17","journal-title":"ACM Trans Database Syst"},{"key":"429_CR9","doi-asserted-by":"crossref","unstructured":"DeWitt D, Katz R, Olken F, Shapiro L, Stonebraker M, Wood D (1984) Implementation techniques for main memory database systems. In: Proceedings of the 1984 ACM SIGMOD international conference on management of data, pp 1\u20138","DOI":"10.1145\/602259.602261"},{"key":"429_CR10","unstructured":"DeWitt D, Naughton J, Schneider D (1991) An evaluation of non-equijoin algorithms. In: Proceedings of the 17th international conference on very large data bases, pp 443\u2013452"},{"key":"429_CR11","volume-title":"Database systems: the complete book","author":"H Garcia-Molina","year":"2008","unstructured":"Garcia-Molina H, Ullman J, Widom J (2008) Database systems: the complete book, 2nd edn. Prentice Hall, Upper Saddle River","edition":"2"},{"key":"429_CR12","volume-title":"Five performance enhancements for hybrid hash join","author":"G Graefe","year":"1992","unstructured":"Graefe G (1992) Five performance enhancements for hybrid hash join. Technical report, CU-CS-606-92, University of Colorado at Boulder"},{"issue":"2","key":"429_CR13","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"},{"key":"429_CR14","doi-asserted-by":"crossref","unstructured":"Gray J, Shenoy P (2000) Rules of thumb in data engineering. In: Proceedings of the 16th international conference on data engineering, pp 3\u201312","DOI":"10.1109\/ICDE.2000.839382"},{"key":"429_CR15","doi-asserted-by":"crossref","unstructured":"He B, Luo Q (2006) Cache-oblivious nested-loop joins. In: Proceedings of the 2006 ACM CIKM international conference on information and knowledge management, pp 718\u2013727","DOI":"10.1145\/1183614.1183717"},{"key":"429_CR16","unstructured":"He B, Luo Q (2007) Cache-oblivious query processing. In: Proceedings of 3rd biennial conference on innovative data systems research, pp 44\u201355"},{"issue":"2","key":"429_CR17","first-page":"8","volume":"33","author":"B He","year":"2008","unstructured":"He B, Luo Q (2008) Cache-oblivious databases: limitations and opportunities. ACM Trans Database Syst 33(2): 8","journal-title":"ACM Trans Database Syst"},{"key":"429_CR18","unstructured":"Kamath M, Ramamritham K Bucket skip merge join: a scalable algorithm for join processing in very large databases using indexes. Technical report, CS-TR-96-20, University of Massachusetts"},{"issue":"2","key":"429_CR19","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.14778\/1687553.1687564","volume":"2","author":"C Kim","year":"2009","unstructured":"Kim C, Sedlar E, Chhugani J et\u00a0al (2009) Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs. Proc VLDB Endow 2(2): 1378\u20131389","journal-title":"Proc VLDB Endow"},{"key":"429_CR20","doi-asserted-by":"crossref","unstructured":"Kranen P, Assent I, Baldauf C, Seidl T (2010) The ClusTree: indexing micro-clusters for anytime stream mining. Knowl Inf Syst 1\u201324. doi: 10.1007\/s10115-010-0342-8","DOI":"10.1007\/s10115-010-0342-8"},{"issue":"1","key":"429_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s007780050071","volume":"8","author":"Z Li","year":"1999","unstructured":"Li Z, Ross K (1999) Fast joins using join indices. VLDB J 8(1): 1\u201324","journal-title":"VLDB J"},{"key":"429_CR22","unstructured":"Manegold S, Boncz P, Kersten M (2000) What happens during a join? Dissecting CPU and Memory optimization effects. In: Proceedings of the 26th international conference on very large data bases, pp 339\u2013350"},{"issue":"1","key":"429_CR23","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/128762.128764","volume":"24","author":"P Mishra","year":"1992","unstructured":"Mishra P, Eich M (1992) Join processing in relational databases. ACM Comput Surv 24(1): 63\u2013113","journal-title":"ACM Comput Surv"},{"issue":"4","key":"429_CR24","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/BF01354877","volume":"4","author":"C Nyberg","year":"1995","unstructured":"Nyberg C, Barclay T, Cvetanovic Z, Gray J, Lomet D (1995) AlphaSort: a cache-sensitive parallel external sor. VLDB J 4(4): 603\u2013627","journal-title":"VLDB J"},{"issue":"3","key":"429_CR25","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/211990.212001","volume":"24","author":"P O\u2019Neil","year":"1995","unstructured":"O\u2019Neil P, Graefe G (1995) Multi-table joins through bitmapped join indices. SIGMOD Rec 24(3): 8\u201311","journal-title":"SIGMOD Rec"},{"key":"429_CR26","unstructured":"Oracle (2010) Oracle database 11g release 2 (11.2) documentation. http:\/\/www.oracle.com\/pls\/db112\/homepage"},{"issue":"3","key":"429_CR27","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"33","author":"E Parzen","year":"1962","unstructured":"Parzen E (1962) On estimation of a probability density function and mode. Ann Math Stat 33(3): 1065\u20131076","journal-title":"Ann Math Stat"},{"key":"429_CR28","doi-asserted-by":"crossref","unstructured":"Raykar V, Duraiswami R (2006) Fast optimal bandwidth selection for kernel density estimation. In: Proceedings of the 6th SIAM international conference on data mining, pp 524\u2013528","DOI":"10.1137\/1.9781611972764.53"},{"key":"429_CR29","doi-asserted-by":"crossref","unstructured":"Selinger P, Astrahan M, Chamberlin D, Lorie R, Price T (1979) Access path selection in a relational database management system. In: Proceedings of the 1979 ACM SIGMOD international conference on management of data, pp 23\u201334","DOI":"10.1145\/582095.582099"},{"issue":"3","key":"429_CR30","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00011648","volume":"2","author":"C Shahabi","year":"2000","unstructured":"Shahabi C, Khan L, McLeod D (2000) A probe-based technique to optimize join queries in distributed internet databases. Knowl Inf Syst 2(3): 373\u2013385","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"429_CR31","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/s10115-003-0104-y","volume":"6","author":"C Shahabi","year":"2004","unstructured":"Shahabi C, Kolahdouzan M, Safar M (2004) Alternative strategies for performing spatial joins on web sources. Knowl Inf Syst 6(3): 290\u2013314","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"429_CR32","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/6314.6315","volume":"11","author":"L Shapiro","year":"1986","unstructured":"Shapiro L (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":"429_CR33","unstructured":"Shatdal A, Kant C, Naughton J (1994) Cache conscious algorithms for relational query processing. In: Proceedings of the 20th international conference on very large data bases, pp 510\u2013521"},{"key":"429_CR34","unstructured":"Stonebraker M, Abadi D, Batkin A et\u00a0al (2005) C-store: a column-oriented DBMS. In: Proceedings of the 31st international conference on very large data bases, pp 553\u2013564"},{"issue":"4","key":"429_CR35","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF03325111","volume":"1","author":"K Tan","year":"1999","unstructured":"Tan K, Goh C, Lee M, Ooi B (1999) Efficient join processing using partial precomputation. Knowl Inf Syst 1(4): 481\u2013514","journal-title":"Knowl Inf Syst"},{"key":"429_CR36","unstructured":"Tom\u2019s Hardware (2006) Hard drives: 40\u00a0MB to 750\u00a0GB\u20143,500 to 10,000\u00a0RPM. http:\/\/www.tomshardware.com\/reviews\/15-years-of-hard-drive-history,1368-2.html"},{"issue":"2","key":"429_CR37","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/22952.22955","volume":"12","author":"P Valduriez","year":"1987","unstructured":"Valduriez P (1987) Join indices. ACM Trans Database Syst 12(2): 218\u2013246","journal-title":"ACM Trans Database Syst"},{"key":"429_CR38","unstructured":"Wong H, Liu H, Olken F, Rotem D, Wong L (1985) Bit transposed files. In: Proceedings of the 11th international conference on very large data bases, pp 448\u2013457"},{"issue":"3","key":"429_CR39","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01840449","volume":"1","author":"H Wong","year":"1986","unstructured":"Wong H, Li J, Olken F, Rotem D, Wong L (1986) Bit transposition for very large scientific and statistical databases. Algorithmica 1(3): 289\u2013309","journal-title":"Algorithmica"},{"issue":"1","key":"429_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-008-0190-y","volume":"22","author":"M Zhang","year":"2010","unstructured":"Zhang M, Alhajj R (2010) Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space. Knowl Inf Syst 22(1): 1\u201326","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0429-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-011-0429-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0429-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:24Z","timestamp":1559124624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-011-0429-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,1]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["429"],"URL":"https:\/\/doi.org\/10.1007\/s10115-011-0429-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,1]]}}}