Thanks all.
i've seen that there is no limit with HBase. I mean the following statement
: SELECT ... FROM ... LIMIT 1. (Because there is this method with Mongo^^)
Is it implemented ?
2011/8/11 Jason Rutherglen jason.rutherg...@gmail.com
Laurent,
This could be implemented with Lucene, eg,
Sorry for off topic, butĀ just as a sample to understand fundamental
difference:
1. SELECT COUNT will take few hours on MySQL InnoDB in most typical
cases, and _it_is_ implemented.
2. Same with HBase: full table scan. However, with MapReduce it might take
less time. Or, we can query Solr
Hi all,
I would like to know why MongoDB is faster than HBase to select items.
I explain my case :
I've inserted 4'000'000 lines into HBase and MongoDB and i must calculate
the geolocation with the IP. I calculate a Long number with the IP and i go
to find it into the 4'000'000 lines.
it's take 5
Hi Laurent,
Without more details on your schema and how you are finding that number in your
table it is impossible to fully answer the question. I suspect what you are
seeing is mongo's native support for secondary indexes. If you were to add
secondary indexes in HBase then retrieving that row
Yes, i have heard this index but is it available on hbase 0.90.3 ?
2011/8/10 Chris Tarnas c...@email.com
Hi Laurent,
Without more details on your schema and how you are finding that number in
your table it is impossible to fully answer the question. I suspect what you
are seeing is mongo's
You'll have to build your own secondary indexes for now.
On Wed, Aug 10, 2011 at 1:15 PM, Laurent Hatier laurent.hat...@gmail.comwrote:
Yes, i have heard this index but is it available on hbase 0.90.3 ?
2011/8/10 Chris Tarnas c...@email.com
Hi Laurent,
Without more details on your
On Wed, Aug 10, 2011 at 4:26 PM, Li Pi l...@cloudera.com wrote:
You'll have to build your own secondary indexes for now.
On Wed, Aug 10, 2011 at 1:15 PM, Laurent Hatier laurent.hat...@gmail.com
wrote:
Yes, i have heard this index but is it available on hbase 0.90.3 ?
2011/8/10 Chris
Mongodb does an excellent job at single node scalability - they use
mmap and many smart things and really kick ass ... ON A SINGLE NODE.
That single node must have raid (raid it going out of fashion btw),
and you wont be able to scale without resorting to:
- replication (complex setup!)
-
I'm just curious here. I'm working on a google summer of code project
currently that utilizes HBase and several times now I've made secondary
indices based on what I think are standard practices. Is there any
principled reason that this process couldn't be automated or is it just that
no one has
@hbase.apache.org
Subject: Re: Mongo vs HBase
Mongodb does an excellent job at single node scalability - they use
mmap and many smart things and really kick ass ... ON A SINGLE NODE.
That single node must have raid (raid it going out of fashion btw),
and you wont be able to scale without resorting
There have been a few attempts, some of them up to date, others deprecated.
See IHBase, IHTBase, and Lily.
Also see https://issues.apache.org/jira/browse/HBASE-3340
Lily is the only one which is up to date.
On Wed, Aug 10, 2011 at 8:07 PM, Blake Lemoine bal2...@gmail.com wrote:
I'm just
Laurent,
This could be implemented with Lucene, eg, HBASE-3529. Contact me
offline if you are interested in pursuing that angle.
Cheers.
On Wed, Aug 10, 2011 at 10:02 AM, Laurent Hatier
laurent.hat...@gmail.com wrote:
Hi all,
I would like to know why MongoDB is faster than HBase to select
12 matches
Mail list logo