graph

Gremlin is an imperative "language", Cypher is declarative. The first lets you specify what will be performed, the latter describes the wished result and lets the query optimizer translate it to actual operations to retrieve it.

In a way, with Gremlin you have the absolute freedom on how to perform the traversal. With Cypher, you're working at a higher level with all the advantages of such approach

Book

http://www.amazon.com/gp/product/1491930896/ref=as_li_tl?ie=UTF8&camp=1789&creative=390957&creativeASIN=1491930896&linkCode=as2

https://news.ycombinator.com/item?id=9699102 various graph db

http://habrahabr.ru/post/253031/

https://github.com/amark/gun Graph DB in JS

https://github.com/TechInvestLab/dot15926

https://medium.com/@neunhoef/graphs-in-data-modeling-is-the-emperor-naked-2e65e2744413

http://www.jot.fm/issues/issue_2014_07/article3.pdf

http://blog.shriphani.com/2015/04/06/the-smallest-eigenvalues-of-a-graph-laplacian/

https://github.com/solidsnack/GraphpostgresQL

https://www.youtube.com/watch?v=rpDt_915jU0

http://nitrosdata.com/

Titan

http://www.datastax.com/2015/02/datastax-acquires-aurelius-the-experts-behind-titandb

http://www.slideshare.net/DeniseKoesslerGosnel/tinkerpop-and-titan-from-a-python-state-of-mind

https://groups.google.com/forum/#!topic/aureliusgraphs/WTNYYpUyrvw

https://news.ycombinator.com/item?id=10202674

http://thinkaurelius.github.com/titan/

http://blog.clojurewerkz.org/blog/2013/02/11/introducing-titanium/

https://www.gitbook.com/book/jaceklaskowski/titan-scala/details

http://key-value-stories.blogspot.com/2015/02/neo4j-architecture.html

http://www.frankmcsherry.org/graph/scalability/cost/2015/02/04/COST2.html

http://linkurio.us/graph-viz-101/

http://christophermanning.org/projects/building-cubic-hamiltonian-graphs-from-lcf-notation/

http://ubietylab.net/

https://news.ycombinator.com/item?id=8901983

http://hackingdistributed.com/2014/12/16/introducing-weaver/

http://avaxhome.cc/ebooks/science_books/1584884126Graph.html BOOK

https://www.youtube.com/channel/UCmLB71obuOBLMdWCQUI-DiA

http://blog.opencog.org/2013/03/24/why-hypergraphs/

https://news.ycombinator.com/item?id=7914571

http://www.kennybastani.com/2014/06/hierchical-pattern-recognition.html

https://github.com/google/cayley written in Go

GraphViz

http://noumlaut.com/graphviz-cookbook

http://new.livestream.com/accounts/7874891/events/3201752 GraphLab

http://www.metreeca.it/products/graph-rover/

http://en.docsity.com/news/programming-2/graph-problems-algorithms-presented-animations/

http://amplab.github.io/graphx/

https://spark.apache.org/docs/1.0.0/graphx-programming-guide.html

https://github.com/tinkerpop/blueprints/wiki - большое количество разных графовых БД.

http://infolab.stanford.edu/gps/

https://news.ycombinator.com/item?id=7909414

http://www.ibm.com/developerworks/library/os-giraph/ - вот здесь говорится, что графовая БД Neo4j - говно.

http://en.wikipedia.org/wiki/Graph_drawing

http://ceur-ws.org/Vol-733/paper_pacher.pdf - одномерная вариация

http://en.wikipedia.org/wiki/Force-directed_graph_drawing

используется для повышения локальности.

http://www.cs.ox.ac.uk/dan.olteanu/papers/g-store.pdf - здесь не просто алгоритм а более-менее полная подсистема хранения, где используется фоновая локализация, подобная cleaning в log structured fs.

http://graphlab.org/files/osdi2012-kyrola-blelloch-guestrin.pdf

http://de.slideshare.net/MaxKlymyshyn/odessapy2013-pdf GraphDBs and Python

https://news.ycombinator.com/item?id=6866841

http://www.reddit.com/r/Python/comments/1t61ux/graphtool_efficent_network_analysis_with_python/ graph-tool

http://habrahabr.ru/post/214515/

http://www.scala-graph.org/

http://new.livestream.com/hugeinc/events/2474611

https://www.facebook.com/notes/facebook-engineering/under-the-hood-building-out-the-infrastructure-for-graph-search/10151347573598920

http://graphbin.co/

http://hashrocket.com/blog/posts/using-datomic-as-a-graph-database

https://www.youtube.com/watch?v=kg2x6K3IbhY

http://www.infoq.com/articles/data-modeling-graph-databases

Graph DB internals/implementation

http://g-store.sourceforge.net/

http://sites.computer.org/debull/A12mar/vicol.pdf Virtuoso internals

http://sigops.org/sosp/sosp13/papers/p472-roy.pdf

http://arxiv.org/abs/1310.5698

X-Stream: Edge-centric Graph Processing Streaming Partitions

http://sigops.org/sosp/sosp13/papers/p456-nguyen.pdf A Lightweight Infrastructure for Graph Analytics

http://db.disi.unitn.eu/pages/VLDBProgram/pdf/IMDM/paper1.pdf

http://www.google.com/patents/US20130103725

http://sigops.org/sosp/sosp13/program.html

http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/

CHex: An Efficient RDF Storage and Indexing Scheme for Column-Oriented Databases

http://www.mecs-press.org/ijmecs/ijmecs-v3-n3/IJMECS-V3-N3-8.pdf

A Distributed Graph Engine for Web Scale RDF Data

http://research.microsoft.com/pubs/183717/Trinity.RDF.pdf

http://research.microsoft.com/pubs/157417/GSPARQL.pdf

http://dl.acm.org/citation.cfm?id=2351489

http://habrahabr.ru/post/240295/ Sparql

Un-named

http://yarcdata.com/blog/

http://infolab.stanford.edu/~ullman/focs/ch09.pdf

http://beta.sylvadb.com/

Benchmarking

http://ldbc.eu/blog

http://istc-bigdata.org/index.php/benchmarking-graph-databases/

http://tm.durusau.net/?p=41066 benchmark

http://nuvolabase.blogspot.it/2013/04/xdgbench-3rd-party-benchmark-results.html

http://markorodriguez.com/2011/02/08/property-graph-algorithms/

http://en.wikipedia.org/wiki/Graph_Modelling_Language GML (graph modelling language)

http://www.meetup.com/graphdb-seattle/

http://habrahabr.ru/company/surfingbird/blog/185622/

http://www.open-graphtheory.org/

http://markorodriguez.com/

http://code.google.com/p/graphbook/

http://www.graph-database.org/

Orientdb

http://www.orientdb.org/

https://github.com/orientechnologies/orientdb

http://warriorkitty.com/site/importing-movielens-into-orientdb-graph-database/

http://odino.org/an-overview-of-orientdbs-capabilities/

http://habrahabr.ru/post/214837/

https://www.udemy.com/orientdb-getting-started/

http://graphlab.org/

http://graphlab.org/graphchi/

http://blog.smola.org/ Alex Smola blog

http://www2013.org/papers/proceedings.htm

http://thinkaurelius.com/2013/05/13/educating-the-planet-with-pearson/

https://01.org/graphbuilder/sites/default/files/documentation/graphbuilder-whitepaper.pdf

http://software.intel.com/en-us/articles/graphbuilder-scalable-graph-construction-for-big-data-open-source-code-release

http://tm.durusau.net/?cat=460

TSORT(1) BSD General Commands Manual TSORT(1)

https://en.wikipedia.org/wiki/Tsort

http://www.opensource.apple.com/source/misc_cmds/misc_cmds-31/tsort/tsort.c

NAME

tsort -- topological sort of a directed graph

SYNOPSIS

tsort [-l] [-q] [file]

DESCRIPTION

tsort takes a list of pairs of node names representing directed arcs in a graph and prints the nodes in topological

order on standard output. Input is taken from the named file, or from standard input if no file is given.

Node names in the input are separated by white space and there must be an even number of node pairs.

Presence of a node in a graph can be represented by an arc from the node to itself. This is useful when a node is

not connected to any other nodes.

If the graph contains a cycle (and therefore cannot be properly sorted), one of the arcs in the cycle is ignored and

the sort continues. Cycles are reported on standard error.

Graphical Models

https://class.coursera.org/pgm-003/class/index

https://www.coursera.org/course/pgm

https://github.com/eBay/bayesian-belief-networks PYTHON from ebay

http://en.wikipedia.org/wiki/Graphical_model

http://videolectures.net/mlss07_ghahramani_grafm/

http://www.cs.ubc.ca/~murphyk/Software/bnsoft.html Software

http://en.wikipedia.org/wiki/Factor_graph

http://dimple.probprog.org/

http://scalahypergraph.blogspot.com/

http://homepages.inf.ed.ac.uk/libkin/publ.html

http://www.knewton.com/tech/blog/2012/02/graphlint-creating-a-domain-specific-language-for-graph-validation/

http://www.dis.uniroma1.it/challenge9/download.shtml

http://blog.getprismatic.com/blog/2013/2/1/graph-abstractions-for-structured-computation

http://www.reddit.com/r/programming/comments/18978h/introduction_to_graph_theory_finding_the_shortest/

http://maxburstein.com/blog/intro-to-graph-theory-finding-shortest-path-part2/

http://interactivepython.org/courselib/static/pythonds/Graphs/graphshortpath.html

http://ayende.com/blog/4490/that-no-sql-thing-scaling-graph-databases

SQL

http://en.wikipedia.org/wiki/Hierarchical_and_recursive_queries_in_SQL

http://www.sqlsummit.com/AdjacencyList.htm

http://www.graph-database.org/tag/sql/

http://msdn.microsoft.com/en-us/magazine/jj863138.aspx

http://adventuresinsoftware.com/blog/?p=165

http://hansolav.net/sql/graphs.html

http://www.codeproject.com/Articles/22824/A-Model-to-Represent-Directed-Acyclic-Graphs-DAG-o

C++

https://github.com/GraphChi/graphchi-cpp GraphChi - disk-based large-scale graph computation

http://snap.stanford.edu/snap/quick.html

http://lemon.cs.elte.hu/trac/lemon

http://scicomp.stackexchange.com/questions/4722/i-am-looking-for-a-parallel-dynamic-graph-library-in-c

https://github.com/richelbilderbeek/boostgraphtutorial Boost.Graph

https://01.org/graphbuilder/

http://logic.pdmi.ras.ru/csclub/courses/ontology

Python Graphs Algo

https://pypi.python.org/pypi/python-graph/

http://habrahabr.ru/post/112421/

https://bitbucket.org/nidusfr/grapheekdb

http://jeremykun.com/2013/08/22/the-erdos-renyi-random-graph/

http://projects.skewed.de/graph-tool/

http://bulbflow.com/overview/

Books

http://graphdatabases.com/

Graph Algorithms in the Language of Linear Algebra

http://avaxhome.ws/ebooks/science_books/math/2013-01-14-64-0898719909.html

http://e-maxx.ru/bookz/

http://shop.oreilly.com/product/0636920028246.do?code=DRM2013

http://cstheory.stackexchange.com/questions/11855/how-do-the-state-of-the-art-pathfinding-algorithms-for-changing-graphs-d-d-l

Algorithms

https://en.wikipedia.org/wiki/Category:Graph_algorithms

https://en.wikipedia.org/wiki/Belief_propagation

http://en.wikipedia.org/wiki/Expectation_propagation

http://algs4.cs.princeton.edu/40graphs/

http://6brand.com/solving-8-puzzle-with-artificial-intelligence.html

HyperGraph

http://blog.opencog.org/2013/03/24/why-hypergraphs/

Graph Databases

http://www.oplicate.com/books/6104450512 Titan

http://www.w3.org/community/propertygraphs/

http://www.yarcdata.com/

http://tm.durusau.net/?p=44106

http://www.ibm.com/developerworks/library/os-giraph/

http://www.bigdata-startups.com/open-source-tools/graph/

http://www.sparsity-technologies.com/dex DEX

http://readwrite.com/2011/04/20/5-graph-databases-to-consider

http://giraph.apache.org/

https://blog.twitter.com/2012/cassovary-big-graph-processing-library

http://jasperpeilee.wordpress.com/2011/11/25/a-survey-on-graph-databases/

http://nosql.mypopescu.com/post/40759505554/a-comparison-of-7-graph-databases

http://nuvolabase.blogspot.com/2013/04/orientdb-new-graphdb-engine-in-beta.html

http://www.orientdb.org/ Open Source (Java)

http://www.velocitygraph.com/ C# open source

http://www.objectivity.com/

http://www.hypergraphdb.org/index

http://bulbflow.com/overview/

http://www.tinkerpop.com/

http://en.wikipedia.org/wiki/Graph_database

http://blog.octo.com/en/introduction-to-large-scale-graph-processing/

The transitive closure of a graph G = (V,E) is a graph G* = (V,E*) such that E* contains an edge (u,v) if and only if G contains a path (of at least one edge) from u to v. The transitive_closure() function transforms the input graph g into the transitive closure graph tc.