Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nikita
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
24 ms
·
331.
▲
by
nikita
4y ago
Some users called us Snowflake for OLTP, some others Snowflake for Postgres. Obv b/c of separation of storage and compute.
332.
▲
by
nikita
4y ago
We don't know. But we built it anyway because it may be that.
333.
▲
by
nikita
4y ago
Great questions! 1. Yes schema and data via "copy on write". This will let you instantly create test environments, backups, and run CI/CD. There is a long video here that shows a prototype with GitLab: https://www.
334.
▲
by
nikita
4y ago
Thank you! a. PolarDB is based on a similar idea. https://www.cs.utah.edu/~lifeifei/papers/polardbserverless-s... . This paper describes it. The biggest difference that I see glancing through the paper is that we r
335.
▲
by
nikita
4y ago
Postgres process in single tenant. Right now both provisioning a new Postgres instance (we call it project) and cold start is 2 seconds. We will be improving on that.
336.
▲
by
nikita
4y ago
Various compute instances are different endpoints to separate databases. So for now it's single writer system. You can get a lot of power out of a 128 core compute node. In the future will will also spin up extra compute to scale reads
337.
▲
by
nikita
4y ago
rektide is not Neon employee, nor is he or she was asked to post this. Thank you for the comment rektide. We of course would love to see constructive comments and criticism. - Neon CEO
338.
▲
by
nikita
4y ago
Hi Mani! For sure there are many serverless options - fewer that separated storage and compute and fewer that are open source end-to-end. Neon is also 100% compatible with Postgres (unlike CockroachDB) because compute is Postgres. Our inten
339.
▲
by
nikita
4y ago
Nikita - CEO of Neon here. We intended to post this at the launch next month, but since it here, I'm happy to answer any questions. We have been hard at work and looking to open the service to the public soon.
340.
▲
by
nikita
5y ago
What about the 6%. Are they better - let's use those!
341.
▲
by
nikita
5y ago
A different question. As someone who had to recover from Achilles tear and had to rebuild an atrophied calf muscle. Why don’t we just give anabolic steroids to people if their muscles atrophied after wearing a cast?
342.
▲
by
nikita
5y ago
I'm been following competitive programming for years and know multiple extremely successful "grads" of IOI and ACM ICPC. I have an ICPC bronze medal myself. The HN crowd will know Adam D'Angelo (IOI Gold) - cofounder of
343.
▲
by
nikita
5y ago
Are you looking for a job by any chance :)?
344.
▲
Solana Labs completes a $314M private token sale led by Andreessen Horowitz
(solana.com)
151 points
by
nikita
5y ago
|
337 comments
345.
▲
by
nikita
5y ago
It's a remote first company
346.
▲
by
nikita
5y ago
Zenith Lab is hiring Rust systems engineers. It's an early stage startup with great funding launching in a few months. Please reach out to founders@zenith.tech
347.
▲
Silicon Valley loses another tech icon
(fortune.com)
3 points
by
nikita
6y ago
|
0 comments
348.
▲
by
nikita
6y ago
I’ve been looking for a good app like this for a while. When commuting in a new area or going on ride such as https://rootsrated.com/san-francisco-ca/cycling/paradise-loo... it’s great to have turn by turn directi
349.
▲
by
nikita
6y ago
Yes, that’s it. I’m still of an opinion that it’s important to demonstrate performance on more complex queries with joins, subqueries, subselects, and clustered data movements. The count(*), group by query is a very very simple case.
350.
▲
by
nikita
6y ago
This sounds about right. The query is using count and not sum which i believe can be a bit faster. Yes. Branching will absolutely hurt. Good old x100 paper teaches how to avoid branching: http://cidrdb.org/cidr2005/pape
351.
▲
by
nikita
6y ago
In a naive case it compiles to a loop over all the elements and hash table prob for each element. Now the magic comes from a few observations: - cab_type has very few distinct values. so you can encode those values from 1 .. N and use an ar
352.
▲
Ways to Compute Pi in SQL
(memsql.com)
9 points
by
nikita
7y ago
|
0 comments
353.
▲
by
nikita
7y ago
Another way to think about MemSQL is that it's an operational database. This means that it can support high velocity transactions and power apps. The fact it can run decision support (OLAP) benchmarks is an important differentiation. S
354.
▲
A Bunch of Money on AWS and Some Benchmark Results
(memsql.com)
38 points
by
nikita
7y ago
|
39 comments
355.
▲
by
nikita
8y ago
To close the loop on this one. We looked at the query and strictly speaking we should be rejecting it b/c HAVING clause is referencing a column that's NOT in group by and NOT an aggregate expression. The query shape is: select
356.
▲
by
nikita
8y ago
Here, or https://www.memsql.com/forum/ , or memsql-public.slack.com.
357.
▲
by
nikita
8y ago
Can you post the full schema and query? Are you sure you are not projecting columns that are not part of the group by expression?
358.
▲
by
nikita
8y ago
There is a compound effect in building memory optimized features and being a distributed database that can put a lot more cores at work and cache a lot more data in a cluster: - In-memory row stores. Super fast for updates and point lookups
359.
▲
by
nikita
8y ago
Yes we have customers that standardize their database workloads on memsql and move off of oracle
360.
▲
by
nikita
8y ago
That’s right and it writes it on two separate nodes if u enable high availability
More ›