Drools VS SQLite

I've met a few young programmers who heard somewhere that object-oriented programming was bad and they want to get the enlightenment of functional programming that they've heard about. Frequently they travel from job to job like itinerant martial artists always looking for somewhere where they practice the true technique but they always seem disappointed as it is just as easy if not easier to screw up handling errors with monads than it is with exceptions and they find analogies like "a monad is like a burrito" just get them more confused.

As for something profound I'd point you to

https://github.com/cerner/clara-rules

which many people will struggle with because like many other production rules engines in LISP (and many other examples of simple compilers), there is hardly any code! Contrast that to the orders of magnitude larger rules engine Drools

https://github.com/kiegroup/drools

which is so crazy-complicated primarily because the Drools language is Java-based so you need all sorts of things that Clara or CLIPS don't need.

IMHO you're better off using something like https://www.drools.org/ for this. Non-devs writing code is a pipe-dream. It never works out.

https://www.drools.org/ an open source solution that allows you to use the UI to define rules. You can even import excel files.

Hi all, I am doing a project in rust right now (a web server with axum, postgres, redis), and am in need of a good rule engine like Drools in java (https://www.drools.org/). From what I have searched, I couldn't find any that are well maintained or provide similar levels of functionality.

Also ... https://www.drools.org/

Drools - Drools - Business Rules Management System (Java™, Open Source)

Drools (a Business Rule Engine),

Hopefully you already know that Drools is a business rules management system. You write rules in either "drl" syntax, in spreadsheets, or in glorified flowcharts, and then let your application throw data at it.

If you are into alternative storage engines for SQLite, there is also an LSM (Log-Structured Merge-tree) extension in the main repository that is not announced nor documented but seems to work. It’s based on the SQLite 4 project.

https://github.com/sqlite/sqlite/tree/master/ext/lsm1

https://www.charlesleifer.com/blog/lsm-key-value-storage-in-...

The sqlite code base is really well done. Lots of documentation.

https://github.com/sqlite/sqlite

Especially the VM part: https://github.com/spandanb/learndb-py/blob/master/learndb/v...

Compare it with this: https://github.com/sqlite/sqlite/blob/master/src/vdbe.c

That's said, I'm curious how complete this LearnDB is. SQLite is hard to read not only it's old but also it covers a lot of SQL and following SQL spec makes hings complicated. SQLite has great test suite so it's nice if you run the suit against this implementation.

Correct, see the github mirror[1]. I don't know how well supported that feature is compared to main branch. If it was completely stable, then it would have already landed in the main stable branch. Clarity about the roadmap of that branch would be nice.

1. https://github.com/sqlite/sqlite/tree/begin-concurrent

Including comprehensive comments, documentation and tests in a codebase takes time and effort.

Failing to do so creates code that is very difficult to maintain or for someone new to the codebase to understand.

However, time and effort may not be what the organization wants to pay for, and individuals may view their own incomprehensible code as something like job security, as they can't be replaced by someone else easily.

As an example of complicated code that's still well-documented, the open-source sqlite code is a good example, about 1/4 of the B-tree file is comments, every time a variable is defined there's a short note explaining what it's used for, every function has a comment header that's comprehensive, such that someone new to the codebase could construct a map of how it all works fairly quickly. It's a good model for how to avoid the problem:

https://github.com/sqlite/sqlite/blob/master/src/btree.c