Resumo comentado: Designing Data-Intensive Applications — Parte 2

Representação de um índice (a seta é o caminho que o computador faz através das estruturas)
Exemplo de B-Tree
Exemplo de uma B-Tree de 3 níveis

--

--

--

Escritor-Desenvolvedor

Love podcasts or audiobooks? Learn on the go with our new app.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Adriano Croco

Adriano Croco

Escritor-Desenvolvedor

More from Medium

Implement LRU Cache

Concurrency vs Parallelism vs Multithreading

Engineer.inspect with Mary Koenke

Work from home setup with Bear, Mary’s helpful companion.

PACELC theorem