70 karma · joined August 12, 2018
local expires_at = tonumber(redis.call("get", expires_at_key))
if not expires_at or expires_at < current_time then
-- this is either a brand new window,
-- or this window has closed, but redis hasn't cleaned up the key yet
-- (redis will clean it up in one more second)
-- initialize a new rate limit window
redis.call("set", rate_limit_key, 0)
redis.call("set", expires_at_key, next_expires_at)
Between the time the `get` is called and the `set` is called there might parallel call that might create the key and the `set` will override it.I would start with a low level language like C, then move to a more higher level like Java and finally end with a more "modern" language like Rust or Go.
I also pointed bellow to the specific relevant area in the docs.
> 1. What human languages does it support. > 2. In these human languages how does stemming and decompounding work in your implementation.
https://oss.redislabs.com/redisearch/Stemming/
> 3. how is word importance determined in your index - TF-IDF? other algorithm? Are least important words automatically dropped from queries? >4. Do you have ability to rank on both the stemmed/decompounded query/results and exact matches? So something like raw field access.
Interesting how such probabilistic data structures can in most cases behave almost as good as deterministic.