External Memory Graph Data Structures
External Memory Graph Data Structures is a class of data organization methods designed to represent and manage graph-based data in external storage systems, distinguished by their optimization for efficient input/output operations in environments where the graph size exceeds main memory capacity.
24
Publications
1.7K
Citations
59
Authors
31
Institutions
Publications per year
2017–2026
8
24
External-memory graph algorithms
Yi‐Jen Chiang, Michael T. Goodrich, Edward F. Grove et al. · KU ScholarWorks (The University of Kansas) · 1995 · 279 citations · Full text
FlashGraph: processing billion-node graphs on an array of commodity SSDs
Da Zheng, Disa Mhembere, Randal Burns et al. · 2015 · 186 citations · Full text
Comparing Hierarchical Data in External Memory
Sudarshan S. Chawathe · 1999 · 181 citations
Finding maximal cliques in massive networks
James Cheng, Yiping Ke, Ada Wai-Chee Fu et al. · ACM Transactions on Database Systems · 2011 · 155 citations
1–5 of 24
59
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 59
31
Nanyang Technological University
Singapore, Singapore
3 h-index
7 publications
409 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
2 h-index
6 publications
774 citations
AT&T (United States)
Bedminster, United States
2 h-index
5 publications
546 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
5 publications
141 citations
Karlsruhe University of Education
Karlsruhe, Germany
2 h-index
2 publications
90 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
263 citations
Duke University
Durham, United States
2 h-index
3 publications
129 citations
Max Planck Society
Munich, Germany
2 h-index
4 publications
146 citations
1–8 of 31
TODS · 1 publications · 155 citations
1
h-index
1 publications · 108 citations
1
h-index
1 publications · 34 citations
1
h-index
TKDE · 1 publications · 11 citations
1
h-index
TOPC · 1 publications · 67 citations
1
h-index
1–5