nikita

26 ms·

361.
by nikita 8y ago
MemSQL CEO here. There are a few: - MemSQL is transactional and writes transactions on disk - MemSQL has an excellent implementation of SQL with mature query optimization and query execution. And it get better every release. This is from 6.
362.
by nikita 9y ago
This is an astute observation. Here is the accurate answer from the author of the feature: “We do have special handling for RLE for filters and group by column but in both cases there would be per row component (updating selection vector fo
363.
by nikita 9y ago
Can you share the whole use case as well as data size?
364.
by nikita 9y ago
We can solve it quite efficiently. You can define an index on a columnstore table and we will maintain order on a per node basis
365.
by nikita 9y ago
Data ingest scales linearly assuming the source is scalable (S3, HDFS, or Kafka). There are other things that matter: how wide is the table, what data types, etc. We achieve 1GB/s on a 16 nodes cluster for some combination of the above
366.
by nikita 9y ago
We have seen 1Gb/s streaming ingest into MemSQL. Also feel free to join https://memsql-public.slack.com where people help with developer edition.
367.
by nikita 9y ago
That’s right: partitioning on stock symbol allows to push down LIMIT 10 to each partition, however in this case with 1500 stock symbols it doesn’t buy us much. It’s actually possible to compute a full group by (without a limit) by on every
368.
by nikita 9y ago
There is a clustered columnstore index on the table. MemSQL doesn’t support “filtered” indexes (indexes that let you specify a where clause that can be matched in a query with an equal or stricter where clause). Since the query needs a full
369.
by nikita 9y ago
The query in the example is not “count” but a count + group by query. While it is possible to precompute group by results on every possible columns per page we don’t do that and this query does touch every row. The article touches on how th
370.
Real-time sentiment analysis of election tweets(election.memsql.com)
1 points by nikita 10y ago|0 comments
371.
Real-time sentiment analysis of the debate(election.memsql.com)
3 points by nikita 10y ago|1 comments
372.
Code Generation: The Inner Sanctum of Database Performance(highscalability.com)
18 points by nikita 10y ago|0 comments
373.
New Reference Benchmark for Real-Time Analytics(blog.memsql.com)
9 points by nikita 10y ago|0 comments
374.
MemSQL 5 Ships with LLVM-Based Code Generation for SQL Queries(blog.memsql.com)
5 points by nikita 11y ago|0 comments
375.
by nikita 11y ago
will do!
376.
by nikita 11y ago
eric at and nikita at memsql.
377.
by nikita 11y ago
Could you please elaborate? Do you mean approximate joins as in this talk? http://www2.research.att.com/~divesh/papers/ks2005-aj-tutori...
378.
by nikita 11y ago
When MemSQL is configured for synchronous durability and all databases are configured with synchronous replication, Jepsen confirms that writes to MemSQL are durable and acknowledged appropriately. As part of testing for the 4.0 release, we
379.
Shaping Big Data Through Constraints Analysis(infoq.com)
7 points by nikita 11y ago|0 comments
380.
Fast Overlap Ad Targeting Over 200Bln Data Points(blog.memsql.com)
4 points by nikita 12y ago|0 comments
381.
Turn Up the Volume with High-Speed Counters(blog.memsql.com)
11 points by nikita 12y ago|1 comments
382.
by nikita 12y ago
The first example is really dangerous. We recently had a issue with GCC not optimizing a tail recursion in a relatively large function with parameters passed in as references to std collections. The result - it was running out of stack spac
383.
by nikita 12y ago
- C-store paper - Provably correct lockfree skiplist - Mass tree - BW Tree
384.
by nikita 12y ago
It's hard to define what a "fair" columnar store scan is. We use a technique that is called "segment elimination", which allows to skip over compressed segments of data as you scan. However every solid columnar data
385.
by nikita 12y ago
That's right. "Distinguished Engineer" is a title at Microsoft. At the time of my tenure at Microsoft my title was "Senior Engineer". The bio was written without referring to the title, but rather the fact that I wa
386.
The Auto Macro: A Clean Approach to C++ Error Handling(blog.memsql.com)
13 points by nikita 12y ago|0 comments
387.
by nikita 12y ago
Yes, fork can fail and we ran into this a few years ago at MemSQL. The problem was that MemSQL would allocate a lot of memory and linux wouldn't allow to fork such a process. A remedy to that is to create a separate process and talk t
388.
Announcing MemSQL Start[c]UP 2.0(blog.memsql.com)
1 points by nikita 12y ago|0 comments
389.
by nikita 12y ago
There are several companies in the valley that are going hard for ICPC winners. MemSQL is certainly one of them. In the past contestants were mostly going to big companies like Google. Hopefully we will see more and more of the top competit
390.
Standings in 38th Annual World Finals of the ACM International Collegiate(icpc.baylor.edu)
65 points by nikita 12y ago|17 comments

More ›