baur

3 ms·

1. 1.▲
   by baur 3y ago

   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 extensions? I can i
2. 2.▲
   by baur 3y ago

   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 use explicit refr
3. 3.▲
   by baur 5y ago

   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.
4. 4.▲
   by baur 5y ago

   That's a nice idea. I guess it's better to stay in primitive type range (to avoid long arithmetics), so we can "compress" up to 15 items into a single prime_product making it less than 2^64 - for English words should be
5. 5.▲
   by baur 5y ago

   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
6. 6.▲
   by baur 5y ago

   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 memory for storing word