A B-Tree is one type of underlying data source in a dhandle and is organized into pages.
An internal structure called a Data Handle (dhandle) is used to represent and access Btrees and other data sources in WiredTiger.
Row stores and column store are B-Trees. Row stores have a variable size key and data while column stores have as their key a record id.