relational database
A database system that organizes data into tables with rows and columns, where relationships between tables are established through keys, allowing structured queries across related data.
As defined in Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
Other definitions
A database that organizes data into tables of rows and columns linked by keys and queried with SQL.
Go Slow to Go Fast: Software Building and Investing
Where it comes up · 5
- Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker5 claims
- MongoDB: The Database Platform4 claims
- Go Slow to Go Fast: Software Building and Investing4 claims
- #127 Larry Ellison (Oracle)2 claims
- #126: Larry Ellison (The Billionaire and the Mechanic)1 claim
Most important claims · 10 of 16Search all claims for “relational database” →
- Relational databases require the designer to define how all information interacts up front, and as a company adds customer fields and product variants, the relationships multiply and become complex and brittle, so changing the product can break the whole system.MongoDB: The Database Platform
- IBM's System R group had a working relational database around 1977 but did not ship a commercial product until February 1982, while Oracle had a relational database product on the market earlier, which let Oracle capture market share from IBM's slow process.#127 Larry Ellison (Oracle)
- A document database stores each unit of data as a flexible document with fields in any order, like a Word file, rather than fixed rows and columns, which makes it easier for developers to build and change applications.MongoDB: The Database Platform
- Oracle, founded in 1977 and a database leader from the 1980s, sustained dominance for decades, which is unprecedented in technology for a single company behind one core technology concept; SQL's pervasive use by developers and analysts propelled it.Go Slow to Go Fast: Software Building and Investing
- Finding a mentor early in your career who understands the field is crucial to success; Stonebraker credits Gene Wong at Berkeley for his mentorship in the early days of relational database research.Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
- MongoDB succeeded because web and mobile changed how users and applications interact with data, and unstructured, unpredictable data volumes grew sharply; market timing matters so much that a similar company started in 1992 would likely have failed.Go Slow to Go Fast: Software Building and Investing
- Graph databases are almost never the performant option for their stated use cases, and instead of building specialized graph database systems, companies should build graph user interface layers on top of relational databases to provide the graph abstraction.Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
- Oracle-style relational databases are well suited to highly structured, accurate data with predefined relationships, such as banking and order systems, but they become brittle and hard to change as the number of data types and relationships grows.MongoDB: The Database Platform
- Relational databases were clearly superior to existing alternatives (CODASIL's low-level pointer networks and IBM's hierarchical IMS systems) because they abstracted away physical-level implementation, allowing schema changes without rebuilding the entire database.Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
- In 2004, Stonebraker was working on an academic project that became StreamBase (a stream processing engine) and had ideas for column stores for data warehouses (popularized by Vertica), which were wildly different implementations that bore no resemblance to row stores.Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker