by Markus Winand.
A heap-table stores the rows in an unordered fashion. Index-organized tables and clustered indexes are the alternative. They store the rows in an ordered B-Tree structure.
Book-Section: Index-Organized Tables
Book-Section: B-Tree
Glossary: Clustered Index — Table stored in a B-Tree index
Glossary: Index-Organized Table — Oracle Clustered Index
You can’t learn everything in one day. Subscribe the newsletter via E-Mail, Bluesky or RSS to gradually catch up. Have a look at modern-sql.com as well.
Markus Winand provides insights into SQL and shows how different systems support it at modern-sql.com. Previously he made use-the-index-luke.com, which is still actively maintained. Markus can be hired as trainer, speaker and consultant via winand.at.
The essence of SQL tuning in 200 pages
Buy now!
(paperback and/or PDF)
Paperback also available at Amazon.com.
Markus offers SQL training and consulting for developers working at companies of all sizes.
Learn more »