[infinispan-dev] range query in Infinispan !!

Emmanuel Bernard emmanuel at hibernate.org
Mon May 14 13:48:35 EDT 2012


I agree with Sanne, Cassandra is very good at that use case due to the way they store things. OTOH, that's their best use case by far :)

We could think about a way to mix together:

- fine grained locking
- AtomicMap
- partial load

basically we could imagine some new primitive features for AtomicMap like:

- get subkeys between x and y
- add subkey (not requiring to load the AtomicMap)

That would get us a long way towards some of what MongoDB does wrt partial document update.

On 14 mai 2012, at 18:51, Sanne Grinovero wrote:

> On 14 May 2012 17:40, Prabhat Jha <pjha at redhat.com> wrote:
>> I have not used Infinispan's Query or Map/Reduce functionalities yet
>> because of them not being in JDG yet.
> 
> I see but even assuming we would start something new, it will likely
> take longer for it to eventually get into JDG compared to Query or
> Map/Reduce.
> 
>> Yes, we can use those to get what
>> I have mentioned. Query should be more straight forward and simpler than
>> M/R I think. But Query has dependency on Lucene and I have experienced
>> great pain in the past when using Lucene and FileSystem for shared storage.
> 
> Well Infinispan solves that problem, no shared filesystems ;)
> https://github.com/infinispan/infinispan/blob/master/lucene-directory/src/main/java/org/infinispan/lucene/InfinispanDirectory.java#L43
> 
> BTW cool that you have experience with it.. feel to start working more
> on this area?
> 
> 
>> My perspective is a bit different. I am arguing for a "simpler" solution
>> for a problem that I find to be very common. Similar to how in
>> Cassandra, you can easily query based on a time range and the order you
>> want.
> 
> I'm all for simplicity, but.. Cassandra is column oriented, so it can
> do some more tricks.. have you thought how this could be implemented
> on a distributed key value store like Infinispan?
> Unless you have a really neat idea, I'm not sure how simple that could be.
> 
>> 
>> On 05/14/2012 11:05 AM, Sanne Grinovero wrote:
>>> why "not using Query" ?
>>> 
>>> Such features are available in core using Map/Reduce; I don't think
>>> that different approaches should be provided by core otherwise, there
>>> is enough complexity in there...
>>> 
>>> Cheers,
>>> Sanne
>>> 
>>> On 14 May 2012 16:58, Prabhat Jha<pjha at redhat.com>  wrote:
>>>> Hi,
>>>> 
>>>> In QuickTweet we needed a way to get most recent x tweets for a user or
>>>> on a topic.  Currently we are implementing it by  keeping entries in the
>>>> cache and updating a bounded FIFO queue in parallel. However, to get
>>>> most recent data or data for a given time range is a very common use
>>>> case specially in social media applications. It would be good to see
>>>> this range feature available in out of box (not using Query) in upcoming
>>>> Infinispan releases.  Thoughts?
>>>> 
>>>> I can get it started by creating a Jira unless I hear otherwise.
>>>> 
>>>> Regards,
>>>> Prabhat
>>>> _______________________________________________
>>>> infinispan-dev mailing list
>>>> infinispan-dev at lists.jboss.org
>>>> https://lists.jboss.org/mailman/listinfo/infinispan-dev
>>> _______________________________________________
>>> infinispan-dev mailing list
>>> infinispan-dev at lists.jboss.org
>>> https://lists.jboss.org/mailman/listinfo/infinispan-dev
>> _______________________________________________
>> infinispan-dev mailing list
>> infinispan-dev at lists.jboss.org
>> https://lists.jboss.org/mailman/listinfo/infinispan-dev
> 
> _______________________________________________
> infinispan-dev mailing list
> infinispan-dev at lists.jboss.org
> https://lists.jboss.org/mailman/listinfo/infinispan-dev




More information about the infinispan-dev mailing list