Kiba VS lru_redux

I started https://github.com/thbar/kiba#kiba-etl to scratch my own itch & be able to write properly structured ETL jobs in Ruby. It was a blank-slate rewrite of something larger (activewarehouse-etl) which I could not maintain anymore.

This landed me not strictly a job, but long term consulting gigs with a number of companies in EU, UK & US.

The job was directly related to the project: companies wanted the expertise of data engineering & ETL, often with Kiba directly, but also in general.

This "side project" was totally worth it :-)

Definitely! As a matter of fact, this is the default data structure I use when writing Ruby ETL code (e.g. https://github.com/thbar/kiba/wiki).

Methods like "except" (https://docs.ruby-lang.org/en/3.2/Hash.html#method-i-except) or "fetch" (raising an error on missing key) are very convenient to write defensive data processing code!

Similarly, in Elixir, I use Maps a lot for the same type of jobs (https://hexdocs.pm/elixir/1.15.4/Map.html), with similar properties.

Ruby has a very cool ETL library named Kiba that fits wonderfully with Ruby's strengths.

Though it might be overkill for your problem, but have you had a look at [kiba-etl](https://github.com/thbar/kiba/blob/master/README.md)?

Kiba

If you don’t use Kiba, but work with data, check it out.

Yeah, you can use it to implement a simple (but not necessarily very performant) LRU: https://github.com/SamSaffron/lru_redux/blob/037ee594aded597...

In a non-Rails app, we want to limit the hash size, evicting the oldest or least recently used items. LruRedux is a nice implementation.