{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T18:21:13Z","timestamp":1783362073166,"version":"3.54.6"},"reference-count":171,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:00:00Z","timestamp":1777334400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Science Review"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.cosrev.2026.100981","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T10:41:29Z","timestamp":1776076889000},"page":"100981","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Data analytics algorithms in property graph databases: A survey"],"prefix":"10.1016","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0268-4840","authenticated-orcid":false,"given":"Francesco","family":"Cambria","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Invernici","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Bernasconi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Ceri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cosrev.2026.100981_bib0005","series-title":"Graph Data Management","author":"Fletcher","year":"2018"},{"issue":"1987","key":"10.1016\/j.cosrev.2026.100981_bib0010","doi-asserted-by":"crossref","DOI":"10.1098\/rsta.2012.0375","article-title":"Network science","volume":"371","author":"Barab\u00e1si","year":"2013","journal-title":"Philos. Trans. R. Soc. A: Mathematical, Physical and Engineering Sciences"},{"key":"10.1016\/j.cosrev.2026.100981_bib0015","series-title":"2019 6th International Conference on Soft Computing & Machine Intelligence (ISCMI)","first-page":"155","article-title":"Using Twitter mentions and a graph database to analyse social network centrality","author":"Lutu","year":"2019"},{"key":"10.1016\/j.cosrev.2026.100981_bib0020","doi-asserted-by":"crossref","unstructured":"S. Tim\u00f3n-Reina, M. Rinc\u00f3n, R. Mart\u00ednez-Tom\u00e1s, An overview of graph databases and their applications in the biomedical domain, Database 2021, baab026.","DOI":"10.1093\/database\/baab026"},{"issue":"6","key":"10.1016\/j.cosrev.2026.100981_bib0025","doi-asserted-by":"crossref","DOI":"10.1093\/bib\/bbae561","article-title":"Graph databases in systems biology: a systematic review","volume":"25","author":"Mazein","year":"2024","journal-title":"Brief. Bioinform."},{"key":"10.1016\/j.cosrev.2026.100981_bib0030","doi-asserted-by":"crossref","DOI":"10.2196\/52655","article-title":"Searching Covid-19 clinical research using graph queries: algorithm development and validation","volume":"26","author":"Invernici","year":"2024","journal-title":"J. Med. Internet Res."},{"key":"10.1016\/j.cosrev.2026.100981_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.datak.2022.102073","article-title":"Reasoning on company takeovers: from tactic to strategy","volume":"141","author":"Bellomarini","year":"2022","journal-title":"Data Knowl. Eng."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104082","article-title":"An llm-assisted etl pipeline to build a high-quality knowledge graph of the Italian legislation","volume":"62","author":"Colombo","year":"2025","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.cosrev.2026.100981_bib0045","series-title":"Proceedings of the Workshops of the EDBT\/ICDT 2025 Joint Conferenceco-Located with the EDBT\/ICDT 2025 Joint Conference","first-page":"1","article-title":"Legislative knowledge management with property graphs","volume":"vol. 3946","author":"Colombo","year":"2025"},{"key":"10.1016\/j.cosrev.2026.100981_bib0055","series-title":"Graph Databases: New Opportunities for Connected Data","author":"Robinson","year":"2015"},{"key":"10.1016\/j.cosrev.2026.100981_bib0060","series-title":"AMW","article-title":"The property graph database model","author":"Angles","year":"2018"},{"key":"10.1016\/j.cosrev.2026.100981_bib0065","series-title":"Concise Survey of Computer Methods","author":"Naur","year":"1974"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0070","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1089\/big.2013.1508","article-title":"Data science and its relationship to big data and data-driven decision making","volume":"1","author":"Provost","year":"2013","journal-title":"Big data"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0075","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1080\/10618600.2017.1384734","article-title":"50 years of data science","volume":"26","author":"Donoho","year":"2017","journal-title":"J. Comput. Graph. Stat."},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0080","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3076253","article-title":"Data science: a comprehensive overview","volume":"50","author":"Cao","year":"2017","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0085","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/3712311.3712323","article-title":"A roadmap to graph analytics","volume":"53","author":"Bonifati","year":"2025","journal-title":"ACM SIGMOD Rec."},{"key":"10.1016\/j.cosrev.2026.100981_bib0090","series-title":"Exploring Network Structure, Dynamics, and Function Using Networkx","author":"Hagberg","year":"2008"},{"key":"10.1016\/j.cosrev.2026.100981_bib0095","series-title":"11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)","first-page":"599","article-title":"{GraphX}: graph processing in a distributed dataflow framework","author":"Gonzalez","year":"2014"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2898361","article-title":"Snap: a general-purpose network analysis and graph-mining library","volume":"8","author":"Leskovec","year":"2016","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"10.1016\/j.cosrev.2026.100981_bib0105","series-title":"Network Analysis: Methodological Foundations","volume":"vol. 3418","author":"Brandes","year":"2005"},{"issue":"5939","key":"10.1016\/j.cosrev.2026.100981_bib0110","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1126\/science.1171022","article-title":"Revisiting the foundations of network analysis","volume":"325","author":"Butts","year":"2009","journal-title":"Science"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0115","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/21642850.2018.1521283","article-title":"Network analysis: a brief overview and tutorial","volume":"6","author":"Hevey","year":"2018","journal-title":"Health psychology and behavioral medicine"},{"issue":"5916","key":"10.1016\/j.cosrev.2026.100981_bib0120","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1126\/science.1165821","article-title":"Network analysis in the social sciences","volume":"323","author":"Borgatti","year":"2009","journal-title":"Science"},{"key":"10.1016\/j.cosrev.2026.100981_bib0125","series-title":"What is Social Network Analysis?","author":"Scott","year":"2012"},{"key":"10.1016\/j.cosrev.2026.100981_bib0130","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1756-0381-4-10","article-title":"Using graph theory to analyze biological networks","volume":"4","author":"Pavlopoulos","year":"2011","journal-title":"Biodata Min."},{"key":"10.1016\/j.cosrev.2026.100981_bib0135","doi-asserted-by":"crossref","first-page":"34","DOI":"10.3389\/fbioe.2020.00034","article-title":"A guide to conquer the biological network era using graph theory","volume":"8","author":"Koutrouli","year":"2020","journal-title":"Front. Bioeng. Biotechnol."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0140","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1186\/s13040-025-00442-z","article-title":"Network-based multi-omics integrative analysis methods in drug discovery: a systematic review","volume":"18","author":"Jiang","year":"2025","journal-title":"Biodata Min."},{"key":"10.1016\/j.cosrev.2026.100981_bib0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.dss.2020.113303","article-title":"Fraud detection: a systematic literature review of graph-based anomaly detection approaches","volume":"133","author":"Pourhabibi","year":"2020","journal-title":"Decis. Support Syst."},{"key":"10.1016\/j.cosrev.2026.100981_bib0150","series-title":"Enabling AI Applications in Data Science","first-page":"517","article-title":"Fraud detection in networks","author":"Irofti","year":"2020"},{"key":"10.1016\/j.cosrev.2026.100981_bib0155","first-page":"1","article-title":"Network analytics for anti-money laundering\u2014a systematic literature review and experimental evaluation","author":"Deprez","year":"2025","journal-title":"INFORMS J. Data Sci."},{"key":"10.1016\/j.cosrev.2026.100981_bib0160","series-title":"2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS)","first-page":"371","article-title":"Complex network analysis of public transportation networks: a comprehensive study","author":"H\u00e1znagy","year":"2015"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0165","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1007\/s11116-023-10451-8","article-title":"Mobility knowledge graph: review and its application in public transport","volume":"52","author":"Zhang","year":"2025","journal-title":"Transportation"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0170","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3199523","article-title":"Scalable graph processing frameworks: a taxonomy and open challenges","volume":"51","author":"Heidari","year":"2018","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0175","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3694966","article-title":"A survey of distributed graph algorithms on massive graphs","volume":"57","author":"Meng","year":"2024","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0180","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1186\/s40537-021-00443-9","article-title":"An analysis of the graph processing landscape","volume":"8","author":"Coimbra","year":"2021","journal-title":"J. Big Data"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0185","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TPDS.2015.2407900","article-title":"A survey of task allocation and load balancing in distributed systems","volume":"27","author":"Jiang","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0190","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1322432.1322433","article-title":"Survey of graph database models","volume":"40","author":"Angles","year":"2008","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"10.1016\/j.cosrev.2026.100981_bib0195","series-title":"2012 IEEE 28th International Conference on Data Engineering Workshops","first-page":"171","article-title":"A comparison of current graph database models","author":"Angles","year":"2012"},{"issue":"5","key":"10.1016\/j.cosrev.2026.100981_bib0200","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3104031","article-title":"Foundations of modern query languages for graph databases","volume":"50","author":"Angles","year":"2017","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"12","key":"10.1016\/j.cosrev.2026.100981_bib0205","doi-asserted-by":"crossref","first-page":"5477","DOI":"10.14778\/3750601.3750698","article-title":"Property graph standards: state of the art & open challenges","volume":"18","author":"Kondylakis","year":"2025","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3379445","article-title":"Graph generators: state of the art and open challenges","volume":"53","author":"Bonifati","year":"2020","journal-title":"ACM computing surveys (CSUR)"},{"key":"10.1016\/j.cosrev.2026.100981_bib0215","series-title":"Querying Graphs","author":"Bonifati","year":"2018"},{"key":"10.1016\/j.cosrev.2026.100981_bib0220","series-title":"International Conference on Software Process Improvement","first-page":"180","article-title":"A review of graph databases","author":"Lopez-Veyna","year":"2022"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0225","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3604932","article-title":"Demystifying graph databases: analysis and taxonomy of data organization, system designs, and graph queries","volume":"56","author":"Besta","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.cosrev.2026.100981_bib0230","series-title":"Introduction to Graph Theory","volume":"vol. 2","author":"West","year":"2001"},{"key":"10.1016\/j.cosrev.2026.100981_bib0235","series-title":"Proceedings of the 2022 International Conference on Management of Data","first-page":"2246","article-title":"Graph pattern matching in gql and sql\/pgq","author":"Deutsch","year":"2022"},{"key":"10.1016\/j.cosrev.2026.100981_bib0240","author":"Secretary"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0245","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3589778","article-title":"Pg-schema: schemas for property graphs","volume":"1","author":"Angles","year":"2023","journal-title":"Proc. ACM Manag. Data"},{"key":"10.1016\/j.cosrev.2026.100981_bib0250","series-title":"Proceedings of the 2021 International Conference on Management of Data","first-page":"2423","article-title":"Pg-keys: keys for property graphs","author":"Angles","year":"2021"},{"key":"10.1016\/j.cosrev.2026.100981_bib0255","series-title":"2024 IEEE 40th International Conference on Data Engineering (ICDE)","first-page":"5574","article-title":"Reactive knowledge management","author":"Ceri","year":"2024"},{"key":"10.1016\/j.cosrev.2026.100981_bib0260","series-title":"Companion of the 2024 International Conference on Management of Data, SIGMOD\/PODS \u201924, Association for Computing Machinery","first-page":"373","article-title":"PG-triggers: triggers for property graphs","author":"Ceri","year":"2024"},{"key":"10.1016\/j.cosrev.2026.100981_bib0265","series-title":"2025 IEEE 41st International Conference on Data Engineering (ICDE)","first-page":"4277","article-title":"Enabling light-weight reasoning via cypher triggers","author":"Magnanimi","year":"2025"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0270","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00778-025-00934-8","article-title":"Mine graph rule: a new gql operator for mining association rules in property graph databases","volume":"34","author":"Cambria","year":"2025","journal-title":"VLDB J."},{"key":"10.1016\/j.cosrev.2026.100981_bib0275","unstructured":"World Wide Web Consortium, et al. RDF 1.1 primer, World Wide Web Consortium, 2014."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0280","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0169-023X(98)00013-5","article-title":"A general formal framework for schema transformation","volume":"28","author":"Poulovassilis","year":"1998","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.cosrev.2026.100981_bib0285","first-page":"17","article-title":"On the evolution of random graphs, publ","volume":"5","author":"Erd6s","year":"1960","journal-title":"Math. Inst. Hungar. Acad. Sci"},{"issue":"6684","key":"10.1016\/j.cosrev.2026.100981_bib0290","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"10.1016\/j.cosrev.2026.100981_bib0295","series-title":"Technology Conference on Performance Evaluation and Benchmarking","first-page":"25","article-title":"A discussion on the design of graph database benchmarks","author":"Dominguez-Sal","year":"2010"},{"key":"10.1016\/j.cosrev.2026.100981_bib0300","series-title":"Network Centrality: an Introduction","first-page":"177","article-title":"A mathematical modeling approach from nonlinear dynamics to complex systems","author":"Rodrigues","year":"2019"},{"key":"10.1016\/j.cosrev.2026.100981_bib0305","author":"Saxena"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0310","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s00355-023-01456-4","article-title":"Centrality measures in networks","volume":"61","author":"Bloch","year":"2023","journal-title":"Social Choice and Welfare"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0315","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.90.032812","article-title":"Role of centrality for the identification of influential spreaders in complex networks","volume":"90","author":"De Arruda","year":"2014","journal-title":"Phys. Rev. E"},{"issue":"7","key":"10.1016\/j.cosrev.2026.100981_bib0320","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0040575","article-title":"Network centrality of metro systems","volume":"7","author":"Derrible","year":"2012","journal-title":"PLOS ONE"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0325","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0330","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","article-title":"Node centrality in weighted networks: generalizing degree and shortest paths","volume":"32","author":"Opsahl","year":"2010","journal-title":"Soc. Netw."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0335","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0378-8733(00)00031-9","article-title":"Eigenvector-centrality\u2014a node-centrality?","volume":"22","author":"Ruhnau","year":"2000","journal-title":"Soc. Netw."},{"issue":"1\u20137","key":"10.1016\/j.cosrev.2026.100981_bib0340","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Computer networks and ISDN systems"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0345","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","article-title":"Towards scaling fully personalized pagerank: algorithms, lower bounds, and experiments","volume":"2","author":"Fogaras","year":"2005","journal-title":"Internet Mathematics"},{"key":"10.1016\/j.cosrev.2026.100981_bib0350","author":"Bahmani"},{"key":"10.1016\/j.cosrev.2026.100981_bib0355","series-title":"Proceedings of the Ninth ACM International Conference on Web Search and Data Mining","first-page":"163","article-title":"Personalized pagerank estimation and search: a bidirectional approach","author":"Lofgren","year":"2016"},{"issue":"5","key":"10.1016\/j.cosrev.2026.100981_bib0360","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","article-title":"Authoritative sources in a hyperlinked environment","volume":"46","author":"Kleinberg","year":"1999","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0365","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","article-title":"Betweenness centrality in large complex networks","volume":"38","author":"Barthelemy","year":"2004","journal-title":"Eur. Phys. J. B"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0370","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","article-title":"A faster algorithm for betweenness centrality","volume":"25","author":"Brandes","year":"2001","journal-title":"J. Math. Sociol."},{"issue":"7","key":"10.1016\/j.cosrev.2026.100981_bib0375","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1142\/S0218127407018403","article-title":"Centrality estimation in large networks","volume":"17","author":"Brandes","year":"2007","journal-title":"Int. J. Bifurc. Chaos"},{"key":"10.1016\/j.cosrev.2026.100981_bib0380","series-title":"Proceedings of the Second ACM Conference on Online Social Networks","first-page":"37","article-title":"Computing classic closeness centrality, at scale","author":"Cohen","year":"2014"},{"key":"10.1016\/j.cosrev.2026.100981_bib0385","series-title":"Social Network Analysis: Methods and Applications","author":"Wasserman","year":"1994"},{"issue":"3\u20134","key":"10.1016\/j.cosrev.2026.100981_bib0390","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","article-title":"Harmony in the small-world, physica a: statistical mechanics and its applications","volume":"285","author":"Marchiori","year":"2000","journal-title":"Physica A"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0395","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"10.1016\/j.cosrev.2026.100981_bib0400","author":"Grinten"},{"key":"10.1016\/j.cosrev.2026.100981_bib0405","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.cosrev.2026.100981_bib0410","series-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"420","article-title":"Cost-effective outbreak detection in networks","author":"Leskovec","year":"2007"},{"issue":"3\u20135","key":"10.1016\/j.cosrev.2026.100981_bib0415","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0420","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","article-title":"A survey of community search over big graphs","volume":"29","author":"Fang","year":"2020","journal-title":"VLDB J."},{"key":"10.1016\/j.cosrev.2026.100981_bib0425","series-title":"Proceedings of the First Workshop on Unsupervised Learning in NLP","first-page":"53","article-title":"Twitter polarity classification with label propagation over lexical links and the follower graph","author":"Speriosu","year":"2011"},{"key":"10.1016\/j.cosrev.2026.100981_bib0430","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.knosys.2013.06.020","article-title":"Twitter user profiling based on text and community mining for market analysis","volume":"51","author":"Ikeda","year":"2013","journal-title":"Knowl.-based Syst."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0435","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(72)90057-X","article-title":"Complements and transitive closures","volume":"2","author":"Graham","year":"1972","journal-title":"Discret. Math."},{"key":"10.1016\/j.cosrev.2026.100981_bib0440","series-title":"2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","first-page":"12","article-title":"Optimizing parallel graph connectivity computation via subgraph sampling","author":"Sutton","year":"2018"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0445","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0450","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(94)90047-7","article-title":"On finding the strongly connected components in a directed graph","volume":"49","author":"Nuutila","year":"1994","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.cosrev.2026.100981_bib0455","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.122058","article-title":"Community detection with the label propagation algorithm: a survey","volume":"534","author":"Garza","year":"2019","journal-title":"Phys. a Stat. Mech. Appl."},{"key":"10.1016\/j.cosrev.2026.100981_bib0460","series-title":"2011 Ieee 11th International Conference on Data Mining Workshops","first-page":"344","article-title":"Slpa: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process","author":"Xie","year":"2011"},{"issue":"6","key":"10.1016\/j.cosrev.2026.100981_bib0465","article-title":"Towards real-time community detection in large networks","volume":"79","author":"Leung","year":"2009","journal-title":"Physical Review E\u2014Statistical, Nonlinear, and Soft Matter Physics"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0470","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0475","doi-asserted-by":"crossref","DOI":"10.1209\/0295-5075\/87\/38002","article-title":"Modularity optimization in community detection of complex networks","volume":"87","author":"Zhang","year":"2009","journal-title":"Europhysics Letters"},{"key":"10.1016\/j.cosrev.2026.100981_bib0480","article-title":"Fast unfolding of communities in large networks","volume":"10","author":"Blondel","year":"2008","journal-title":"Journal of statistical mechanics: theory and experiment 2008"},{"key":"10.1016\/j.cosrev.2026.100981_bib0485","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.parco.2015.03.003","article-title":"Parallel heuristics for scalable community detection","volume":"47","author":"Lu","year":"2015","journal-title":"Parallel Comput."},{"key":"10.1016\/j.cosrev.2026.100981_bib0490","doi-asserted-by":"crossref","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","article-title":"Unsupervised k-means clustering algorithm","volume":"8","author":"Sinaga","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.cosrev.2026.100981_bib0495","series-title":"Encyclopedia of Optimization","first-page":"1991","article-title":"Maximum CUT problem, Max-cut","volume":"vol. 2","author":"Commander","year":"2008"},{"issue":"6","key":"10.1016\/j.cosrev.2026.100981_bib0500","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","article-title":"Randomized heuristics for the max-cut problem","volume":"17","author":"Festa","year":"2002","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0505","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Luxburg","year":"2007","journal-title":"Stat. Comput."},{"issue":"11","key":"10.1016\/j.cosrev.2026.100981_bib0510","doi-asserted-by":"crossref","first-page":"6435","DOI":"10.1007\/s00521-018-3836-z","article-title":"Mutual KNN based spectral clustering","volume":"32","author":"Tan","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.cosrev.2026.100981_bib0515","series-title":"Proceedings of the 2021 International Conference on Management of Data","first-page":"2829","article-title":"Cohesive subgraph search over big heterogeneous information networks: applications, challenges, and solutions","author":"Fang","year":"2021"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0520","doi-asserted-by":"crossref","first-page":"85","DOI":"10.14778\/2535568.2448942","article-title":"Large scale cohesive subgraphs discovery for social network visual analysis","volume":"6","author":"Zhao","year":"2012","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.cosrev.2026.100981_bib0525","series-title":"European Conference on Information Retrieval","first-page":"382","article-title":"Main core retention on graph-of-words for single-document keyword extraction","author":"Rousseau","year":"2015"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0530","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","article-title":"Network structure and minimum degree","volume":"5","author":"Seidman","year":"1983","journal-title":"Soc. Netw."},{"key":"10.1016\/j.cosrev.2026.100981_bib0535","series-title":"2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","first-page":"1482","article-title":"Parallel k-core decomposition on multicore platforms","author":"Kabir","year":"2017"},{"key":"10.1016\/j.cosrev.2026.100981_bib0540","series-title":"2018 IEEE International Conference on Big Data (Big Data)","first-page":"1134","article-title":"Scalable k-core decomposition for static graphs using a dynamic graph data structure","author":"Tripathy","year":"2018"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0545","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"10.1016\/j.cosrev.2026.100981_bib0550","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0190(00)00051-X","article-title":"Path-based depth-rst search for strong and biconnected components","volume":"74","author":"Gabow","year":"2000","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0555","doi-asserted-by":"crossref","first-page":"87","DOI":"10.15803\/ijnc.6.1_87","article-title":"Efficient multicore algorithms for identifying biconnected components","volume":"6","author":"Chaitanya","year":"2016","journal-title":"International Journal of Networking and Computing"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0560","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/opre.38.1.15","article-title":"Decision support system for the school districting problem","volume":"38","author":"Ferland","year":"1990","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0565","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1080\/13658816.2018.1525493","article-title":"Designing efficient and balanced police patrol districts on an urban street network","volume":"33","author":"Chen","year":"2019","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"10.1016\/j.cosrev.2026.100981_bib0570","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104850","article-title":"A systematic study on meta-heuristic approaches for solving the graph coloring problem","volume":"120","author":"Mostafaie","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"10\u201311","key":"10.1016\/j.cosrev.2026.100981_bib0575","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.parco.2012.07.001","article-title":"Graph coloring algorithms for multi-core and massively multithreaded architectures","volume":"38","author":"\u00c7ataly\u00fcrek","year":"2012","journal-title":"Parallel Comput."},{"key":"10.1016\/j.cosrev.2026.100981_bib0580","series-title":"Agent and Multi-Agent Systems: Technologies and Applications: 5th KES International Conference, KES-AMSTA 2011","first-page":"553","article-title":"Graph coloring with a distributed hybrid quantum annealing algorithm","author":"Titiloye","year":"2011"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0585","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.cosrev.2026.100981_bib0590","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1016747704458","article-title":"Finding a maximal weighted independent set in wireless networks","volume":"18","author":"Basagni","year":"2001","journal-title":"Telecommun. Syst."},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0595","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1002\/rsa.21200","article-title":"Greedy maximal independent sets via local limits","volume":"64","author":"Krivelevich","year":"2024","journal-title":"Random Structures & Algorithms"},{"key":"10.1016\/j.cosrev.2026.100981_bib0600","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Can. J. Math."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0605","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","article-title":"Blossom v: a new implementation of a minimum cost perfect matching algorithm","volume":"1","author":"Kolmogorov","year":"2009","journal-title":"Math. Program. Comput."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0610","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3439724","article-title":"A survey on distributed graph pattern matching in massive graphs","volume":"54","author":"Bouhenni","year":"2021","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"10.1016\/j.cosrev.2026.100981_bib0615","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13673-018-0161-6","article-title":"An efficient movie recommendation algorithm based on improved k-clique","volume":"8","author":"Vilakone","year":"2018","journal-title":"Hum.-centric Comput. Inf. Sci."},{"key":"10.1016\/j.cosrev.2026.100981_bib0620","series-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"16","article-title":"Efficient semi-streaming algorithms for local triangle counting in massive graphs","author":"Becchetti","year":"2008"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0625","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3446330","article-title":"Near-optimal distributed triangle enumeration via expander decompositions","volume":"68","author":"Chang","year":"2021","journal-title":"Journal of the ACM (JACM)"},{"key":"10.1016\/j.cosrev.2026.100981_bib0630","series-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","first-page":"66","article-title":"Improved distributed expander decomposition and nearly optimal triangle enumeration","author":"Chang","year":"2019"},{"key":"10.1016\/j.cosrev.2026.100981_bib0635","series-title":"2022 IEEE High Performance Extreme Computing Conference (HPEC)","first-page":"1","article-title":"Improved distributed-memory triangle counting by exploiting the graph structure","author":"Ghosh","year":"2022"},{"issue":"11","key":"10.1016\/j.cosrev.2026.100981_bib0640","doi-asserted-by":"crossref","first-page":"2646","DOI":"10.1109\/TPDS.2021.3064892","article-title":"Trust: triangle counting reloaded on gpus","volume":"32","author":"Pandey","year":"2021","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0645","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1839490.1839494","article-title":"Efficient algorithms for large-scale local triangle counting","volume":"4","author":"Becchetti","year":"2010","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0650","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","article-title":"A method of matrix analysis of group structure","volume":"14","author":"Luce","year":"1949","journal-title":"Psychometrika"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0655","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","article-title":"Backtrack search algorithms and the maximal common subgraph problem","volume":"12","author":"McGregor","year":"1982","journal-title":"Softw. Pract. Exp."},{"issue":"13","key":"10.1016\/j.cosrev.2026.100981_bib0660","doi-asserted-by":"crossref","first-page":"i366","DOI":"10.1093\/bioinformatics\/btn186","article-title":"A maximum common substructure-based algorithm for searching and predicting drug-like compounds","volume":"24","author":"Cao","year":"2008","journal-title":"Bioinformatics"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0665","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/asi.21664","article-title":"Link prediction in citation networks","volume":"63","author":"Shibata","year":"2012","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"10.1016\/j.cosrev.2026.100981_bib0670","series-title":"Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval","first-page":"465","article-title":"On measuring social friend interest similarities in recommender systems","author":"Ma","year":"2014"},{"key":"10.1016\/j.cosrev.2026.100981_bib0675","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.procs.2016.04.102","article-title":"Link prediction based on common-neighbors for dynamic social network","volume":"83","author":"Yao","year":"2016","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0680","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/TIT.1968.1054098","article-title":"Estimation by the nearest neighbor rule","volume":"14","author":"Cover","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0685","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.4249\/scholarpedia.1883","article-title":"K-nearest neighbor","volume":"4","author":"Peterson","year":"2009","journal-title":"Scholarpedia"},{"key":"10.1016\/j.cosrev.2026.100981_bib0690","series-title":"Proceedings of the 20th International Conference on World Wide Web","first-page":"577","article-title":"Efficient k-nearest neighbor graph construction for generic similarity measures","author":"Dong","year":"2011"},{"key":"10.1016\/j.cosrev.2026.100981_bib0695","first-page":"547","article-title":"\u00c9tude comparative de LA distribution florale dans une portion des alpes ET des Jura","volume":"37","author":"Jaccard","year":"1901","journal-title":"Bull Soc Vaudoise Sci Nat"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0700","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic","year":"2003","journal-title":"Soc. Netw."},{"key":"10.1016\/j.cosrev.2026.100981_bib0705","series-title":"IEEE\/WIC\/ACM International Conference on Web Intelligence (WI\u201907)","first-page":"85","article-title":"Link prediction of social networks based on weighted proximity measures","author":"Murata","year":"2007"},{"key":"10.1016\/j.cosrev.2026.100981_bib0710","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0715","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.jda.2007.08.003","article-title":"A generalization of dijkstra\u2019s shortest path algorithm with applications to VLSI routing","volume":"7","author":"Peyer","year":"2009","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.cosrev.2026.100981_bib0720","series-title":"Proc. Of the International Symposium on the Theory of Switching","first-page":"285","article-title":"The shortest path through a maze","author":"Moore","year":"1959"},{"key":"10.1016\/j.cosrev.2026.100981_bib0725","series-title":"Proceedings of the 47th Design Automation Conference","first-page":"52","article-title":"An effective GPU implementation of breadth-first search","author":"Luo","year":"2010"},{"key":"10.1016\/j.cosrev.2026.100981_bib0730","series-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"key":"10.1016\/j.cosrev.2026.100981_bib0735","series-title":"Edsger Wybe Dijkstra: His Life, Work, and Legacy","first-page":"287","article-title":"A note on two problems in connexion with graphs","author":"Dijkstra","year":"2022"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0740","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","article-title":"\u03b4-stepping: a parallelizable shortest path algorithm","volume":"49","author":"Meyer","year":"2003","journal-title":"J. Algorithms"},{"key":"10.1016\/j.cosrev.2026.100981_bib0745","series-title":"Rand Corporation Paper","first-page":"1956","article-title":"Network flow theory","author":"Ford","year":"1956"},{"issue":"1","key":"10.1016\/j.cosrev.2026.100981_bib0750","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Q. Appl. Math."},{"key":"10.1016\/j.cosrev.2026.100981_bib0755","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.jda.2016.09.001","article-title":"An on3 loglog n\/log2n) time algorithm for all pairs shortest paths","volume":"38","author":"Han","year":"2016","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"10.1016\/j.cosrev.2026.100981_bib0760","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1090\/qam\/253822","article-title":"An algorithm for finding shortest routes from all source nodes to a given destination in general networks","volume":"27","author":"Yen","year":"1970","journal-title":"Q. Appl. Math."},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0765","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"7","key":"10.1016\/j.cosrev.2026.100981_bib0770","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","article-title":"Approximate graph edit distance computation by means of bipartite graph matching","volume":"27","author":"Riesen","year":"2009","journal-title":"Image Vis. Comput."},{"key":"10.1016\/j.cosrev.2026.100981_bib0775","series-title":"International Workshop on Graph-Based Representations in Pattern Recognition","first-page":"14","article-title":"Gedlib: a c++ library for graph edit distance computation","author":"Blumenthal","year":"2019"},{"issue":"6","key":"10.1016\/j.cosrev.2026.100981_bib0780","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"The Bell System Technical Journal"},{"key":"10.1016\/j.cosrev.2026.100981_bib0785","series-title":"Workshop on Algorithm Engineering and Experimentation","first-page":"1","article-title":"On the implementation of mst-based heuristics for the steiner problem in graphs","author":"de Aragao","year":"2002"},{"key":"10.1016\/j.cosrev.2026.100981_bib0790","series-title":"Proceedings of Simp\u00f3sio Brasileiro De Pesquisa Operacional (SBPO\u201915)","first-page":"1","article-title":"Distributed cycle detection in large-scale sparse graphs","author":"Rocha","year":"2015"},{"key":"10.1016\/j.cosrev.2026.100981_bib0795","doi-asserted-by":"crossref","first-page":"210","DOI":"10.4153\/CJM-1957-024-0","article-title":"A simple algorithm for finding maximal network flows and an application to the hitchcock problem","volume":"9","author":"Ford","year":"1957","journal-title":"Can. J. Math."},{"issue":"12","key":"10.1016\/j.cosrev.2026.100981_bib0800","first-page":"306","article-title":"Application of ford-fulkerson algorithm to maximum flow in water distribution pipeline network","volume":"8","author":"Kyi","year":"2018","journal-title":"Int. J. Sci. Res. Publ."},{"key":"10.1016\/j.cosrev.2026.100981_bib0805","series-title":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data","first-page":"135","article-title":"Pregel: a system for large-scale graph processing","author":"Malewicz","year":"2010"},{"issue":"3","key":"10.1016\/j.cosrev.2026.100981_bib0810","first-page":"5","article-title":"Giraph: large-scale graph processing infrastructure on hadoop","volume":"11","author":"Avery","year":"2011","journal-title":"Proceedings of the Hadoop Summit."},{"key":"10.1016\/j.cosrev.2026.100981_bib0815","first-page":"1","article-title":"The igraph software","volume":"1695","author":"Csardi","year":"2006","journal-title":"Complex Syst."},{"key":"10.1016\/j.cosrev.2026.100981_bib0820","author":"Peixoto"},{"key":"10.1016\/j.cosrev.2026.100981_bib0830","series-title":"Proceedings of the 2018 International Conference on Management of Data","first-page":"1433","article-title":"Cypher: an evolving query language for property graphs","author":"Francis","year":"2018"},{"key":"10.1016\/j.cosrev.2026.100981_bib0835","author":"Arrow"},{"key":"10.1016\/j.cosrev.2026.100981_bib0845","series-title":"Proceedings of the 15th Symposium on Database Programming Languages","first-page":"1","article-title":"The gremlin graph traversal machine and language (invited talk)","author":"Rodriguez","year":"2015"},{"key":"10.1016\/j.cosrev.2026.100981_bib0970","series-title":"Proceedings of the VLDB 2025 PhD Workshop","article-title":"Algorithm support in a graph database, done right","volume":"vol. 2150-8097","author":"de Graaf","year":"2025"},{"key":"10.1016\/j.cosrev.2026.100981_bib0975","unstructured":"F. Cambria, Repository with synthetic graph datasets for algorithm evaluation: random, scale-free, and small-world distributions, 2026, 10.5281\/zenodo.19252778"},{"key":"10.1016\/j.cosrev.2026.100981_bib0980","first-page":"22118","article-title":"Open graph benchmark: datasets for machine learning on graphs","volume":"33","author":"Hu","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"D1","key":"10.1016\/j.cosrev.2026.100981_bib0990","doi-asserted-by":"crossref","DOI":"10.1093\/nar\/gkx1037","article-title":"Drugbank 5.0: a major update to the drugbank database for 2018","volume":"46","author":"Wishart","year":"2018","journal-title":"Nucleic acids research"},{"issue":"2","key":"10.1016\/j.cosrev.2026.100981_bib0995","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1039\/C7SC02664A","article-title":"Moleculenet: a benchmark for molecular machine learning","volume":"9","author":"Wu","year":"2018","journal-title":"Chem. Sci."}],"container-title":["Computer Science Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726000894?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013726000894?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T18:04:51Z","timestamp":1783361091000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574013726000894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":171,"alternative-id":["S1574013726000894"],"URL":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.100981","relation":{},"ISSN":["1574-0137"],"issn-type":[{"value":"1574-0137","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Data analytics algorithms in property graph databases: A survey","name":"articletitle","label":"Article Title"},{"value":"Computer Science Review","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cosrev.2026.100981","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"100981"}}