{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T21:09:16Z","timestamp":1730322556892,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3398682.3399162","type":"proceedings-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T19:25:57Z","timestamp":1591730757000},"page":"1-11","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["EdgeFrame"],"prefix":"10.1145","author":[{"given":"Per","family":"Fuchs","sequence":"first","affiliation":[{"name":"Technische Universit\u00e3t M\u00fcnchen, M\u00fcnchen, Germany"}]},{"given":"Peter","family":"Boncz","sequence":"additional","affiliation":[{"name":"CWI, Amsterdam, the Netherlands"}]},{"given":"Bogdan","family":"Ghit","sequence":"additional","affiliation":[{"name":"Databricks Inc., Amsterdam, the Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. RelationalAI. https:\/\/www.relational.ai. [n.d.]. RelationalAI. https:\/\/www.relational.ai."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2018.06.005"},{"key":"e_1_3_2_1_3_1","first-page":"1282","article-title":"Optimizing Multiway Joins in a Map-Reduce Environment","volume":"23","author":"Afrati Foto N","year":"2011","unstructured":"Foto N Afrati and Jeffrey D Ullman . 2011 . Optimizing Multiway Joins in a Map-Reduce Environment . IEEE TKDE 23 , 9 (2011), 1282 -- 1298 . Foto N Afrati and Jeffrey D Ullman. 2011. Optimizing Multiway Joins in a Map-Reduce Environment. IEEE TKDE 23, 9 (2011), 1282--1298.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_4_1","unstructured":"Sameer Agarwal Davies Liu and Reynold Xin. 2016. Apache Spark as a Compiler: Joining a Billion Rows per Second on a Laptop Deep Dive into the New Tungsten Execution Engine. https:\/\/databricks.com\/blog\/2016\/05\/23\/apache-spark-as-a-compiler-joining-a-billion-rows-per-second-on-a-laptop.html Sameer Agarwal Davies Liu and Reynold Xin. 2016. Apache Spark as a Compiler: Joining a Billion Rows per Second on a Laptop Deep Dive into the New Tungsten Execution Engine. https:\/\/databricks.com\/blog\/2016\/05\/23\/apache-spark-as-a-compiler-joining-a-billion-rows-per-second-on-a-laptop.html"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3184470.3184473"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Renzo Angles Marcelo Arenas Pablo Barcelo Peter Boncz George Fletcher Claudio Gutierrez Tobias Lindaaker Marcus Paradies Stefan Plantikow Juan Sequeda etal 2018. G-CORE: A Core for Future Graph Query Languages. ACM SIGMOD (2018). Renzo Angles Marcelo Arenas Pablo Barcelo Peter Boncz George Fletcher Claudio Gutierrez Tobias Lindaaker Marcus Paradies Stefan Plantikow Juan Sequeda et al. 2018. G-CORE: A Core for Future Graph Query Languages. ACM SIGMOD (2018).","DOI":"10.1145\/3183713.3190654"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"volume-title":"Todd J Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L Veldhuizen, and Geoffrey Washburn.","year":"2015","author":"Aref Molham","key":"e_1_3_2_1_8_1","unstructured":"Molham Aref , Balder ten Cate , Todd J Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L Veldhuizen, and Geoffrey Washburn. 2015 . Design and Implementation of the LogicBlox System. ACM SIGMOD ( 2015). Molham Aref, Balder ten Cate, Todd J Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L Veldhuizen, and Geoffrey Washburn. 2015. Design and Implementation of the LogicBlox System. ACM SIGMOD (2015)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Michael Armbrust Reynold S Xin Cheng Lian Yin Huai Davies Liu Joseph K Bradley Xiangrui Meng Tomer Kaftan Michael J Franklin Ali Ghodsi etal 2015. Spark SQL: Relational data Processing in Spark. ACM SIGMOD (2015). Michael Armbrust Reynold S Xin Cheng Lian Yin Huai Davies Liu Joseph K Bradley Xiangrui Meng Tomer Kaftan Michael J Franklin Ali Ghodsi et al. 2015. Spark SQL: Relational data Processing in Spark. ACM SIGMOD (2015).","DOI":"10.1145\/2723372.2742797"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"volume-title":"Skew in Parallel Query Processing. ACM Symp. on Principles of Database Systems","year":"2014","author":"Beame Paul","key":"e_1_3_2_1_11_1","unstructured":"Paul Beame , Paraschos Koutris , and Dan Suciu . 2014 . Skew in Parallel Query Processing. ACM Symp. on Principles of Database Systems (2014). Paul Beame, Paraschos Koutris, and Dan Suciu. 2014. Skew in Parallel Query Processing. ACM Symp. on Principles of Database Systems (2014)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Arezo Bodaghi and Babak Teimourpour. 2018. Automobile Insurance Fraud Detection Using Social Network Analysis. Arezo Bodaghi and Babak Teimourpour. 2018. Automobile Insurance Fraud Detection Using Social Network Analysis.","DOI":"10.1007\/978-3-319-95810-1_2"},{"volume-title":"From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System. ACM SIGMOD","year":"2015","author":"Chu Shumo","key":"e_1_3_2_1_13_1","unstructured":"Shumo Chu , Magdalena Balazinska , and Dan Suciu . 2015. From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System. ACM SIGMOD ( 2015 ). Shumo Chu, Magdalena Balazinska, and Dan Suciu. 2015. From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System. ACM SIGMOD (2015)."},{"key":"e_1_3_2_1_14_1","unstructured":"Ankur Dave Joseph Bradley Tim Hunter and Xiangrui Meng. 2016. GraphFrame. https:\/\/databricks.com\/blog\/2016\/03\/03\/introducing-graphframes.html Ankur Dave Joseph Bradley Tim Hunter and Xiangrui Meng. 2016. GraphFrame. https:\/\/databricks.com\/blog\/2016\/03\/03\/introducing-graphframes.html"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.989932"},{"key":"e_1_3_2_1_16_1","unstructured":"Per Fuchs. [n.d.]. EdgeFrames. https:\/\/github.com\/cwida\/edge-frames. Per Fuchs. [n.d.]. EdgeFrames. https:\/\/github.com\/cwida\/edge-frames."},{"key":"e_1_3_2_1_17_1","unstructured":"Per Fuchs. 2019. Fast scalable worst-case optimal joins for graph-pattern matching on in-memory graphs in Spark. Per Fuchs. 2019. Fast scalable worst-case optimal joins for graph-pattern matching on in-memory graphs in Spark."},{"volume-title":"GraphX: Graph Processing in a Distributed Dataflow Framework. USENIX ODSI","year":"2014","author":"Gonzalez Joseph E","key":"e_1_3_2_1_18_1","unstructured":"Joseph E Gonzalez , Reynold S Xin , Ankur Dave , Daniel Crankshaw , Michael J Franklin , and Ion Stoica . 2014. GraphX: Graph Processing in a Distributed Dataflow Framework. USENIX ODSI ( 2014 ). Joseph E Gonzalez, Reynold S Xin, Ankur Dave, Daniel Crankshaw, Michael J Franklin, and Ion Stoica. 2014. GraphX: Graph Processing in a Distributed Dataflow Framework. USENIX ODSI (2014)."},{"key":"e_1_3_2_1_19_1","unstructured":"CWI Research Group. [n.d.]. Scilens Cluster. https:\/\/projects.cwi.nl\/scilens\/. CWI Research Group. [n.d.]. Scilens Cluster. https:\/\/projects.cwi.nl\/scilens\/."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733010"},{"volume-title":"Survey of Graph Analysis Applications. arXiv:1807.00382","year":"2018","author":"Hegeman Tim","key":"e_1_3_2_1_21_1","unstructured":"Tim Hegeman and Alexandru Iosup . 2018. Survey of Graph Analysis Applications. arXiv:1807.00382 ( 2018 ). Tim Hegeman and Alexandru Iosup. 2018. Survey of Graph Analysis Applications. arXiv:1807.00382 (2018)."},{"key":"e_1_3_2_1_22_1","unstructured":"Hyeonji Kim Juneyoung Lee Sourav S Bhowmick Wook-Shin Han JeongHoon Lee Seongyun Ko and Moath HA Jarrah. 2016. DUAL-SIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine. In SIGMOD. ACM 1231--1245. Hyeonji Kim Juneyoung Lee Sourav S Bhowmick Wook-Shin Han JeongHoon Lee Seongyun Ko and Moath HA Jarrah. 2016. DUAL-SIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine. In SIGMOD. ACM 1231--1245."},{"volume-title":"Worst-case Optimal Algorithms for Parallel Query Processing. Int'l Conf. on Database Theory (ICDT)","year":"2016","author":"Koutris Paraschos","key":"e_1_3_2_1_23_1","unstructured":"Paraschos Koutris , Paul Beame , and Dan Suciu . 2016. Worst-case Optimal Algorithms for Parallel Query Processing. Int'l Conf. on Database Theory (ICDT) ( 2016 ). Paraschos Koutris, Paul Beame, and Dan Suciu. 2016. Worst-case Optimal Algorithms for Parallel Query Processing. Int'l Conf. on Database Theory (ICDT) (2016)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_3_2_1_25_1","unstructured":"LDBC.2017. LDBC SNB Documentation. https:\/\/github.com\/ldbc\/ldbc_snb_docs LDBC.2017. LDBC SNB Documentation. https:\/\/github.com\/ldbc\/ldbc_snb_docs"},{"key":"e_1_3_2_1_26_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"volume-title":"James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski.","year":"2010","author":"Malewicz Grzegorz","key":"e_1_3_2_1_27_1","unstructured":"Grzegorz Malewicz , Matthew H Austern , Aart JC Bik , James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010 . Pregel : A System for Large-Scale Graph Processing. ACM SIGMOD ( 2010), 135--146. Grzegorz Malewicz, Matthew H Austern, Aart JC Bik, James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: A System for Large-Scale Graph Processing. ACM SIGMOD (2010), 135--146."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"volume-title":"Efficiently Compiling Efficient Query Plans for Modern Hardware. VLDB","year":"2011","author":"Neumann Thomas","key":"e_1_3_2_1_29_1","unstructured":"Thomas Neumann . 2011. Efficiently Compiling Efficient Query Plans for Modern Hardware. VLDB ( 2011 ). Thomas Neumann. 2011. Efficiently Compiling Efficient Query Plans for Modern Hardware. VLDB (2011)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00124-y"},{"volume-title":"Worst-Case Optimal Join Algorithms. ACM Symposium on Principles of Database Systems","year":"2012","author":"Ngo Hung Q","key":"e_1_3_2_1_31_1","unstructured":"Hung Q Ngo , Ely Porat , Christopher R\u00e9 , and Atri Rudra . 2012 . Worst-Case Optimal Join Algorithms. ACM Symposium on Principles of Database Systems (2012). Hung Q Ngo, Ely Porat, Christopher R\u00e9, and Atri Rudra. 2012. Worst-Case Optimal Join Algorithms. ACM Symposium on Principles of Database Systems (2012)."},{"volume-title":"Skew Strikes Back: New Developments in the Theory of Join Algorithms. arXiv preprint arXiv:1310.3314","year":"2013","author":"Ngo Hung Q","key":"e_1_3_2_1_32_1","unstructured":"Hung Q Ngo , Christopher R\u00e9 , and Atri Rudra . 2013. Skew Strikes Back: New Developments in the Theory of Join Algorithms. arXiv preprint arXiv:1310.3314 ( 2013 ). Hung Q Ngo, Christopher R\u00e9, and Atri Rudra. 2013. Skew Strikes Back: New Developments in the Theory of Join Algorithms. arXiv preprint arXiv:1310.3314 (2013)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764947.2764948"},{"volume-title":"CAPS: Cypher for Apache Spark. https:\/\/github.com\/opencypher\/cypher-for-apache-spark","year":"2016","author":"Project Cypher","key":"e_1_3_2_1_35_1","unstructured":"open Cypher Project . 2016 . CAPS: Cypher for Apache Spark. https:\/\/github.com\/opencypher\/cypher-for-apache-spark openCypher Project. 2016. CAPS: Cypher for Apache Spark. https:\/\/github.com\/opencypher\/cypher-for-apache-spark"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"volume-title":"Fraud Detection: Discovering Connections with Graph Databases. White Paper-Neo Technology-Graphs are Everywhere","year":"2014","author":"Sadowski Gorka","key":"e_1_3_2_1_37_1","unstructured":"Gorka Sadowski and Philip Rathle . 2014 . Fraud Detection: Discovering Connections with Graph Databases. White Paper-Neo Technology-Graphs are Everywhere (2014). Gorka Sadowski and Philip Rathle. 2014. Fraud Detection: Discovering Connections with Graph Databases. White Paper-Neo Technology-Graphs are Everywhere (2014)."},{"volume-title":"The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing: Extended Survey. VLDB Journal","year":"2019","author":"Sahu Siddhartha","key":"e_1_3_2_1_38_1","unstructured":"Siddhartha Sahu , Amine Mhedhbi , Semih Salihoglu , Jimmy Lin , and M Tamer \u00d6zsu . 2019. The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing: Extended Survey. VLDB Journal ( 2019 ), 1--24. Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, and M Tamer \u00d6zsu. 2019. The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing: Extended Survey. VLDB Journal (2019), 1--24."},{"key":"e_1_3_2_1_39_1","unstructured":"Christian Schroeder dewitt. 2012. Leapfrog Triejoin Implementation for 'Database Systems and Implementation' at Oxford University. https:\/\/github.com\/schroeder-dewitt\/leapfrog-triejoin Christian Schroeder dewitt. 2012. Leapfrog Triejoin Implementation for 'Database Systems and Implementation' at Oxford University. https:\/\/github.com\/schroeder-dewitt\/leapfrog-triejoin"},{"volume-title":"Leapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm. arXiv preprint arXiv:1210.0481","year":"2012","author":"Veldhuizen Todd L","key":"e_1_3_2_1_40_1","unstructured":"Todd L Veldhuizen . 2012 . Leapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm. arXiv preprint arXiv:1210.0481 (2012). Todd L Veldhuizen. 2012. Leapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm. arXiv preprint arXiv:1210.0481 (2012)."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3398682.3399162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T16:29:43Z","timestamp":1673195383000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398682.3399162"}},"subtitle":["Worst-Case Optimal Joins for Graph-Pattern Matching in Spark"],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":40,"alternative-id":["10.1145\/3398682.3399162","10.1145\/3398682"],"URL":"http:\/\/dx.doi.org\/10.1145\/3398682.3399162","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
