Vladimir,
What do you think about my high-level solution shared in the previous
email? What if we implement the SortedSet they way I suggested?
-
Denis
On Tue, Sep 8, 2020 at 4:15 AM Vladimir Pligin wrote:
> Denis,
>
> I absolutely agree with you that a SortedSet doesn't need to be
> partitio
Denis,
I absolutely agree with you that a SortedSet doesn't need to be partitioned.
The main idea I wanted to put attention on is that now it's not possible to
find a row with a particular number with log complexity. We need to scan
node-local index until we reach some offset, it seems to be linea
Folks, please disregard my previous email. I confused the range search task
when (the search boundaries are defined in a query) with the K largest
elements problem described by Vladimir.
Personally, I don't think there is a practical need for partitioned sorted
sets. Even if you store thousands of
Hi Vladimir,
As far as I know, Redis' SortedSet is not shared. Is this correct? Is it
even possible to support similar functionality for a partitioned dataset?
-Val
On Fri, Sep 4, 2020 at 8:58 AM Denis Magda wrote:
> Hi Vladimir,
>
> Usually, LSM-storage engines serve the range searches the be
Hi Vladimir,
Usually, LSM-storage engines serve the range searches the best (Cassandra
is one of the examples). The SortedSet of Redis is one of the typical
components you can find in LSM-engines.
Presently, Ignite neither supports an LSM store nor a SortedSet data
structure. However, the range s
Hi Igniters,
It seems that it's not possible to implement effective leader-board with the
current Ignite indexes.
Leader-board stores a score and an id of a player of some game. Score is
indexed. One of the possible requests to that data structure is to get some
range of scores based on their rank
