{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T05:59:41Z","timestamp":1772171981105,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"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":[[2019,6,25]]},"DOI":"10.1145\/3299869.3319859","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"87-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Cache-oblivious High-performance Similarity Join"],"prefix":"10.1145","author":[{"given":"Martin","family":"Perdacher","sequence":"first","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Plant","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Marcel R. Ackermann Marcus M\"a rtens Christoph Raupach Kamil Swierkot Christiane Lammersen and Christian Sohler. 2012. StreamKM  Marcel R. Ackermann Marcus M\"a rtens Christoph Raupach Kamil Swierkot Christiane Lammersen and Christian Sohler. 2012. StreamKM","DOI":"10.1145\/2133803.2184450"},{"key":"e_1_3_2_1_2_1","volume-title":"ACM Journal of Experimental Algorithmics","volume":"17","year":"2012","unstructured":": A clustering algorithm for data streams . ACM Journal of Experimental Algorithmics , Vol. 17 , 1 ( 2012 ). : A clustering algorithm for data streams. ACM Journal of Experimental Algorithmics, Vol. 17, 1 (2012)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"e_1_3_2_1_4_1","volume-title":"B\u00f6 hlen","author":"Augsten Nikolaus","year":"2013","unstructured":"Nikolaus Augsten and Michael H . B\u00f6 hlen . 2013 . Similarity Joins in Relational Database Systems .Morgan & Claypool Publishers . Nikolaus Augsten and Michael H. B\u00f6 hlen. 2013. Similarity Joins in Relational Database Systems .Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85451-7_85"},{"key":"e_1_3_2_1_6_1","volume-title":"Cache Oblivious Matrix Operations Using Peano Curves. In PARA Workshop . 521--530","author":"Bader Michael","unstructured":"Michael Bader and Christian E. Mayer . 2006 . Cache Oblivious Matrix Operations Using Peano Curves. In PARA Workshop . 521--530 . Michael Bader and Christian E. Mayer. 2006. Cache Oblivious Matrix Operations Using Peano Curves. In PARA Workshop . 521--530."},{"key":"e_1_3_2_1_7_1","volume-title":"Nature Communications","volume":"5","author":"Baldi P.","year":"2014","unstructured":"P. Baldi , P. Sadowski , and D. Whiteson . 2014. Searching for exotic particles in high-energy physics with deep learning . Nature Communications , Vol. 5 (02 Jul 2014 ), 4308 EP --. Article. P. Baldi, P. Sadowski, and D. Whiteson. 2014. Searching for exotic particles in high-energy physics with deep learning. Nature Communications, Vol. 5 (02 Jul 2014), 4308 EP --. Article."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054385"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375714"},{"key":"e_1_3_2_1_10_1","unstructured":"Christian B\u00f6 hm and Hans-Peter Kriegel. 2001. A Cost Model and Index Architecture for the Similarity Join. In ICDE . 411--420.   Christian B\u00f6 hm and Hans-Peter Kriegel. 2001. A Cost Model and Index Architecture for the Similarity Join. In ICDE . 411--420."},{"key":"e_1_3_2_1_11_1","first-page":"57","article-title":"Indexsupported Similarity Join on Graphics Processors. In Datenbanksysteme in Business","volume":"2009","author":"Christian B\u00f6","year":"2009","unstructured":"Christian B\u00f6 hm, Robert Noll , Claudia Plant , and Andrew Zherdin . 2009 . Indexsupported Similarity Join on Graphics Processors. In Datenbanksysteme in Business , Technologie und Web BTW 2009. 57 -- 66 . Christian B\u00f6 hm, Robert Noll, Claudia Plant, and Andrew Zherdin. 2009. Indexsupported Similarity Join on Graphics Processors. In Datenbanksysteme in Business, Technologie und Web BTW 2009. 57--66.","journal-title":"Technologie und Web BTW"},{"key":"e_1_3_2_1_12_1","volume-title":"A Novel Hilbert Curve for Cache-locality Preserving Loops","author":"Christian B\u00f6","year":"2018","unstructured":"Christian B\u00f6 hm, Martin Perdacher , and Claudia Plant . 2018. A Novel Hilbert Curve for Cache-locality Preserving Loops . IEEE Transactions on Big Data ( 2018 ). Christian B\u00f6 hm, Martin Perdacher, and Claudia Plant. 2018. A Novel Hilbert Curve for Cache-locality Preserving Loops. IEEE Transactions on Big Data (2018)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/290200.290219"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170075"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497443"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2506556"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1269921.1269926"},{"key":"e_1_3_2_1_18_1","volume-title":"M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB'97 . 426--435","author":"Ciaccia Paolo","year":"1997","unstructured":"Paolo Ciaccia , Marco Patella , and Pavel Zezula . 1997 . M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB'97 . 426--435 . Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB'97 . 426--435."},{"key":"e_1_3_2_1_19_1","volume-title":"Overlap Set Similarity Joins with Theoretical Guarantees. In SIGMOD Conf. 2018 . 905--920","author":"Deng Dong","year":"2018","unstructured":"Dong Deng , Yufei Tao , and Guoliang Li . 2018 . Overlap Set Similarity Joins with Theoretical Guarantees. In SIGMOD Conf. 2018 . 905--920 . Dong Deng, Yufei Tao, and Guoliang Li. 2018. Overlap Set Similarity Joins with Theoretical Guarantees. In SIGMOD Conf. 2018 . 905--920."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502524"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025026030880"},{"key":"e_1_3_2_1_22_1","first-page":"484","article-title":"a","volume":"2003","author":"Dohnal Vlastislav","year":"2003","unstructured":"Vlastislav Dohnal , Claudio Gennaro , and Pavel Zezula . 2003 a . Similarity Join in Metric Spaces Using eD-Index. DEXA 2003. 484 -- 493 . Vlastislav Dohnal, Claudio Gennaro, and Pavel Zezula. 2003 a. Similarity Join in Metric Spaces Using eD-Index. DEXA 2003. 484--493.","journal-title":"Similarity Join in Metric Spaces Using eD-Index. DEXA"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/77626.79170"},{"key":"e_1_3_2_1_24_1","volume-title":"Navathe","author":"Elmasri Ramez","year":"2006","unstructured":"Ramez Elmasri and Shamkant B . Navathe . 2006 . Fundamentals of Database Systems .Addison Wesley , 5 th edition. Ramez Elmasri and Shamkant B. Navathe. 2006. Fundamentals of Database Systems .Addison Wesley, 5th edition.","edition":"5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-165"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3231751.3231760"},{"key":"e_1_3_2_1_27_1","unstructured":"F.D. Fracchia P. Prusinkiewicz and A. Lindenmayer. 1991. Synthesis of Space-filling Curves on the Square Grid. In Fractals in the Fundamental and Applied Sciences. 341--366.  F.D. Fracchia P. Prusinkiewicz and A. Lindenmayer. 1991. Synthesis of Space-filling Curves on the Square Grid. In Fractals in the Fundamental and Applied Sciences. 341--366."},{"key":"e_1_3_2_1_28_1","volume-title":"Cache-Oblivious Algorithms. In FOCS","author":"Frigo Matteo","year":"1999","unstructured":"Matteo Frigo , Charles E. Leiserson , Harald Prokop , and Sridhar Ramachandran . 1999 . Cache-Oblivious Algorithms. In FOCS 1999. 285--298. Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. 1999. Cache-Oblivious Algorithms. In FOCS 1999. 285--298."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-014-1185-y"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247607"},{"key":"e_1_3_2_1_31_1","volume-title":"Math. Ann.","volume":"38","author":"Hilbert David","year":"1891","unstructured":"David Hilbert . 1891 . \u00dcber die stetige Abbildung einer Linie auf ein Fl\"achenst\u00fcck . Math. Ann. , Vol. 38 ( 1891). David Hilbert. 1891. \u00dcber die stetige Abbildung einer Linie auf ein Fl\"achenst\u00fcck. Math. Ann., Vol. 38 ( 1891)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2192-6"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"James Jeffers James Reinders and Avinash Sodani. 2016. Intel Xeon Phi Processor High Performance Programming: Knights Landing Edition 2Nd Edition .   James Jeffers James Reinders and Avinash Sodani. 2016. Intel Xeon Phi Processor High Performance Programming: Knights Landing Edition 2Nd Edition .","DOI":"10.1016\/B978-0-12-809194-4.00002-8"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0305-7"},{"key":"e_1_3_2_1_35_1","volume-title":"Kalashnikov and Sunil Prabhakar","author":"Dmitri","year":"2003","unstructured":"Dmitri V. Kalashnikov and Sunil Prabhakar . 2003 . Similarity Join for Low-and High-Dimensional Data. (DASFAA '03). 7--16. Dmitri V. Kalashnikov and Sunil Prabhakar. 2003. Similarity Join for Low-and High-Dimensional Data. (DASFAA '03). 7--16."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.07.002"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.842246"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Ye Li Jian Wang and Leong Hou U. 2016. Multidimensional Similarity Join Using MapReduce. Web-Age Information Management . 457--468.  Ye Li Jian Wang and Leong Hou U. 2016. Multidimensional Similarity Join Using MapReduce. Web-Age Information Management . 457--468.","DOI":"10.1007\/978-3-319-39958-4_36"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497520"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3952"},{"key":"e_1_3_2_1_41_1","volume-title":"Adaptive MapReduce Similarity Joins. In SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond. 4:1--4:4.","author":"McCauley Samuel","year":"2018","unstructured":"Samuel McCauley and Francesco Silvestri . 2018 . Adaptive MapReduce Similarity Joins. In SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond. 4:1--4:4. Samuel McCauley and Francesco Silvestri. 2018. Adaptive MapReduce Similarity Joins. In SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond. 4:1--4:4."},{"key":"e_1_3_2_1_42_1","volume-title":"Kitsune: An Ensemble of Autoencoders for Online Network Intrusion Detection. In Network and Distributed System Security Symposium, NDSS.","author":"Mirsky Yisroel","year":"2018","unstructured":"Yisroel Mirsky , Tomer Doitshman , Yuval Elovici , and Asaf Shabtai . 2018 . Kitsune: An Ensemble of Autoencoders for Online Network Intrusion Detection. In Network and Distributed System Security Symposium, NDSS. Yisroel Mirsky, Tomer Doitshman, Yuval Elovici, and Asaf Shabtai. 2018. Kitsune: An Ensemble of Autoencoders for Online Network Intrusion Detection. In Network and Distributed System Security Symposium, NDSS."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805964.1805972"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16886"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0285-5"},{"key":"e_1_3_2_1_46_1","volume-title":"McDaniel","author":"Papernot Nicolas","year":"2018","unstructured":"Nicolas Papernot and Patrick D . McDaniel . 2018 . Deep k-Nearest Neighbors : Towards Confident, Interpretable and Robust Deep Learning. CoRR , Vol. abs\/ 1803 .04765 (2018). arxiv: 1803.04765 Nicolas Papernot and Patrick D. McDaniel. 2018. Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learning. CoRR, Vol. abs\/1803.04765 (2018). arxiv: 1803.04765"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.09.012"},{"key":"e_1_3_2_1_48_1","volume-title":"Silva","author":"Pearson Spencer S.","year":"2014","unstructured":"Spencer S. Pearson and Yasin N . Silva . 2014 . Index-Based R-S Similarity Joins. In SISAP. 106--112. Spencer S. Pearson and Yasin N. Silva. 2014. Index-Based R-S Similarity Joins. In SISAP. 106--112."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/16564.16608"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66937"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Zeyuan Shang Yaxiao Liu Guoliang Li and Jianhua Feng. 2017. K-Join: Knowledge-Aware Similarity Join. In ICDE. 23--24.  Zeyuan Shang Yaxiao Liu Guoliang Li and Jianhua Feng. 2017. K-Join: Knowledge-Aware Similarity Join. In ICDE. 23--24.","DOI":"10.1109\/ICDE.2017.18"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Rani Siromoney and K. G. Subramanian. 1983. Space-filling curves and infinite graphs. In Graph-Grammars and Their Application to Computer Science Hartmut Ehrig Manfred Nagl and Grzegorz Rozenberg (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 380--391.   Rani Siromoney and K. G. Subramanian. 1983. Space-filling curves and infinite graphs. In Graph-Grammars and Their Application to Computer Science Hartmut Ehrig Manfred Nagl and Grzegorz Rozenberg (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 380--391.","DOI":"10.1007\/BFb0000120"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2809695.2809718"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487625"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000825"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2638838"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915247"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319859","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3319859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:16Z","timestamp":1750208536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3319859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":58,"alternative-id":["10.1145\/3299869.3319859","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3319859","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}