{"id":16021261,"url":"https://github.com/joshdevins/tuttle","last_synced_at":"2025-05-14T05:13:31.810Z","repository":{"id":10221056,"uuid":"12319341","full_name":"joshdevins/tuttle","owner":"joshdevins","description":"A minimal, in-memory graph database in Scala","archived":false,"fork":false,"pushed_at":"2015-08-20T12:02:42.000Z","size":136,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-17T00:20:36.957Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Scala","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/joshdevins.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-08-23T09:25:59.000Z","updated_at":"2019-08-24T01:09:02.000Z","dependencies_parsed_at":"2022-08-28T08:40:10.983Z","dependency_job_id":null,"html_url":"https://github.com/joshdevins/tuttle","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joshdevins%2Ftuttle","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joshdevins%2Ftuttle/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joshdevins%2Ftuttle/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joshdevins%2Ftuttle/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/joshdevins","download_url":"https://codeload.github.com/joshdevins/tuttle/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254076851,"owners_count":22010611,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-08T18:02:48.418Z","updated_at":"2025-05-14T05:13:31.721Z","avatar_url":"https://github.com/joshdevins.png","language":"Scala","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Tuttle\n\nA minimal, in-memory graph database. This is modelled on my learnings working with\n\"[Pregel](http://googleresearch.blogspot.de/2009/06/large-scale-graph-computing-at-google.html)\nstyle\" systems for running graph-based learning algorithms. In particular,\nextending [Cassovary](http://github.com/twitter/cassovary) to support\nweighted edges provided the inspiration and somehow the impetus as well.\n\n[![Build Status](https://travis-ci.org/joshdevins/tuttle.png)](https://travis-ci.org/joshdevins/tuttle)\n\n## Overview\n\n - flexible vertex types, minimally storing node ID and edges to neighbours\n - support for both in and out-edges (directed) or undirected edges\n - supports arbitrary metadata on edges, for example weights\n - iteration over all nodes in the graph\n - iteration over all edges from a vertex\n - optional lookup by vertex ID\n - at a high level, agnostic to on-disk, serialization formats\n - for convenience, includes well-defined, serialization formats\n\n## Abstractions\n\nThe main abstractions that you will interact with include:\n\n - `Graph` -- the main interface to the graph as a whole, allowing you to\n              iterate over all vertices in the graph, and in some cases\n              also access individual vertices directly by ID\n - `Vertex` -- a single vertex in the graph, allowing you to iterate over all\n               edges to neighbours\n - `Edge` -- a directed or undirected edge connecting two vertices in the graph,\n             this is a concept only as edges are not maintained in memory as an\n             object as this is too costly for large graphs\n - `GraphReader` -- tools to build a `Graph` from a serialized format on disk\n\n## Other Options\n\nThis is a non-exhaustive list of Pregel-style frameworks for graph algorithms.\nThis does not include any number of linear algebra standard libraries in every\nother language you can think of.\n\n### Single Machine\n\n - [Cassovary](http://github.com/twitter/cassovary)\n - [GraphChi](http://graphlab.org/graphchi)\n\n### Distributed\n\nThese are typically [BSP](http://en.wikipedia.org/wiki/Bulk_Synchronous_Parallel)\nimplementations.\n\n - [Giraph](http://giraph.apache.org/)\n - [GraphLab](http://graphlab.org)\n - [Hama](http://hama.apache.org)\n\n## Credits\n\n - [SoundCloud](https://soundcloud.com/jobs) for allowing engineers to have 20%\n   projects such as this\n - [Cassovary](http://github.com/twitter/cassovary) and its' authors\n\n## Colophon\n\nWhat's a tuttle? Well, a tree is a graph and a tuttle tuttle tree is where ten\ntired turtles are. Since I have kids, I often get children's stories stuck in\nmy head. A Tuttle Tuttle Tree is a fictional tree in Dr. Seuess's\n[ABC](http://seuss.wikia.com/wiki/Dr._Seuss's_ABC) book. \"Big T little t what\nbegins with T? Ten tired turtles in a tuttle tuttle tree.\"\n\n## License\n\nThe MIT License (MIT)\n\nCopyright (c) 2013 SoundCloud, Josh Devins\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of\nthis software and associated documentation files (the \"Software\"), to deal in\nthe Software without restriction, including without limitation the rights to\nuse, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\nthe Software, and to permit persons to whom the Software is furnished to do so,\nsubject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\nFOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\nCOPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\nIN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\nCONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjoshdevins%2Ftuttle","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjoshdevins%2Ftuttle","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjoshdevins%2Ftuttle/lists"}