On 23 January 2014 18:03, Dan Berindei dan.berin...@gmail.com wrote:
On 22 Jan 2014 16:10, Pedro Ruivo pe...@infinispan.org wrote:
On 01/22/2014 01:58 PM, Dan Berindei wrote:
It would also require us to keep a SetK for each group, with the keys
associated with that group. As such,
On 23 January 2014 17:54, Mircea Markus mmar...@redhat.com wrote:
On Jan 23, 2014, at 5:48 PM, William Burns mudokon...@gmail.com wrote:
Hello all,
I have been working with notifications and most recently I have come
to look into events generated when a new entry is created. Now
normally
On 01/27/2014 09:20 AM, Sanne Grinovero wrote:
On 23 January 2014 18:03, Dan Berindei dan.berin...@gmail.com wrote:
On 22 Jan 2014 16:10, Pedro Ruivo pe...@infinispan.org wrote:
On 01/22/2014 01:58 PM, Dan Berindei wrote:
It would also require us to keep a SetK for each group, with the
On 27 January 2014 09:38, Pedro Ruivo pe...@infinispan.org wrote:
On 01/27/2014 09:20 AM, Sanne Grinovero wrote:
On 23 January 2014 18:03, Dan Berindei dan.berin...@gmail.com wrote:
On 22 Jan 2014 16:10, Pedro Ruivo pe...@infinispan.org wrote:
On 01/22/2014 01:58 PM, Dan Berindei wrote:
I think it's way too early to discuss removing FineGrainedAtomicMap and
AtomicMap, as long as we don't have a concrete alternative with similar
properties.
Cache.getGroup(groupName) is just a method name at this point, we don't
have any idea how it will compare to AtomicMap/FineGrainedAtomicMap
On 01/27/2014 09:52 AM, Sanne Grinovero wrote:
On 27 January 2014 09:38, Pedro Ruivo pe...@infinispan.org wrote:
On 01/27/2014 09:20 AM, Sanne Grinovero wrote:
On 23 January 2014 18:03, Dan Berindei dan.berin...@gmail.com wrote:
On 22 Jan 2014 16:10, Pedro Ruivo pe...@infinispan.org
I'd be curious to see performance tests on Pedro's approach (ie walk
through the entire data key set to find the matching elements of a given
group). That might be fast enough but that looks quite scary compared to
a single lookup.
Any doc explaining how FGAM is broken in transactions for
On 01/27/2014 12:26 PM, Emmanuel Bernard wrote:
I'd be curious to see performance tests on Pedro's approach (ie walk
through the entire data key set to find the matching elements of a given
group). That might be fast enough but that looks quite scary compared to
a single lookup.
I would
On Mon, Jan 27, 2014 at 2:43 PM, Pedro Ruivo pe...@infinispan.org wrote:
On 01/27/2014 12:26 PM, Emmanuel Bernard wrote:
I'd be curious to see performance tests on Pedro's approach (ie walk
through the entire data key set to find the matching elements of a given
group). That might be
On 01/27/2014 01:38 PM, Dan Berindei wrote:
On Mon, Jan 27, 2014 at 2:43 PM, Pedro Ruivo pe...@infinispan.org
mailto:pe...@infinispan.org wrote:
On 01/27/2014 12:26 PM, Emmanuel Bernard wrote:
I'd be curious to see performance tests on Pedro's approach (ie walk
through
On Jan 27, 2014, at 1:38 PM, Dan Berindei dan.berin...@gmail.com wrote:
On Mon, Jan 27, 2014 at 2:43 PM, Pedro Ruivo pe...@infinispan.org wrote:
On 01/27/2014 12:26 PM, Emmanuel Bernard wrote:
I'd be curious to see performance tests on Pedro's approach (ie walk
through the entire
On Jan 27, 2014, at 2:02 PM, Pedro Ruivo pe...@infinispan.org wrote:
On 01/27/2014 01:38 PM, Dan Berindei wrote:
On Mon, Jan 27, 2014 at 2:43 PM, Pedro Ruivo pe...@infinispan.org
mailto:pe...@infinispan.org wrote:
On 01/27/2014 12:26 PM, Emmanuel Bernard wrote:
I'd be curious
12 matches
Mail list logo
