The book picks up where the article left offThe Dissertation Graph: Awesome-Graphs Takes a Sample with 200 Graph Systems Dissertations.In it, I told you how to think about the evolutionary history of graph computing systems in terms of graphs, and in a subsequent series of articles combined with theAwesome-GraphsThe project unpacks several classic papers in the field of graph computation.
This time, we have released a new version of Awesome-Graphs (v1.1.0), not only includes a better collection of papers compared to the previous version, but also adds a series of convenient interactive capabilities to make learning graph computing techniques easier:
- 207 graph computation systems are included and 509 referential relationships are maintained.
- Added pdf source files for 189 papers. (13 of which could not be found on the public web)
- Supports one-click preview of thesis title and product official website.
- Supports one-click traceability of citation and cited relationships in papers.
That's right, the whole program is centered on onehtml file(It works as soon as you download it.) Next, we show the core features one by one.
1. Thesis mapping at a glance
Download and open the file, more than 200 graph computation system paper mapping, what you see is what you get.
2. Search localization, direct access to content
Of course, the search function is naturally essential. After selecting a node, click on the paper title to go straight to the paper file.
In addition to the thesis document, the official website of the product must be available.
3. Positive and negative, each in its own way
The right-click menu on the nodes makes tracing the roots of a thesis citation incredibly easy.
Take a look at the citation network for the TuGraph Analytics paper GeaFlow.
Or take a look at the cited network for this paper by TuGraph team Gemini and never have to Google Scholar a little bit again.
It's not uncommon to see neighbors upstream and downstream.
4. Submission of contributions, two lines of code
Don't get hung up on what the Code Contributions section describes; most cases only require two lines of code:
code contribution
- The project only relies on front-end componentsTo make adjustments to the mapping data, simply modify the
Papersnodescap (a poem)edgesDefinition of. - Add new graph computing system thesis nodes such as
{id: 'Pregel'},。- utilization
_paperattribute specifies the title of the paper, e.g.{id: 'GeaFlow', _paper: 'GeaFlow: A Graph Extended and Accelerated Dataflow System'},。 - utilization
_websiteattribute specifies the associated URL, such as{id: 'TuGraph', _website: ''},。 - set up
_type: 'db'Indicates a product node, such as{id: 'TuGraph', _type: 'db'},。
- utilization
- Added graph computing system paper/product citations such as
{from: 'GeaFlow', to: 'TuGraph'},。- Setting Properties
_bidirectional: trueIndicates a two-way reference. For example{from: 'GraphChi', to: 'PowerGraph', _bidirectional: true},expressedGraphChicap (a poem)PowerGraphCross-referencing exists (also published in OSDI-2012).
- Setting Properties
- New papers are uniformly placed in the
papers/<diagram system name>.pdfpath and modify it alphabeticallydocs/The citation link. - Errors and omissions are inevitable in the data due to the limitations of manual collation, and we welcome you to contribute errata and unrecorded paper and product information.
One line of code fills in the thesis and one line of code fills in the citation.
{id: 'TuGraph', _paper: 'TuGraph: Graph Database from Ant Group'},
{from: 'TuGraph', to: 'Pregel'},
5. Documentation resources at your disposal
All the documentation, it's all here:
/TuGraph-family/Awesome-Graphs/blob/master/docs/
If you're interested, you're welcome to pack it all up, and don't forget to give the program a little something at the end!StarYou can be the first to receive notifications of content updates.