| GPS: a graph processing system S Salihoglu, J Widom Stanford InfoLab, 2012 | 761 | 2012 |
| The future is big graphs: a community view on graph processing systems S Sakr, A Bonifati, H Voigt, A Iosup, K Ammar, R Angles, W Aref, M Arenas, ... Communications of the ACM 64 (9), 62-71, 2021 | 275 | 2021 |
| The ubiquity of large graphs and surprising challenges of graph processing S Sahu, A Mhedhbi, S Salihoglu, J Lin, MT Özsu Proceedings of the VLDB Endowment 11 (4), 420-431, 2017 | 264 | 2017 |
| Optimizing subgraph queries by combining binary and worst-case optimal joins A Mhedhbi, S Salihoglu Proceedings of the VLDB Endowment 12 (11), 2019 | 210 | 2019 |
| The ubiquity of large graphs and surprising challenges of graph processing: extended survey S Sahu, A Mhedhbi, S Salihoglu, J Lin, MT Özsu The VLDB Journal 29 (2), 595-618, 2020 | 193 | 2020 |
| Upper and Lower Bounds on the Cost of a Map-Reduce Computation FN Afrati, AD Sarma, S Salihoglu, JD Ullman Proceedings of the VLDB Endowment, 6 (4), 277--288, 2012 | 193 | 2012 |
| Graphflow: An active graph database C Kankanamge, S Sahu, A Mhedbhi, J Chen, S Salihoglu Proceedings of the 2017 ACM International Conference on Management of Data …, 2017 | 190 | 2017 |
| Optimizing graph algorithms on pregel-like systems S Salihoglu, J Widom Stanford InfoLab, 2014 | 169 | 2014 |
| Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows K Ammar, F McSherry, S Salihoglu, M Joglekar arXiv preprint arXiv:1802.03760, 2018 | 149 | 2018 |
| GYM: A multiround join algorithm in mapreduce F Afrati, M Joglekar, C Ré, S Salihoglu, JD Ullman Proceedings of the International Conference on Database Theory 2017, 2014 | 88* | 2014 |
| Simplifying scalable graph processing with a domain-specific language S Hong, S Salihoglu, J Widom, K Olukotun Proceedings of Annual IEEE/ACM International Symposium on Code Generation …, 2014 | 86 | 2014 |
| Kùzu Graph Database Management System X Feng, G Jin, Z Chen, C Liu, S Salihoğlu Conference on Innovative Data Systems Research, 2023 | 78 | 2023 |
| Optimizing one-time and continuous subgraph queries using worst-case optimal joins A Mhedhbi, C Kankanamge, S Salihoglu ACM Transactions on Database Systems (TODS) 46 (2), 1-45, 2021 | 54 | 2021 |
| Algorithmic aspects of parallel data processing P Koutris, S Salihoglu, D Suciu Foundations and Trends in Databases 8 (4), 239-370, 2018 | 47* | 2018 |
| Provenance-based debugging and drill-down in data-oriented workflows R Ikeda, J Cho, C Fang, S Salihoglu, S Torikai, J Widom 2012 IEEE 28th International Conference on Data Engineering, 1249-1252, 2012 | 46 | 2012 |
| Columnar storage and list-based processing for graph database management systems P Gupta, A Mhedhbi, S Salihoglu arXiv preprint arXiv:2103.02284, 2021 | 44* | 2021 |
| Provenance-based refresh in data-oriented workflows R Ikeda, S Salihoglu, J Widom Proceedings of the 20th ACM international conference on Information and …, 2011 | 40 | 2011 |
| Accurate summary-based cardinality estimation through the lens of cardinality estimation graphs J Chen, Y Huang, M Wang, S Salihoglu, K Salem ACM SIGMOD Record 52 (1), 94-102, 2023 | 35 | 2023 |
| HelP: High-level primitives for large-scale graph processing S Salihoglu, J Widom Proceedings of Workshop on Graph Data Management Experiences and Systems …, 2014 | 32 | 2014 |
| Vision paper: towards an understanding of the limits of map-reduce computation FN Afrati, AD Sarma, S Salihoglu, JD Ullman arXiv preprint arXiv:1204.1754, 2012 | 32 | 2012 |
Jennifer WidomProfessor of Computer Science, Stanford UniversityVerified email at cs.stanford.edu
