Single-Table NoSQL-ish In-Memory Database
This Ruby gem manages an in-memory database of facts. A fact is simply a map of properties and values. The values are either atomic literals or non-empty sets of literals. It is possible to delete a fact, but impossible to delete a property from a fact.
ATTENTION: The current implemention is naive and,
because of that, very slow. I will be very happy
if you suggest a better implementation without the change of the interface.
The Factbase::query() method is what mostly needs performance optimization:
currently it simply iterates through all facts in the factbase in order
to find those that match the provided terms. Obviously,
even a simple indexing may significantly increase performance.
Here is how you use it (it's thread-safe, by the way):
fb = Factbase.new
f = fb.insert
f.kind = 'book'
f.title = 'Object Thinking'
fb.query('(eq kind "book")').each do |f|
f.seen = true
end
fb.insert
fb.query('(not (exists seen))').each do |f|
f.title = 'Elegant Objects'
end
You can save the factbase to the disc and then load it back:
file = '/tmp/simple.fb'
f1 = Factbase.new
f = f1.insert
f.foo = 42
File.save(file, f1.export)
f2 = Factbase.new
f2.import(File.read(file))
assert(f2.query('(eq foo 42)').each.to_a.size == 1)
You can check the presence of an attribute by name and then set it, also by name:
n = 'foo'
if f[n].nil?
f.send("#{n}=", 'Hello, world!')
end
There are some boolean terms available in a query
(they return either true or false):
(always)and(never)aretrueandfalse(nil v)istrueifvisnil(not b)is the inverse ofb(or b1 b2 ...)istrueif at least one argument istrue(and b1 b2 ...)— if all arguments aretrue(when b1 b2)— ifb1istrueandb2istrueorb1isfalse(exists p)— ifpproperty exists(absent p)— ifpproperty is absent(zero v)— if anyvequals to zero(eq v1 v2)— if anyv1equals to anyv2(lt v1 v2)— if anyv1is less than anyv2(gt v1 v2)— if anyv1is greater than anyv2(many v)— ifvhas many values(one v)— ifvhas one value
There are string manipulators:
(concat v1 v2 v3 ...)— concatenates allv(sprintf v v1 v2 ...)— creates a string byvformat with params(matches v s)— if anyvmatches thesregular expression
There are a few terms that return non-boolean values:
(at i v)is thei-th value ofv(size v)is the cardinality ofv(zero ifvisnil)(type v)is the type ofv("String","Integer","Float","Time", or"Array")(either v1 v1)isv2ifv1isnil
It's possible to modify the facts retrieved, on fly:
(as p v)adds propertypwith the valuev(join s t)adds properties named by thesmask with the values retrieved by thetterm, for example,(join "x<=foo,y<=bar" (gt x 5))will addxandyproperties, setting them to values found in thefooandbarproperties in the facts that match(gt x 5)
Also, some simple arithmetic:
(plus v1 v2)is a sum of∑v1and∑v2(minus v1 v2)is a deducation of∑v2from∑v1(times v1 v2)is a multiplication of∏v1and∏v2(div v1 v2)is a division of∏v1by∏v2
It's possible to add and deduct string values to time values, like
(plus t '2 days') or (minus t '14 hours').
Types may be converted:
(to_int v)is an integer ofv(to_str v)is a string ofv(to_float v)is a float ofv
One term is for meta-programming:
(defn f "self.to_s")defines a new term using Ruby syntax and returnstrue(undef f)undefines a term (nothing happens if it's not defined yet), returnstrue
There are terms that are history of search aware:
(prev p)returns the value ofpproperty in the previously seen fact(unique p)returns true if the value ofpproperty hasn't been seen yet
The agg term enables sub-queries by evaluating the first argument (term)
over all available facts, passing the entire subset to the second argument,
and then returning the result as an atomic value:
(lt age (agg (eq gender 'F') (max age)))selects all facts where theageis smaller than the maximumageof all women(eq id (agg (always) (max id)))selects the fact with the largestid(eq salary (agg (eq dept $dept) (avg salary)))selects the facts with the salary average in their departments
There are also terms that match the entire factbase
and must be used primarily inside the (agg ..) term:
(nth v p)returns thepproperty of the v-th fact (must be a positive integer)(first p)returns thepproperty of the first fact(count)returns the tally of facts(max p)returns the maximum value of thepproperty in all facts(min p)returns the minimum(sum p)returns the arithmetic sum of all values of thepproperty
It's also possible to use a sub-query in a shorter form than with the agg:
(empty q)is true if the subqueryqis empty
There are some system-level terms:
(env v1 v2)returns the value of environment variablev1or the stringv2if it's not set
How to contribute
Read these guidelines. Make sure you build is green before you contribute your pull request. You will need to have Ruby 3.2+ and Bundler installed. Then:
bundle update
bundle exec rake
If it's clean and you don't see any error messages, submit your pull request.
Benchmark
This is the result of the benchmark:
| Action | Seconds | Details |
|---|---|---|
fb.insert() |
7.800 | Inserted 100000 facts |
(gt time '2024-03-23T03:21:43Z') |
0.070 | Found 100000 fact(s) |
(gt cost 50) |
0.072 | Found 49779 fact(s) |
(eq title 'Object Thinking 5000') |
0.050 | Found 1 fact(s) |
(and (eq foo 42.998) (or (gt bar 200) (absent zzz))) |
0.060 | Found 0 fact(s) |
(eq id (agg (always) (max id))) |
0.131 | Found 1 fact(s) |
(join "c<=cost,b<=bar" (eq id (agg (always) (max id)))) |
0.708 | Found 100000 fact(s) |
.export() + .import() |
2.110 | 11407716 bytes |
The results were calculated in this GHA job on 2025-01-27 at 16:25, on Linux with 4 CPUs.