diff options
| author | Teodor Sigaev | 2004-01-26 15:08:58 +0000 |
|---|---|---|
| committer | Teodor Sigaev | 2004-01-26 15:08:58 +0000 |
| commit | c102bc389f321ebf4fb6be80d5accc181e4f3777 (patch) | |
| tree | cf3cfafd64191a12361e40f688f1b06d57890eb3 | |
| parent | d406c2ceef0349dad9a57b37697fb065c904343f (diff) | |
Docs fix from Kris Jurka <[email protected]>
| -rw-r--r-- | contrib/ltree/README.ltree | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/contrib/ltree/README.ltree b/contrib/ltree/README.ltree index 249678147a..55b15d0f82 100644 --- a/contrib/ltree/README.ltree +++ b/contrib/ltree/README.ltree @@ -146,9 +146,9 @@ INDICES Various indices could be created to speed up execution of operations: * B-tree index over ltree: - <, <=, =, =>, > + <, <=, =, >=, > * GiST index over ltree: - <, <=, =, =>, >, @>, <@, @, ~, ? + <, <=, =, >=, >, @>, <@, @, ~, ? Example: create index path_gist_idx on test using gist (path); * GiST index over ltree[]: @@ -500,7 +500,7 @@ GiST, which provides indexed access. ltree: For ltree we store LPS in a B-tree, implemented using GiST. Each node entry is represented by (left_bound, signature, right_bound), so that we could speedup -operations <, <=, =, =>, > using left_bound, right_bound and prune branches of +operations <, <=, =, >=, > using left_bound, right_bound and prune branches of a tree using signature. ------------------------------------------------------------------------------- We ask people who find the module useful to send us a postcards to: |