[
  {
    "path": "LICENSE",
    "content": "Creative Commons Legal Code\n\nCC0 1.0 Universal\n\n    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE\n    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN\n    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS\n    INFORMATION ON AN \"AS-IS\" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES\n    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS\n    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM\n    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED\n    HEREUNDER.\n\nStatement of Purpose\n\nThe laws of most jurisdictions throughout the world automatically confer\nexclusive Copyright and Related Rights (defined below) upon the creator\nand subsequent owner(s) (each and all, an \"owner\") of an original work of\nauthorship and/or a database (each, a \"Work\").\n\nCertain owners wish to permanently relinquish those rights to a Work for\nthe purpose of contributing to a commons of creative, cultural and\nscientific works (\"Commons\") that the public can reliably and without fear\nof later claims of infringement build upon, modify, incorporate in other\nworks, reuse and redistribute as freely as possible in any form whatsoever\nand for any purposes, including without limitation commercial purposes.\nThese owners may contribute to the Commons to promote the ideal of a free\nculture and the further production of creative, cultural and scientific\nworks, or to gain reputation or greater distribution for their Work in\npart through the use and efforts of others.\n\nFor these and/or other purposes and motivations, and without any\nexpectation of additional consideration or compensation, the person\nassociating CC0 with a Work (the \"Affirmer\"), to the extent that he or she\nis an owner of Copyright and Related Rights in the Work, voluntarily\nelects to apply CC0 to the Work and publicly distribute the Work under its\nterms, with knowledge of his or her Copyright and Related Rights in the\nWork and the meaning and intended legal effect of CC0 on those rights.\n\n1. Copyright and Related Rights. A Work made available under CC0 may be\nprotected by copyright and related or neighboring rights (\"Copyright and\nRelated Rights\"). Copyright and Related Rights include, but are not\nlimited to, the following:\n\n  i. the right to reproduce, adapt, distribute, perform, display,\n     communicate, and translate a Work;\n ii. moral rights retained by the original author(s) and/or performer(s);\niii. publicity and privacy rights pertaining to a person's image or\n     likeness depicted in a Work;\n iv. rights protecting against unfair competition in regards to a Work,\n     subject to the limitations in paragraph 4(a), below;\n  v. rights protecting the extraction, dissemination, use and reuse of data\n     in a Work;\n vi. database rights (such as those arising under Directive 96/9/EC of the\n     European Parliament and of the Council of 11 March 1996 on the legal\n     protection of databases, and under any national implementation\n     thereof, including any amended or successor version of such\n     directive); and\nvii. other similar, equivalent or corresponding rights throughout the\n     world based on applicable law or treaty, and any national\n     implementations thereof.\n\n2. Waiver. To the greatest extent permitted by, but not in contravention\nof, applicable law, Affirmer hereby overtly, fully, permanently,\nirrevocably and unconditionally waives, abandons, and surrenders all of\nAffirmer's Copyright and Related Rights and associated claims and causes\nof action, whether now known or unknown (including existing as well as\nfuture claims and causes of action), in the Work (i) in all territories\nworldwide, (ii) for the maximum duration provided by applicable law or\ntreaty (including future time extensions), (iii) in any current or future\nmedium and for any number of copies, and (iv) for any purpose whatsoever,\nincluding without limitation commercial, advertising or promotional\npurposes (the \"Waiver\"). Affirmer makes the Waiver for the benefit of each\nmember of the public at large and to the detriment of Affirmer's heirs and\nsuccessors, fully intending that such Waiver shall not be subject to\nrevocation, rescission, cancellation, termination, or any other legal or\nequitable action to disrupt the quiet enjoyment of the Work by the public\nas contemplated by Affirmer's express Statement of Purpose.\n\n3. Public License Fallback. Should any part of the Waiver for any reason\nbe judged legally invalid or ineffective under applicable law, then the\nWaiver shall be preserved to the maximum extent permitted taking into\naccount Affirmer's express Statement of Purpose. In addition, to the\nextent the Waiver is so judged Affirmer hereby grants to each affected\nperson a royalty-free, non transferable, non sublicensable, non exclusive,\nirrevocable and unconditional license to exercise Affirmer's Copyright and\nRelated Rights in the Work (i) in all territories worldwide, (ii) for the\nmaximum duration provided by applicable law or treaty (including future\ntime extensions), (iii) in any current or future medium and for any number\nof copies, and (iv) for any purpose whatsoever, including without\nlimitation commercial, advertising or promotional purposes (the\n\"License\"). The License shall be deemed effective as of the date CC0 was\napplied by Affirmer to the Work. Should any part of the License for any\nreason be judged legally invalid or ineffective under applicable law, such\npartial invalidity or ineffectiveness shall not invalidate the remainder\nof the License, and in such case Affirmer hereby affirms that he or she\nwill not (i) exercise any of his or her remaining Copyright and Related\nRights in the Work or (ii) assert any associated claims and causes of\naction with respect to the Work, in either case contrary to Affirmer's\nexpress Statement of Purpose.\n\n4. Limitations and Disclaimers.\n\n a. No trademark or patent rights held by Affirmer are waived, abandoned,\n    surrendered, licensed or otherwise affected by this document.\n b. Affirmer offers the Work as-is and makes no representations or\n    warranties of any kind concerning the Work, express, implied,\n    statutory or otherwise, including without limitation warranties of\n    title, merchantability, fitness for a particular purpose, non\n    infringement, or the absence of latent or other defects, accuracy, or\n    the present or absence of errors, whether or not discoverable, all to\n    the greatest extent permissible under applicable law.\n c. Affirmer disclaims responsibility for clearing rights of other persons\n    that may apply to the Work or any use thereof, including without\n    limitation any person's Copyright and Related Rights in the Work.\n    Further, Affirmer disclaims responsibility for obtaining any necessary\n    consents, permissions or other rights required for any use of the\n    Work.\n d. Affirmer understands and acknowledges that Creative Commons is not a\n    party to this document and has no duty or obligation with respect to\n    this CC0 or use of the Work.\n"
  },
  {
    "path": "README.md",
    "content": "# Awesome Dynamic Graphs\nA collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and related academic and industrial work.\n\n## Contributing\nTo add, remove or change things on the list:\n[please submit a pull request to the GitHub repository](https://github.com/domargan/awesome-dynamic-graphs).\n\n\n## Open Source Projects\n### Data Structures, Systems and Frameworks\n* [Aspen](https://github.com/ldhulipala/aspen) [C++]\n    * Streaming graph processing system based on compressed purely-functional trees\n    * [Paper](https://people.csail.mit.edu/jshun/aspen.pdf)\n* [Differential Dataflow](https://github.com/frankmcsherry/differential-dataflow) [Rust]\n    * General data-parallel programming framework suitable for processing large dynamic graphs\n    * [Paper](http://michaelisard.com/pubs/differentialdataflow.pdf)\n* [GraphBolt](https://github.com/pdclab/graphbolt) [C++]\n    * Streaming graph processing system that provides BSP guarantees \n    * [Paper](https://dl.acm.org/doi/10.1145/3302424.3303974)\n* [GraphJet](https://github.com/twitter/GraphJet) [Java]\n    * Streaming graph processing system for generating content recommendations at Twitter\n    * [Paper](https://www.vldb.org/pvldb/vol9/p1281-sharma.pdf)\n* [GraphOne](https://github.com/the-data-lab/GraphOne) [C++]\n    * Storage engine for streaming graph data\n    * [Paper](https://www.usenix.org/system/files/fast19-kumar.pdf)\n* [GreyCat](https://github.com/datathings/greycat) [Java]\n    * _Many-world_ temporal graph data store\n    * [Paper](https://hal.inria.fr/hal-02059882/document)\n* [GoFFish](https://github.com/usc-cloud/goffish)[Java]\n    * Multi-source streaming graph processing system\n* [KickStarter](https://github.com/pdclab/graphbolt)[C++]\n    * Streaming graph processing system optimising for path-based/monotonic graph algorithms\n    * [Paper](https://dl.acm.org/doi/10.1145/3037697.3037748)\n* [LLAMA](https://github.com/goatdb/llama) [C++]\n    * CSR-based storage engine and streaming graph processing system\n    * [Paper](https://ieeexplore.ieee.org/document/7113298/)\n* [PCSR](https://github.com/wheatman/Packed-Compressed-Sparse-Row/) [C++]\n    * CSR-inspired, packed memory array based data structure for streaming graphs\n    * [Paper](https://ieeexplore.ieee.org/document/8547566)\n* [PPCSR](https://github.com/domargan/parallel-packed-csr) [C++]\n    * Parallel and NUMA-aware implementation of PCSR data structure for streaming graphs\n* [Raphtory](https://github.com/Raphtory/Raphtory) [Scala]\n    * Snapshot-based distributed streaming graph processing system\n    * [Paper](https://www.sciencedirect.com/science/article/pii/S0167739X19301621)\n* [STINGER](https://github.com/stingergraph/stinger) [C/C++]\n    * Data structure for streaming graphs based on linked lists of blocks\n    * [Paper](https://ieeexplore.ieee.org/document/6408680)\n\n### Benchmarking\n* [GraphTides](https://github.com/GraphTides/graphtides) [Java/TypeScript]\n    * Framework for evaluating streaming graph processing platforms\n    * [Paper](https://dl.acm.org/doi/10.1145/3210259.3210262)\n\n\n## Papers\nCheck [Julian Shun's list](https://people.csail.mit.edu/jshun/graph.shtml#streamingframeworks) for a further reference and an extensive collection of related papers.\n\n### Data Structures and Storage\n[STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation](https://pdfs.semanticscholar.org/6992/7a3b9fc25e655ce662c03deb1e9d2832585c.pdf)  (2009)\n\n[STINGER: High Performance Data Structure for Streaming Graphs](https://ieeexplore.ieee.org/document/6408680)  (HPEC 2012)\n\n[Packed Compressed Sparse Row: A Dynamic Graph Representation](https://ieeexplore.ieee.org/document/8547566) (HPEC 2018)\n\n[GraphOne: A Data Store for Real-time Analytics on Evolving Graphs](https://dl.acm.org/doi/abs/10.1145/3364180) (FAST 2019)\n\n[GraphTinker: A High Performance Data Structure for Dynamic Graph Processing](https://ieeexplore.ieee.org/abstract/document/8821003) (IPDPS 2019)\n\n[CSR++: A Fast, Scalable, Update-Friendly Graph DataStructure](https://hal.archives-ouvertes.fr/hal-03060095/document) (OPODIS 2020)\n\n[LiveGraph: A Transactional Graph Storage System With Purely Sequential Adjacency List Scans](https://dl.acm.org/doi/abs/10.14778/3384345.3384351) (VLDB 2020)\n\n[A Parallel Packed Memory Array to Store Dynamic Graphs](https://epubs.siam.org/doi/pdf/10.1137/1.9781611976472.3) (ALENEX 2021)\n\n### Systems and Frameworks\n[STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation](https://pdfs.semanticscholar.org/6992/7a3b9fc25e655ce662c03deb1e9d2832585c.pdf)  (2009)\n\n[On Querying Historical Evolving Graph Sequences](http://www.vldb.org/pvldb/vol4/p726-ren.pdf)  (VLDB 2011)\n\n[STINGER: High Performance Data Structure for Streaming Graphs](https://ieeexplore.ieee.org/document/6408680)  (HPEC 2012)\n\n[Facilitating Real-Time Graph Mining](https://dl.acm.org/citation.cfm?id=2390023)  (CloudDB 2012)\n\n[Kineograph: Taking the Pulse of a Fast-Changing and Connected World](https://dl.acm.org/citation.cfm?id=2168846)  (EuroSys 2012)\n\n[Differential Dataflow](http://cidrdb.org/cidr2013/Papers/CIDR13_Paper111.pdf)  (CIDR 2013)\n\n[Efficient Snapshot Retrieval over Historical Graph Data](https://ieeexplore.ieee.org/document/6544892)  (ICDE 2013)\n\n[Naiad: A Timely Dataflow System](https://dl.acm.org/citation.cfm?id=2522738)  (SOSP 2013)\n\n[Chronos: A Graph Engine for Temporal Graph Analysis](https://dl.acm.org/citation.cfm?id=2592799)  (EuroSys 2014)\n\n[Towards Large-Scale Graph Stream Processing Platform](https://dl.acm.org/citation.cfm?id=2580051)  (WWW 2014)\n\n[CellIQ : Real-Time Cellular Network Analytics at Scale](https://www.usenix.org/system/files/conference/nsdi15/nsdi15-paper-iyer.pdf)  (NSDI 2015)\n\n[DISTINGER: A Distributed Graph Data Structure for Massive Dynamic Graph Processing](https://ieeexplore.ieee.org/document/7363954)  (Big Data 2015)\n\n[ImmortalGraph: A System for Storage and Analysis of Temporal Graphs](https://dl.acm.org/citation.cfm?id=2700302)  (Transactions on Storage 2015)\n\n[LLAMA: Efficient Graph Analytics Using Large Multiversioned Arrays](https://ieeexplore.ieee.org/document/7113298/)  (ICDE 2015)\n\n[Real-time Analytics for Fast Evolving Social Graphs](https://ieeexplore.ieee.org/document/7152566)  (CCGrid 2015)\n\n[GraphIn: An Online High Performance Incremental Graph Processing Framework](https://link.springer.com/chapter/10.1007%2F978-3-319-43659-3_24)  (Euro-Par 2016)\n\n[GraphJet: Real-Time Content Recommendations at Twitter](https://dl.acm.org/citation.cfm?id=3007267)  (VLDB 2016)\n\n[Storing and Analyzing Historical Graph Data at Scale](http://openproceedings.org/2016/conf/edbt/paper-29.pdf)  (EDBT 2016)\n\n[Synergistic Analysis of Evolving Graphs](https://dl.acm.org/citation.cfm?id=2992784)  (TACO 2016)\n\n[Time-Evolving Graph Processing at Scale](https://dl.acm.org/citation.cfm?id=2960419)  (GRADES 2016)\n\n[Tornado: A System For Real-Time Iterative Analysis Over Evolving Data](https://dl.acm.org/citation.cfm?id=2882903.2882950)  (SIGMOD 2016)\n\n[Towards a Distributed Large-Scale Dynamic Graph Data Store](https://ieeexplore.ieee.org/document/7529955)  (IPDPSW 2016)\n\n[Automatic Algorithm Transformation for Efficient Multi-Snapshot Analytics on Temporal Graphs](https://dl.acm.org/citation.cfm?id=3090166)  (VLDB 2017)\n\n[KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations](https://dl.acm.org/doi/10.1145/3037697.3037748) (ASPLOS 2017) \n\n[Auxo: A Temporal Graph Management System](https://ieeexplore.ieee.org/document/8486795) (BDMA 2018)\n\n[Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows](https://dl.acm.org/citation.cfm?id=3199520)  (VLDB 2018)\n\n[GraPU: Accelerate Streaming Graph Analysis through Preprocessing Buffered Updates](https://dl.acm.org/citation.cfm?id=3267811)  (SOCC 2018)\n\n[GraphBolt: Dependency-Driven Synchronous Processing of Streaming Graphs](https://dl.acm.org/citation.cfm?id=3303974)  (EuroSys 2019)\n\n[Low-Latency Graph Streaming Using Compressed Purely-Functional Trees](https://people.csail.mit.edu/jshun/aspen.pdf) (PLDI 2019)\n\n[GraphOne: A Data Store for Real-time Analytics on Evolving Graphs](https://dl.acm.org/doi/abs/10.1145/3364180) (FAST 2019)\n\n[LiveGraph: A Transactional Graph Storage System With Purely Sequential Adjacency List Scans](https://dl.acm.org/doi/abs/10.14778/3384345.3384351) (VLDB 2020)\n\n[Raphtory: Streaming analysis of distributed temporal graphs](https://www.sciencedirect.com/science/article/pii/S0167739X19301621) (FGCS 2020)\n\n[RisGraph: A Real-Time Streaming System for Evolving Graphs](https://arxiv.org/abs/2004.00803) (2020)\n\n[Tegra: Efficient Ad-Hoc Analytics on Time-Evolving Graphs]() (NSDI 2021)\n\n### Surveys\n[The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing](https://dl.acm.org/doi/abs/10.1145/3164135.3164139) (VLDB 2018)\n\n[Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism](https://www.research-collection.ethz.ch/handle/20.500.11850/462546) (2020)\n\n## Datasets\nNote: Very small datasets are not included in the list.\n|        Category        \t|        Data Source        \t|           Name          \t|          Type          \t|   Vertex Meaning  \t|      Edge Meaning     \t| Size (\\|V\\|) \t| Volume (\\|E\\|) \t| Edge Weight \t| Edge Timestamps \t| Multiple Edges \t|                     Source/Link                    \t|\n|:----------------------:\t|:-------------------------:\t|:-----------------------:\t|:----------------------:\t|:-----------------:\t|:---------------------:\t|:------------:\t|:--------------:\t|:-----------:\t|:---------------:\t|:--------------:\t|:--------------------------------------------------:\t|\n|   Authorship network   \t|         Wikipedia         \t|       edit-enwiki       \t|  Bipartite, undirected \t|   User, article   \t|          Edit         \t|  50,757,442  \t|   572,591,272  \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/edit-enwiki/       \t|\n|    Citation network    \t|            DBLP           \t|        dblp-cite        \t|  Unipartite, directed  \t|    Publication    \t|        Citation       \t|    12,590    \t|     49,759     \t|      N      \t|        Y        \t|        N       \t|        http://konect.cc/networks/dblp-cite/        \t|\n|   Co-citation network  \t|           arXiv           \t|       ca-cit-HepPh      \t| Unipartite, undirected \t|       Author      \t|      Co-citation      \t|    28,093    \t|    4,596,803   \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/ca-cit-HepPh/      \t|\n|   Co-citation network  \t|           arXiv           \t|       ca-cit-HepTh      \t| Unipartite, undirected \t|       Author      \t|      Co-citation      \t|    22,908    \t|    2,673,133   \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/ca-cit-HepTh/      \t|\n|  Communication network \t|          Facebook         \t|    facebook-wosn-wall   \t|  Unipartite, directed  \t|        User       \t|       Wall post       \t|    46,952    \t|     876,993    \t|      N      \t|        Y        \t|        Y       \t|    http://konect.cc/networks/facebook-wosn-wall/   \t|\n|  Communication network \t| Linux kernel mailing list \t|        lkml-reply       \t|  Unipartite, directed  \t|       Person      \t|         Reply         \t|    63,399    \t|    1,096,440   \t|      N      \t|        Y        \t|        Y       \t|        http://konect.cc/networks/lkml-reply/       \t|\n|    Computer network    \t|     Internet topology     \t|         topology        \t| Unipartite, undirected \t| Autonomous system \t|       Connection      \t|    34,761    \t|     171,403    \t|      N      \t|        Y        \t|        Y       \t|         http://konect.cc/networks/topology/        \t|\n|     Feature network    \t|         BibSonomy         \t|      bibsonomy-2ti      \t|  Bipartite, undirected \t|  Tag, publication \t|       Assignment      \t|    972,120   \t|    2,555,080   \t|      N      \t|        Y        \t|        Y       \t|      http://konect.cc/networks/bibsonomy-2ti/      \t|\n|     Feature network    \t|         CiteULike         \t|       citeulike-ti      \t|  Bipartite, undirected \t|  Tag, publication \t|       Assignment      \t|    885,046   \t|    2,411,819   \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/citeulike-ti/      \t|\n|     Feature network    \t|         Delicious         \t|       delicious-ti      \t|  Bipartite, undirected \t|     Tag,  URL     \t|     Tag assignment    \t|  38,289,740  \t|   301,183,605  \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/delicious-ti/      \t|\n|     Feature network    \t|          Google+          \t|    stevgong_attribute   \t|  Bipartite, undirected \t|  User, attribute  \t|     Attribute-link    \t|  10,442,421  \t|   20,592,962   \t|      N      \t|        Y        \t|        N       \t|    http://konect.cc/networks/stevgong_attribute/   \t|\n|     Feature network    \t|          Twitter          \t|   munmun_twitterex_ti   \t|  Bipartite, undirected \t|   Hashtag,  URL   \t|     Co-occurrence     \t|   1,502,611  \t|    2,635,885   \t|      N      \t|        Y        \t|        Y       \t|   http://konect.cc/networks/munmun_twitterex_ti/   \t|\n|  Human contact network \t|            MIT            \t|           mit           \t| Unipartite, undirected \t|       Person      \t|        Contact        \t|      96      \t|    1,086,404   \t|      N      \t|        Y        \t|        Y       \t|           http://konect.cc/networks/mit/           \t|\n|    Hyperlink network   \t|         Wikipedia         \t|   link-dynamic-dewiki   \t|  Unipartite, directed  \t|      Article      \t|       Reference       \t|   2,166,669  \t|   86,337,879   \t|      N      \t|        Y        \t|        N       \t|   http://konect.cc/networks/link-dynamic-dewiki/   \t|\n|    Hyperlink network   \t|         Wikipedia         \t|   link-dynamic-frwiki   \t|  Unipartite, directed  \t|      Article      \t|       Reference       \t|   2,212,682  \t|   59,008,831   \t|      N      \t|        Y        \t|        N       \t|   http://konect.cc/networks/link-dynamic-frwiki/   \t|\n|    Hyperlink network   \t|         Wikipedia         \t|   link-dynamic-itwiki   \t|  Unipartite, directed  \t|      Article      \t|       Reference       \t|   1,204,009  \t|   34,826,283   \t|      N      \t|        Y        \t|        N       \t|   http://konect.cc/networks/link-dynamic-itwiki/   \t|\n|    Hyperlink network   \t|         Wikipedia         \t|   link-dynamic-nlwiki   \t|  Unipartite, directed  \t|      Article      \t|       Reference       \t|   1,039,252  \t|   20,070,561   \t|      N      \t|        Y        \t|        N       \t|   http://konect.cc/networks/link-dynamic-nlwiki/   \t|\n|    Hyperlink network   \t|         Wikipedia         \t|   link-dynamic-plwiki   \t|  Unipartite, directed  \t|      Article      \t|       Reference       \t|   1,033,050  \t|   25,026,208   \t|      N      \t|        Y        \t|        N       \t|   http://konect.cc/networks/link-dynamic-plwiki/   \t|\n|    Hyperlink network   \t|         Wikipedia         \t| link-dynamic-simplewiki \t|  Unipartite, directed  \t|      Article      \t|       Reference       \t|    100,312   \t|    1,627,472   \t|      N      \t|        Y        \t|        N       \t| http://konect.cc/networks/link-dynamic-simplewiki/ \t|\n|   Interaction network  \t|           LastFm          \t|       lastfm_band       \t|  Bipartite, undirected \t|     User, band    \t|       Listening       \t|    175,069   \t|   19,150,868   \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/lastfm_band/       \t|\n|   Interaction network  \t|           LastFm          \t|       lastfm_song       \t|  Bipartite, undirected \t|     User, song    \t|       Listening       \t|   1,085,612  \t|   19,150,868   \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/lastfm_song/       \t|\n| Online contact network \t|       Stack Exchange      \t|       sx-askubuntu      \t|  Unipartite, directed  \t|        User       \t|     Answer/comment    \t|    159,316   \t|     964,437    \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/sx-askubuntu/      \t|\n| Online contact network \t|       Stack Exchange      \t|     sx-mathoverflow     \t|  Unipartite, directed  \t|        User       \t|     Answer/comment    \t|    24,818    \t|     506,550    \t|      N      \t|        Y        \t|        Y       \t|     http://konect.cc/networks/sx-mathoverflow/     \t|\n| Online contact network \t|       Stack Exchange      \t|     sx-stackoverflow    \t|  Unipartite, directed  \t|        User       \t|     Answer/comment    \t|   2,601,977  \t|   63,497,050   \t|      N      \t|        Y        \t|        Y       \t|     http://konect.cc/networks/sx-stackoverflow/    \t|\n| Online contact network \t|       Stack Exchange      \t|       sx-superuser      \t|  Unipartite, directed  \t|        User       \t|     Answer/comment    \t|    194,085   \t|    1,443,339   \t|      N      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/sx-superuser/      \t|\n| Online contact network \t|          Twitter          \t|      higgs-twitter      \t|  Unipartite, directed  \t|        User       \t| Retweet/mention/reply \t|       ?      \t|     563,069    \t|      N      \t|        Y        \t|      Y (?)     \t|  https://snap.stanford.edu/data/higgs-twitter.html \t|\n| Online contact network \t|          Twitter          \t|   munmun_twitterex_at   \t|  Unipartite, directed  \t|        User       \t|        Mention        \t|   2,919,613  \t|   12,887,063   \t|      N      \t|        Y        \t|        Y       \t|   http://konect.cc/networks/munmun_twitterex_at/   \t|\n| Online contact network \t|         Wikipedia         \t|           elec          \t|  Unipartite, directed  \t|        User       \t|          Vote         \t|     7,118    \t|     103,675    \t|      N      \t|        Y        \t|        N       \t|           http://konect.cc/networks/elec/          \t|\n| Online contact network \t|         Wikipedia         \t|       wikiconflict      \t| Unipartite, undirected \t|        User       \t|     Edit conflict     \t|    118,100   \t|    2,917,785   \t|      Y      \t|        Y        \t|        Y       \t|       http://konect.cc/networks/wikiconflict/      \t|\n|  Online social network \t|          Bitcoin          \t|       soc-bitcoin       \t|  Unipartite, directed  \t|       Member      \t|     Trust/distrust    \t|  24,575,382  \t|   122,948,162  \t|      ?      \t|        Y        \t|        N       \t|    https://networkrepository.com/soc-bitcoin.php   \t|\n|  Online social network \t|            Digg           \t|       digg-friends      \t|  Unipartite, directed  \t|        User       \t|          Vote         \t|    279,630   \t|    1,731,653   \t|      N      \t|        Y        \t|        N       \t|       http://konect.cc/networks/digg-friends/      \t|\n|  Online social network \t|          Facebook         \t|   facebook-wosn-links   \t| Unipartite, undirected \t|        User       \t|       Friendship      \t|    63,731    \t|     817,035    \t|      N      \t|        Y        \t|        N       \t|   http://konect.cc/networks/facebook-wosn-links/   \t|\n|  Online social network \t|           Flickr          \t|      flickr-growth      \t|  Unipartite, directed  \t|        User       \t|       Friendship      \t|   2,302,925  \t|   33,140,017   \t|      N      \t|        Y        \t|        N       \t|      http://konect.cc/networks/flickr-growth/      \t|\n|  Online social network \t|          Google+          \t|     stevgong_social     \t|  Unipartite, directed  \t|        User       \t|      Interaction      \t|  28,943,739  \t|   462,994,069  \t|      N      \t|        Y        \t|        N       \t|     http://konect.cc/networks/stevgong_social/     \t|\n|  Online social network \t|          YouTube          \t|     youtube-u-growth    \t| Unipartite, undirected \t|        User       \t|       Friendship      \t|   3,223,589  \t|    9,375,374   \t|      N      \t|        Y        \t|        N       \t|     http://konect.cc/networks/youtube-u-growth/    \t|\n|     Rating network     \t|           Amazon          \t|      rec-amz-Books      \t|  Bipartite, undirected \t|   User, product   \t|         Rating        \t|  10,356,390  \t|   22,507,155   \t|      Y      \t|        Y        \t|        N       \t|   https://networkrepository.com/rec-amz-Books.php  \t|\n|     Rating network     \t|          Epinions         \t|     epinions-rating     \t|  Bipartite, undirected \t|   User, product   \t|         Rating        \t|    876,252   \t|   13,668,320   \t|      N      \t|        Y        \t|        Y       \t|     http://konect.cc/networks/epinions-rating/     \t|\n|     Rating network     \t|          Netflix          \t|         netflix         \t|  Bipartite, undirected \t|    User, movie    \t|         Rating        \t|    497,959   \t|   100,480,507  \t|      Y      \t|        Y        \t|        N       \t|         http://konect.cc/networks/netflix/         \t|\n|     Rating network     \t|           Yahoo           \t|        yahoo-song       \t|  Bipartite, undirected \t|    Person, song   \t|         Rating        \t|   1,625,951  \t|   256,804,235  \t|      Y      \t|        Y        \t|        N       \t|        http://konect.cc/networks/yahoo-song/       \t|\n\n\n\n## About\nThis list was compiled by [Domagoj Margan](https://github.com/domargan) with help and resources from the systems community.\n"
  }
]