- Rustam Azimov, Ilya Epelbaum
, Semyon V. Grigorev:
Context-free path querying with all-path semantics by matrix multiplication. GRADES-NDA@SIGMOD 2021: 4:1-4:7 - Angela Bonifati:
Graph processing systems back to the future. GRADES-NDA@SIGMOD 2021: 1:1 - Jonas Dann, Daniel Ritter, Holger Fröning:
Demystifying memory access patterns of FPGA-based graph processing accelerators. GRADES-NDA@SIGMOD 2021: 3:1-3:10 - Florentin Dörre, Alexander Krause, Dirk Habich, Martin Junghanns:
A GraphBLAS implementation in pure Java. GRADES-NDA@SIGMOD 2021: 5:1-5:9 - Heiko Geppert, Sukanya Bhowmik, Kurt Rothermel:
Large-scale influence maximization with the influence maximization benchmarker suite. GRADES-NDA@SIGMOD 2021: 6:1-6:11 - Hassan Halawa, Matei Ripeanu:
Position paper: bitemporal dynamic graph analytics. GRADES-NDA@SIGMOD 2021: 7:1-7:12 - Amine Mhedhbi, Matteo Lissandrini, Laurens Kuiper, Jack Waudby, Gábor Szárnyas:
LSQB: a large-scale subgraph query benchmark. GRADES-NDA@SIGMOD 2021: 8:1-8:11 - Samuel V. Scarpino:
Networked data and COVID-19. GRADES-NDA@SIGMOD 2021: 2:1-2:2 - Vasiliki Kalavri, Nikolay Yakovets:
GRADES-NDA '21: Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Virtual Event, China, 20 June 2021. ACM 2021, ISBN 978-1-4503-8477-3 [contents] - 2020
- Xiaofei Zhang, M. Tamer Özsu, Lei Chen:
ELite: Cost-effective Approximation of Exploration-based Graph Analysis. GRADES-NDA@SIGMOD 2020: 6:1-6:10 - Vaastav Anand, Puneet Mehrotra, Daniel W. Margo, Margo I. Seltzer:
Smooth Kronecker: Solving the Combing Problem in Kronecker Graphs. GRADES-NDA@SIGMOD 2020: 3:1-3:10 - Eliav Buchnik, Edith Cohen:
Graph Learning with Loss-Guided Training. GRADES-NDA@SIGMOD 2020: 7:1-7:13 - Laxman Dhulipala, Jessica Shi, Tom Tseng, Guy E. Blelloch, Julian Shun:
The Graph Based Benchmark Suite (GBBS). GRADES-NDA@SIGMOD 2020: 11:1-11:8 - Per Fuchs, Peter A. Boncz, Bogdan Ghit:
EdgeFrame: Worst-Case Optimal Joins for Graph-Pattern Matching in Spark. GRADES-NDA@SIGMOD 2020: 4:1-4:11 - Katja Hose:
The Web of Data is partially unavailable, so what?: Extended Abstract. GRADES-NDA@SIGMOD 2020: 2:1 - Tahsin Reza, Matei Ripeanu, Geoffrey Sanders, Roger Pearce:
Towards Interactive Pattern Search in Massive Graphs. GRADES-NDA@SIGMOD 2020: 9:1-9:6 - Peter K. Schwab, Maximilian S. Langohr, Klaus Meyer-Wegener:
A Framework for DSL-Based Query Classification Using Relational and Graph-Based Data Models. GRADES-NDA@SIGMOD 2020: 10:1-10:5 - Yizhou Sun:
Graph Neural Networks for Graph Search. GRADES-NDA@SIGMOD 2020: 1:1 - Arseniy Terekhov, Artyom Khoroshev, Rustam Azimov, Semyon V. Grigorev:
Context-Free Path Querying with Single-Path Semantics by Matrix Multiplication. GRADES-NDA@SIGMOD 2020: 5:1-5:12 - Jack Waudby, Benjamin A. Steer, Arnau Prat-Pérez, Gábor Szárnyas:
Supporting Dynamic Graphs and Temporal Entity Deletions in the LDBC Social Network Benchmark's Data Generator. GRADES-NDA@SIGMOD 2020: 8:1-8:8 - Akhil Arora, Semih Salihoglu, Nikolay Yakovets:
GRADES-NDA'20: Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Portland, OR, USA, June 14, 2020. ACM 2020, ISBN 978-1-4503-8021-8 [contents] - 2019
- Sourav S. Bhowmick:
We Don't Need No Education: From Building for Coders to Building for Users. GRADES/NDA@SIGMOD/PODS 2019: 2:1 - Brian Cloteaux, Vladimir Marbukh:
SIS Contagion Avoidance on a Network Growing by Preferential Attachment. GRADES/NDA@SIGMOD/PODS 2019: 11:1-11:4 - Tina Eliassi-Rad:
Length Spectrum Theory, Non-backtracking Cycles, and Two Graph Analysis Tasks. GRADES/NDA@SIGMOD/PODS 2019: 1:1 - Olaf Hartig, Jan Hidders:
Defining Schemas for Property Graphs by using the GraphQL Schema Definition Language. GRADES/NDA@SIGMOD/PODS 2019: 6:1-6:11 - Manuel Hotz, Theodoros Chondrogiannis, Leonard Wörteler, Michael Grossniklaus:
Experiences with Implementing Landmark Embedding in Neo4j. GRADES/NDA@SIGMOD/PODS 2019: 7:1-7:9 - Iacovos G. Kolokasis, Polyvios Pratikakis:
Cut to Fit: Tailoring the Partitioning to the Computation. GRADES/NDA@SIGMOD/PODS 2019: 9:1-9:10 - Dean De Leo, Peter A. Boncz:
Fast Concurrent Reads and Updates with PMAs. GRADES/NDA@SIGMOD/PODS 2019: 8:1-8:8 - Nikita Mishin, Iaroslav Sokolov, Egor Spirin, Vladimir Kutuev, Egor Nemchinov, Sergey Gorbatyuk, Semyon V. Grigorev:
Evaluation of the Context-Free Path Querying Algorithm Based on Matrix Multiplication. GRADES/NDA@SIGMOD/PODS 2019: 12:1-12:5 - Alberto Parravicini, Rhicheek Patra, Davide B. Bartolini, Marco D. Santambrogio:
Fast and Accurate Entity Linking via Graph Embedding. GRADES/NDA@SIGMOD/PODS 2019: 10:1-10:9
