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.
Features
Thread-safe transactions with threading.Lock
Small, easy to learn API with around 100% coverage
Lazy generator based API when querying
Highly documented codebase
Installation
To install Graphlite, simply:
$ pip install graphlite
Release files for graphlite 1.0.5
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| graphlite-1.0.5.tar.gz | 6.1 kB | Details |
Release files / graphlite-1.0.5.tar.gz
| Download URL | graphlite-1.0.5.tar.gz |
|---|---|
| Size | 6.1 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
aa7b23dc0857055685b03c2d54864e20e5c584e821e328fced3b675d8f3fc9f0
|
|
BLAKE2b-256 checksum How to use checksums |
1556cee648eeb1537ab86b7363bacb1f254be0f00c38dd8de113da1091fa6a93
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |