datalog alternatives and similar packages
Based on the "Database" category.
Alternatively, view datalog 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 datalog or a related project?
README
This is a pure Haskell implementation of Datalog, as a library
Datalog is a logic language that allows for recursive database queries. This implementation is distinguished from many others in that it is embeddable as a library in other (Haskell) programs. A driver program that operates on textual input is also planned.
It is currently just a semi-naive evaluator, but it is reasonably efficient. The implementation is currently in its early stages but it seems to produce reasonably correct results. See the test suite for some details.
Planned Enhancements
- Magic sets transformation
- Optional BDD backend for a subset of queries
- Rewrite literals like f(X,X) into f(X,Y), X=Y. A few internals assume that the same variable doesn't appear twice in a literal.