embedded graph datastore
Graphlite is an MIT-licensed graph DB for Python.
There are currently no embedded graph databases for Python. Graphlite aims to change that by building a simple and fast graph layer over SQLite. Similar to FlockDB, Graphlite only stores adjacency lists, but they can be queried in the style of normal graph databases, e.g. with traversals.
>>> import graphlite as g >>> db = g.connect(':memory:', graphs=['knows']) >>> with db.transaction(): ... for person in [2, 3]: ... db.store(g.V(1).knows(person)) ... >>> db.find(g.V(1).knows).to(list) [2, 3]
Graphlite inherits it’s API from that of FlockDB’s. Also, like FlockDB Graphlite only stores the relations between the nodes, which are integers- not the data of the nodes themselves. You will therefore need a high performance database like BerkleyDB or one of the dbm implementations to store your data.
- Thread-safe transactions with threading.Lock
- Small, easy to learn API with around 100% coverage
- Lazy generator based API when querying
- Highly documented codebase
To install Graphlite, simply:
$ pip install graphlite
Release history Release notifications | RSS feed
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size graphlite-1.0.5.tar.gz (6.1 kB)||File type Source||Python version None||Upload date||Hashes View|