(11/10/10 23:09), Sean Cribbs wrote:
Hi,
1. The design of secondary indexes is based on "document partitioning",
which makes it very simple to keep indexes consistent with the objects
they reference, but does mean that queries will have to communicate with
a "covering set" of partitions, more or less (Ring Size / N) of them.
This design is the dual of Riak Search's design, or "term
partitioning", which only requires one partition to respond for a given
index/field/term, but can be prone to hotspots.
I do not know of any comparisons to Cassandra's secondary index feature.
2. See #1. It is stored in the same place as the objects themselves,
which means queries need to contact many partitions.
Thank you for your answer :)
I understood the overview of the architecture.
On Mon, Oct 10, 2011 at 4:56 AM, OZAWA Tsuyoshi
<ozawa.tsuyo...@gmail.com <mailto:ozawa.tsuyo...@gmail.com>> wrote:
Hi,
I have 2 questions about the riak's new feature - secondary index.
1. Is there the scalability benchmark of the secondary index feature? I
read some blog about the implementation of riak secondary index, but it
seems to run scanning across mostly all nodes at worst case if my
expectation is correct. Secondary index feature of riak is more scalable
than the one of Cassandra?
2. Where is the metadata which the nodes contain the indexed data? Is it
distributed across riak storage servers by consistent hashing?
Thank you.
Best Regards,
OZAWA Tsuyoshi
_______________________________________________
riak-users mailing list
riak-users@lists.basho.com <mailto:riak-users@lists.basho.com>
http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com
--
Sean Cribbs <s...@basho.com <mailto:s...@basho.com>>
Developer Advocate
Basho Technologies, Inc.
http://www.basho.com/
_______________________________________________
riak-users mailing list
riak-users@lists.basho.com
http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com
