Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Add hyperlinks for "index b-tree" and "table b-tree". |
|---|---|
| Downloads: | Tarball | ZIP archive |
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA3-256: |
35ca8da032c29c2161e7251173190da0 |
| User & Date: | drh 2018-06-05 13:43:25.417 |
Context
|
2018-06-07
| ||
| 18:29 | In althttpd.c, add the "anyone" line to the -auth file syntax. This allows inserting an -auth file that reads "http-redirect \n anyone" and which will force HTTP connections to redirect to HTTPS. (check-in: 9005943d91 user: drh tags: trunk) | |
|
2018-06-05
| ||
| 13:43 | Add hyperlinks for "index b-tree" and "table b-tree". (check-in: 35ca8da032 user: drh tags: trunk) | |
|
2018-06-04
| ||
| 19:41 | Add the upsert-clause.gif image. (check-in: 7d927bcea1 user: drh tags: trunk) | |
Changes
Changes to pages/fileformat2.in.
| ︙ | ︙ | |||
506 507 508 509 510 511 512 513 514 515 516 517 518 519 | together with the closure of its children form a complete b-tree. It is possible (and in fact rather common) to have a complete b-tree that consists of a single page that is both a leaf and the root. Because there are pointers from parents to children, every page of a complete b-tree can be located if only the root page is known. Hence, b-trees are identified by their root page number.</p> <p>A b-tree page is either a table b-tree page or an index b-tree page. All pages within each complete b-tree are of the same type: either table or index. There is one table b-trees in the database file for each rowid table in the database schema, including system tables such as sqlite_master. There is one index b-tree in the database file for each index in the schema, including implied indexes created by uniqueness constraints. There are no b-trees associated with | > | 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 |
together with the closure of its children form a complete b-tree.
It is possible (and in fact rather common) to have a complete b-tree
that consists of a single page that is both a leaf and the root.
Because there are pointers from parents to children, every page of a
complete b-tree can be located if only the root page is known. Hence,
b-trees are identified by their root page number.</p>
<tcl>hd_fragment {btypes} {index b-tree} {table b-tree}</tcl>
<p>A b-tree page is either a table b-tree page or an index b-tree page.
All pages within each complete b-tree are of the same type: either table
or index. There is one table b-trees in the database file
for each rowid table in the database schema, including system tables
such as sqlite_master. There is one index b-tree
in the database file for each index in the schema, including implied indexes
created by uniqueness constraints. There are no b-trees associated with
|
| ︙ | ︙ |