HGraphStorage alternatives and similar packages
Based on the "Database" category.
Alternatively, view HGraphStorage alternatives based on common mentions on social networks and blogs.
-
erd
Translates a plain text description of a relational database schema to a graphical entity-relationship diagram. -
-
-
-
-
-
-
-
-
-
-
-
HDBC-session
This repository includes a joined query generator based on typefull relational algebra, and mapping tools between SQL values list and Haskell record type. -
-
-
groundhog
This library maps datatypes to a relational model, in a way similar to what ORM libraries do in OOP. See the tutorial https://www.schoolofhaskell.com/user/lykahb/groundhog for introduction -
-
-
-
-
-
-
mysql-simple
A mid-level client library for the MySQL database, intended to be fast and easy to use. -
-
-
-
-
-
dbmigrations
DISCONTINUED. A library for the creation, management, and installation of schema updates for relational databases. -
-
-
-
-
-
-
-
-
-
-
-
ampersand
This repository contains the source code of the Ampersand compiler. For developing in VS-code, it contains a devcontainer. It contains a Dockerfile for generating a docker image. A commit on the main branch sets of the build street, which creates a new image in the ampersand repository in docker hub. -
-
-
hsparql
hsparql includes a DSL to easily create queries, as well as methods to submit those queries to a SPARQL server, returning the results as simple Haskell data structures.
CodeRabbit: AI Code Reviews for Developers
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of HGraphStorage or a related project?
README
HGraphStorage
This project aims at implementing a simple graph database. Compared to other Haskell projects, it doesn't work in memory but at the moment purely on disk. The idea is to play around with storage techniques and hope that the OS disk cache will make performance acceptable.
Storage
As much as possible, we try to rely on fixed length records so that an ID can easily translate into a file offset for quick reading. The format of the files on disk is inspired by the Neo4J format as explained in various Neo4J presentations.
Indices
There is also an on-disk implementation of a tree that can be used to index for example string values
Transactions, concurrency
Nothing of the sort is implemented yet! Currently, the "database" consists of Handles to files, so no concurrent access is offered. Again, this is more a research project to play around things that are not often discussed (database layout of files, etc.).
Contributing
Feel free to contribute if you want! Currently there is a test suite and a benchmark alongside with the library code. Looking at the tests and the benchmark will give you an idea of the API. It's very low level at the moment!