diff options
| author | Tatsuo Ishii <ishii@postgresql.org> | 2019-01-08 09:55:18 +0900 |
|---|---|---|
| committer | Tatsuo Ishii <ishii@postgresql.org> | 2019-01-08 09:55:18 +0900 |
| commit | 6ce6d983224a8cf00ff34bb3dd6c9d734d9bae86 (patch) | |
| tree | 86aebbd279e3956578a099b86391fd676a2b512a /doc/src | |
| parent | 7de8c719d3becdb4dcbefbae53c03c588a0ea699 (diff) | |
Doc: fix meaning of acronym "btree".
Acronym "btree" better means "multi-way balanced tree" rather than
"multi-way binary tree".
Discussion: https://postgr.es/m/20190105.183532.1686260542006440682.t-ishii%40sraoss.co.jp
Diffstat (limited to 'doc/src')
| -rw-r--r-- | doc/src/sgml/btree.sgml | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/src/sgml/btree.sgml b/doc/src/sgml/btree.sgml index c16825e2eaf..996932e35d0 100644 --- a/doc/src/sgml/btree.sgml +++ b/doc/src/sgml/btree.sgml @@ -13,7 +13,7 @@ <para> <productname>PostgreSQL</productname> includes an implementation of the - standard <acronym>btree</acronym> (multi-way binary tree) index data + standard <acronym>btree</acronym> (multi-way balanced tree) index data structure. Any data type that can be sorted into a well-defined linear order can be indexed by a btree index. The only limitation is that an index entry cannot exceed approximately one-third of a page (after TOAST |