Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
avinassh
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
43 ms
·
541.
▲
by
avinassh
4y ago
related: I love the illustration of fallacies by Denis Yu. It has cats! http://deniseyu.io/art/sketchnotes/topic-based/8-fallacies.p...
542.
▲
by
avinassh
4y ago
This looks so pretty! Did you use any CSS framework for the fonts and layout?
543.
▲
by
avinassh
4y ago
This is excellent! I see only throughput benchmarks. Redis is single threaded, beating it at latency would have been far more impressive. Do you have latency benchmarks at peak throughput?
544.
▲
by
avinassh
4y ago
Can you add/show some screenshots of the GUI
545.
▲
by
avinassh
4y ago
Would be nice if there was a tool which automates all this and hardens the Brave in one simple click
546.
▲
by
avinassh
4y ago
Isn't count slow on most databases? Either it ends up in table scan or index scan. But if the index is huge, then that will also take a lot of time. I wonder how do Big Co solve this counting problem.
547.
▲
by
avinassh
4y ago
Jeff Dean responded to OP: (The paper mentioned by OP is https://arxiv.org/abs/2205.12755 , and I am one of the two authors, along with Andrea Gesmundo, who did the bulk of the work). The goal of the work was not to get
548.
▲
by
avinassh
4y ago
> Time series means different things to different people. In this case, I want to focus on the type of time series storage engine that could efficiently power an OLTP system (strong consistency and immediately read your writes) or a moni
549.
▲
by
avinassh
4y ago
You cannot sign up on AWS Free Tier without the credit card info and many students end up with a huge bill. This sub reddit.com/r/aws/ has many such posts. Some links and discussions: - https://cloudirregular.subst
550.
▲
by
avinassh
4y ago
I could not find funding information on the Neon site. Is that information not public? edit: I found the info here: https://boards.greenhouse.io/neondatabase/jobs/4506003004
551.
▲
by
avinassh
4y ago
Thank you, I will read the paper!
552.
▲
by
avinassh
4y ago
> It was one of the best presentations in the PGcon22. I can't find it on Youtube, do you have the link? edit: I found the link, seems it is not on the Youtube yet: https://www.pgcon.org/events/pgcon_2022/s
553.
▲
by
avinassh
4y ago
This is really exciting and thank you for making it open source. I am still trying to wrap my head around the Neon, but is there any design document or architecture description? I want to learn more about the Neon storage engine and how it
554.
▲
by
avinassh
4y ago
Minor correction, both of them are source available, but not open source Cockroach DB license - https://github.com/cockroachdb/cockroach/blob/2c4e2c6/LICENS... Mongo license - https://github.c
555.
▲
by
avinassh
4y ago
What were the innovations by Vertica? Is there any link you have
556.
▲
by
avinassh
4y ago
Thank you for Blur. It is just excellent. I have been using it for years now and I highly recommend it to anyone who cares about privacy
557.
▲
by
avinassh
4y ago
What all the features real-time database provides?
558.
▲
by
avinassh
4y ago
Can you elaborate on why elixir is harder to write at scale
559.
▲
by
avinassh
4y ago
the pingcap article mentions multi-raft, Cockroach DB also does the same thing to reduce chatter and traffic blog post: https://www.cockroachlabs.com/blog/scaling-raft/
560.
▲
Professional Programming: The First 10 Years
(thorstenball.com)
58 points
by
avinassh
4y ago
|
1 comments
561.
▲
by
avinassh
4y ago
Five years back, my Della [0] project got me hired. It was a Secret Santa app built using Django. They also noticed Rockstar [1], a joke project, and I wasn't expecting anyone to bring it up. However, they liked how I was managing the
562.
▲
by
avinassh
4y ago
Hey, this looks great. What are some use cases you looking to solve, with this?
563.
▲
by
avinassh
4y ago
How it would handle conflicts?
564.
▲
by
avinassh
4y ago
LSM also requires periodic compaction, right? > I'm not sure how big a downside that is in practice, but it might be unfair to compare lmdb or rocksdb with bitcask if bitcask is never compacting. Bitcask also does compactions, they
565.
▲
by
avinassh
4y ago
I am not aware of any benchmarks with rocksdb (LSM) or lmdb (b-tree), but theoretically it will be much faster at the cost of extra RAM - In Bitcask, reads have at most single seek. Writes are just append - LSM - writes are just append, but
566.
▲
by
avinassh
4y ago
Yes! bitcask paper is straightforward to read and understand. The idea of bitcask was suggested to Riak's devs when Eric Brewer (of CAP theorem fame) joined Riak's board: > None of the local key/value storage systems avail
567.
▲
by
avinassh
4y ago
Thank you, fixed the typo.
568.
▲
by
avinassh
4y ago
Hey HN! For the past few months, I have been learning about the internals of database systems. After doing a batch at Recurse Center (Nov 2021) researching databases, I have been working on writing my toy database. I found many excellent ar
569.
▲
Show HN: CaskDB – project to teach you building a key value store
(github.com)
175 points
by
avinassh
4y ago
|
12 comments
570.
▲
by
avinassh
4y ago
This looks so cool! Thanks for making it open source and sharing. This instantly reminded me of Shelfari, I had lots of fun adding and cataloging books on it.
More ›