CrateDB might be a good fit for full text and vector search (it’s SQL database but has dedicated clauses for FT and VS). Curious how do you use PG for key/value and queue - do you use regular tables or some specific…
Yep, CrateDB is not ACID but has eventual consistency at the row level. I think for some use cases it's fine that some inserts are not visible in search results immediately. Also, once could tweak refresh_interval or…
[dead]
Congrats on the launch! Just wondering, do you have any plans to support CrateDB? It supports SQL and understands PG protocol - perhaps supporting Postgres kinda already makes it close.
Trie also can be used as a hashset/map, roughly it's like hash(obj).toString is a "word" for a trie and in the leaf we store the object. It's https://en.wikipedia.org/wiki/Hash_array_mapped_trie which used in Scala's…
Nice implementation! There is an option to get all suffixes without traversing subtree, but it comes with extra O(N) memory where N is combined length of all stored words - depending on case might be acceptable since…
CrateDB might be a good fit for full text and vector search (it’s SQL database but has dedicated clauses for FT and VS). Curious how do you use PG for key/value and queue - do you use regular tables or some specific…
Yep, CrateDB is not ACID but has eventual consistency at the row level. I think for some use cases it's fine that some inserts are not visible in search results immediately. Also, once could tweak refresh_interval or…
[dead]
Congrats on the launch! Just wondering, do you have any plans to support CrateDB? It supports SQL and understands PG protocol - perhaps supporting Postgres kinda already makes it close.
Trie also can be used as a hashset/map, roughly it's like hash(obj).toString is a "word" for a trie and in the leaf we store the object. It's https://en.wikipedia.org/wiki/Hash_array_mapped_trie which used in Scala's…
Nice implementation! There is an option to get all suffixes without traversing subtree, but it comes with extra O(N) memory where N is combined length of all stored words - depending on case might be acceptable since…