Hello,
We have been working on a distributed data proxy for Cassandra. A data
proxy is a combination of proxy and caching that also takes care of data
consistency and invalidation for insert and updates. In addition, the data
proxy is distributed based on consistent hashing and using gossip
onsistent hashing and using gossip between data proxy nodes to keep the
> cached data unique (per node) and consistent", did you re-implement
> Consistent hashing and gossip algorithm from scratch in your proxy layer ?
>
> Regards
>
> On Mon, Jun 11, 2018 at 5:46 PM, Chidamber
ng the
> converged result usually ends up to be a bigger win and easier to
> manage/invalidate. So memcached/redis/etc outside of the result still
> usually ends up better.
>
>
>
>
> On Mon, Dec 14, 2020 at 9:44 AM Chidamber Kulkarni
> wrote:
>
>> Hello All,
>>
Hello All,
Wondering if anyone has tried to modify the row-cache API to use both the
partition key and the clustering keys to convert the row-cache, which is
really a partition cache today, into a true row-cache? This might help with
broader adoption of row-cache for use-cases with large
