# Databases are Spreadsheets

DevFeed: [Databases are Spreadsheets](<https://devfeed.tech/articles/databases-are-spreadsheets-81338.md>)

Original publisher: [Read original article](<https://stack.convex.dev/databases-are-spreadsheets>)

Author: Stack

Published: 2024-04-16T16:00:00Z

Content type: tutorial

Language: en

Sources: [Stack](<https://devfeed.tech/sources/stack.md>)

Topics: [Deployment Strategies](<https://devfeed.tech/topics/deployment-strategies.md>), [search-engines](<https://devfeed.tech/topics/search-engines.md>), [NoSQL](<https://devfeed.tech/topics/nosql.md>), [Skiplists](<https://devfeed.tech/topics/skiplists.md>)

Tags: [b-tree](<https://devfeed.tech/tags/b-tree.md>), [binary-search](<https://devfeed.tech/tags/binary-search.md>), [database-indexes](<https://devfeed.tech/tags/database-indexes.md>), [databases](<https://devfeed.tech/tags/databases.md>), [full-text-search](<https://devfeed.tech/tags/full-text-search.md>), [linear-scan](<https://devfeed.tech/tags/linear-scan.md>), [perspectives](<https://devfeed.tech/tags/perspectives.md>)

## AI overview

The article explains database indexes through a spreadsheet analogy, showing how sorted indexes support efficient queries and how index design depends on query patterns and product needs. It discusses tradeoffs such as write overhead and storage, and contrasts indexed queries with scans or filtering.

## Source excerpt

I want to share my mental model of databases: - Databases are just big spreadsheets - An index is just a view of the spreadsheet sorted by one or more columns - Binary search over a sorted list is faster than a linear scan (for large lists)