惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

人人都是产品经理
人人都是产品经理
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
雷峰网
雷峰网
Google DeepMind News
Google DeepMind News
Y
Y Combinator Blog
Microsoft Security Blog
Microsoft Security Blog
M
MIT News - Artificial intelligence
WordPress大学
WordPress大学
MongoDB | Blog
MongoDB | Blog
V
V2EX
博客园 - 【当耐特】
GbyAI
GbyAI
Stack Overflow Blog
Stack Overflow Blog
I
InfoQ
Martin Fowler
Martin Fowler
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Hugging Face - Blog
Hugging Face - Blog
B
Blog
V
Visual Studio Blog
D
DataBreaches.Net
C
Check Point Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
F
Fortinet All Blogs

blag

SQLite prefixes its temp files with `etilqs_` - blag Setsum - order agnostic, additive, subtractive checksum - blag Oldest recorded transaction - blag Replacing a cache service with a database - blag SQLite commits are not durable under default settings - blag PSA: SQLite WAL checksums fail silently and may lose data - blag Rickrolling Turso DB (SQLite rewrite in Rust) - blag Collection of insane and fun facts about SQLite - blag How bloom filters made SQLite 10x faster - blag In search of a faster SQLite - blag Galloping Search - blag Building a distributed log using S3 (under 150 lines of Go) - blag Zero Disk Architecture - blag PSA: Most databases do not do checksums by default - blag PSA: SQLite does not do checksums - blag Disaggregated Storage - a brief introduction - blag Why does SQLite (in production) have such a bad rep? - blag SQLite Slaps - blag Now - blag Learning C - blag Snapshot Testing - blag Win: contribution to libSQL (SQLite) codebase - blag Errata in Hekaton MVCC paper - blag Internet is wholesome: MVCC edition - blag It is becoming difficult for me to be productive in Python - blag MongoDB secondary only index - blag Introducing CaskDB – a project to teach you writing a key-value store - blag Recurse Center: Winter Break - blag Recurse Center Day 24: Hacking Go compiler to add a new keyword - blag Recurse Center Day 20: Django v4 upgrade (from v1) - blag
Recurse Center Day 4: B Tree fill factor - blag
2021-11-05 · via blag

This is a draft post that I have prematurely published. Currently, I am attending RC and I want to write as much as possible, log my daily learnings and activities. But, I also don't want to spend time on grammar and prose, so I am publishing all the posts which usually I'd have kept in my draft folder.

I spent the half day today, because of Deepavali and also my sleep issues.

Advice and Introductions

We had a new activity today, where RC facilitators, alumni and people who are currently RC* joined the call and gave us advice.

All of us in the current batch introduced ourselves, our backgrounds and all things we want to do at RC. It was exciting to meet my batch, hear their diverse backgrounds and all the interesting things they want to do at RC.

Each alumnus introduced themselves, told us what they are doing at RC, shared their experiences. Here is some advice

  1. Have a few fallback projects along with the main ones, for rainy days so that you can bounce back
  2. Learn to balance time. Try to do both, socialise, learn from others but also work on your projects
  3. While RC is for three months, the time is quite limited. It finishes very quickly, be prepared!
  4. Reflect and keep reevaluating what works for you and what doesn’t
  5. There are so many exciting things going on here, try all of them!
  6. Go where your heart takes, do things that interest you most <3

*RC batches overlap. For e.g. my batch started on Nov 1 and will go on till Feb. A new batch starts on Jan 1 and my batch would overlap. I think this is nice because you get to know and work with lots of people, during a batch at RC.

Not much progress today. There is one question that keeps bugging me: how do I maintain the same fill factor across all nodes if the keys are of variable length?

B Tree nodes contain keys and the nodes have a property called Fill Factor. If the fill factor is 63% and if nodes can hold 100 keys, then we will put only 63 keys. However, the keys are variable in length, so not every node can hold 100 keys. So, I am wondering how do we achieve the same fill factor with all nodes.

People

I paired with Oliver today who is contributing to PyTorch. We discussed how to add tests to the PR. There were two ways to write the tests, I felt there no was right or wrong with either approach. Ultimately we decided that it is best we open the PR and ask the maintainer themselves.

I think this is one of the advantages contributing to the open source. If one is not sure how to do X, we could ask the maintainers and get some guidance. I think contributing to open source has surely improved my coding, especially low level design skills.

edit: The PR is now accepted. Hurray!

Deepavali

A rangoli by my artful wife:

Happy Deepavali :)