mutex007

6 ms·

1.
by mutex007 10y ago
I am curious how an inverted index will be implemented efficiently atop an LSM tree. Maybe batch parts of the posting list under a numeric key and when performing an intersection operation between two lists, you interate using a range sca
2.
Most popular algorithm for technology news aggregation(demanjo.com)
6 points by mutex007 12y ago|0 comments
3.
by mutex007 12y ago
elastic search will score no more than 7 points on our feature table. We are very aware of their product and currently running benchmarks on it. If you are interested, i can personally email you the results
4.
by mutex007 12y ago
we picked the most popular out of the RDBMS, NOSQL and newSQL world. In the future we will compare against more systems. We are actually in the process of releasing benchmarks as well for each of the above systems. We will be sure to includ
5.
by mutex007 12y ago
$700 annually. Please read well before you misrepresent us. By the way Partitioning by Hash and Range as we have stated means "Sharding"
6.
by mutex007 12y ago
The price is unbelievably fair. Try deploying mysql in the cloud and while you are at it, you get Redis as well for cache and then you hit the wall you need search in your application, so you deploy elastic search as a service as well. Do t
7.
by mutex007 12y ago
In the case of MongoDB, dump a blob called BSON which itself can be larger than the JSON itself. Paradoxically this is touted as a space efficient binary serialization you then read it back using an index or something.
8.
by mutex007 12y ago
By the way if you are looking for all the above functionality provided by all the DBMS you mentioned in a single DBMS instance, you can check out amisaserver.com. Polygot persistence is just another fad.
9.
by mutex007 12y ago
Sounds good to me. Might try it out.
10.
by mutex007 13y ago
Assuming your 70ms in transit is accurate, although you have not provided details on how you measured that. 20ms svr processing time is only 50 inserts per second which is simply untenable in respect to a high performing rethink.. In effect
11.
by mutex007 13y ago
Assuming a tcp connection can be established in 15ms worst case and another 10ms for data transmission, 65ms spent by the dbms for a single insert is incredibly slow. I am very aware of the increase in performance of batch inserts and batch
12.
by mutex007 13y ago
Just curious, how many indexes were on the structure you were inserting? Also, i am assuming 90ms per structure, if that is correct, then that is equal to 11 inserts per second which is unfortunately very slow..
13.
by mutex007 13y ago
Shameful self promotion. However i have to say the SQL and your type system makes me gravitate towards your platform. Can Kill mongoCache for sure